Search landscape analysis has become a central tool for analysing the dependency of the
performance of stochastic local search algorithms on structural aspects of the spaces being …

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 …

Local search with k-exchange neighborhoods, k-opt, is the most widely used heuristic
method for the traveling salesman problem (TSP). This paper presents an effective …

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 …

The original goal of writing this book was to introduce the reader to the tools of
combinatorics from an applied point of view. This third edition of Applied Combinatorics was …

Recent progress in genome-scale sequencing and comparative map** raises new
challenges in studies of genome rearrangements. Although the pairwise genome …

We give a number of improved inapproximability results, including the best up to date
explicit approximation thresholds for bounded occurence satisfiability problems like MAX …

Hannenhalli and Pevzner gave the first polynomial-time algorithm for computing the
inversion distance between two signed permutations, as part of the larger task of …

A comprehensive account of both basic and advanced material in phylogeny estimation,
focusing on computational and statistical issues. No background in biology or computer …