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

Bioinformatics regularly poses new challenges to algorithm engineers and theoretical
computer scientists. This work surveys recent developments of parameterized algorithms …

In comparative genomics, a transposition is an operation that exchanges two consecutive
sequences of genes in a genome. The transposition distance between two genomes, that is …

Multiple genome rearrangement by swaps and by element duplications Page 1 Theoretical
Computer Science 385 (2007) 115–126 www.elsevier.com/locate/tcs Multiple genome …

Most genome rearrangements (eg, reversals and translocations) can be represented as 2-
breaks that break a genome at 2 points and glue the resulting fragments in a new order …

String problems arise in various applications ranging from text mining to biological
sequence analysis. Many string problems are NP-hard. This motivates the search for (fixed …

The adjacency graph is a structure used to model genomes in several rearrangement
distance problems. In particular, most studies use properties of a maximum cycle packing of …

The rearrangement distance is a method to compare genomes of different species. Such
distance is the number of rearrangement events necessary to transform one genome into …

Genome rearrangements are events where large blocks of DNA exchange places during
evolution. The analysis of these events is a promising tool for understanding evolutionary …

In a landmark paper, Nadeau and Taylor formulated the random breakage model (RBM) of
chromosome evolution that postulates that there are no rearrangement hotspots in the …