Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

A unified methodology is presented for solving general global optimization problems. Based on the canonical dualitytriality theory, the nonconvex/nonsmooth/discrete problems from totally different systems are reformulated as a canonical min–max problem, which is equivalent to a monotone variational inequality problem over a convex cone. Therefore, a complementary-dual projection method is used ...

DNA sequencing methods are the subject of continued interest in molecular biology for use in a wide variety of applications. Sequencing DNA by hybridization on a “DNA chip” has been estimated to increase the rate of DNA sequencing as much as one-million fold. In this process, the sequence of a target molecule is reconstructed by the complementary binding of a pool of random probe molecules. For...

In this paper, two problems on domino logic synthesis are addressed. A mapping method that maps the complementary logic cones independently when AND/OR logic is to be implemented, and together using dual-monotonic gates in the case of XOR/XNOR logic, is proposed. The results show up to 28.9% improvement in area and always show the same or better performance in delay over existing approaches. Th...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

We present recent developments on the syntax of Real, a library for interfacing two Prolog systems to the statistical language R. We focus on the changes in Prolog syntax within SWI-Prolog that accommodate greater syntactic integration, enhanced user experience and improved features for web-services. We recount the full syntax and functionality of Real as well as presenting sister packages whic...

Network objects are a simple and natural abstraction for distributed object-oriented programming. Languages that support network objects, however, often leave synchronization to the user, along with its associated pitfalls, such as data races and the possibility of failure. In this paper, we present D-SCOOP, a distributed programming model that allows for interference-free and transactionlike r...

Resum This paper deals with an NP-hard string problem from the bio-informatics field: the repetition-free longest common subsequence problem. This problem has enjoyed an increasing interest in recent years, which has resulted in the application of several pure as well as hybrid metaheuristics. However, the literature lacks a comprehensive comparison between those approaches. Moreover, it has be...

Developmental programming links growth in early life with health status in adulthood. Although environmental factors such as maternal diet can influence the growth and adult health status of offspring, the genetic influences on this process are poorly understood. Using the mouse as a model, we identify the imprinted gene Grb10 as a mediator of nutrient supply and demand in the postnatal period....