Genomes frequently evolve by reversals ρ (i, j) that transform a gene order π1… π i π i+ 1…
π j-1π j… π n into π1… π i π j-1… π i+ 1π j… π n. Reversal distance between permutations …

Our basic question is: Given a collection of DNA sequences, what underlying forces are
responsible for the observed patterns of variability? To approach this question we introduce …

In one of the first major texts in the emerging field of computational molecular biology, Pavel
Pevzner covers a broad range of algorithmic and combinatorial topics and shows how they …

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

Sequence comparison in computational molecular biology is a powerful tool for deriving
evolutionary and functional relationships between genes. However, classical alignment …

Many people believe that transformations of humans into mice happen only in fairy tales.
However, despite some differences in appearance and habits, men and mice are genetically …

Motivation: Most existing approaches for phylogenetic inference use multiple alignment of
sequences and assume some sort of an evolutionary model. The multiple alignment strategy …

Molecular biology is becoming a computationally intense realm of contemporary science
and faces some of the current grand scientific challenges. In its context, tools that identify …

Abstract Analysis of genomes evolving by inversions leads to a general combinatorial
problem of Sorting by Reversals, MIN-SBR, the problem of sorting a permutation by a …

Various global rearrangements of permutations, such as reversals and transpositions have
recently become of interest because of their applications in genome analysis. The study of …