A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …

String comparison is a fundamental problem in computer science, with applications in areas
such as computational biology, text processing or compression. In this paper we address the …

In the last decade there has been an ongoing interest in string comparison problems; to a
large extend the interest was stimulated by genome rearrangement problems in …

Abstract In the Minimum Common String Partition problem (MCSP) we are given two strings
on input, and we wish to partition them into the same collection of substrings, minimimizing …

Abstract Minimum Common String Partition (MCSP) has drawn much attention due to its
application in genome rearrangement. In this paper, we investigate three variants of MCSP …

Abstract Minimum Common String Partition (MCSP) and related problems are of interest in,
eg, comparative genomics, DNA fingerprint assembly, and ortholog assignment. Given two …

In the Minimum Common String Partition problem (MCSP), we are given two strings on input,
and we wish to partition them into the same collection of substrings, minimizing the number …

One of the most interesting recent trends for what concerns research on metaheuristics is
their hybridization with other techniques for optimization. In fact, the focus of research on …

For a string A= a1… an, a reversalρ (i, j), 1⩽ i⩽ j⩽ n, transforms the string A into a string A′=
a1… ai-1ajaj-1… aiaj+ 1… an, that is, the reversal ρ (i, j) reverses the order of symbols in the …

The minimum common string partition problem is an NP-hard combinatorial optimization
problem with applications in computational biology. In this work we propose the first integer …