Includes bibliographical references (pages 263-282) and index.
Contents
Genomes as permutations -- Distances between unsigned permutations -- Distances between signed permutations -- Rearrangements of partial orders -- Graph-theoretic and linear algebra formulations -- Generalities -- Distances between arbitrary strings -- Distances between balanced strings -- Paths and cycles -- Cycles of a permutation -- Set systems and the syntenic distance -- Median and halving problems -- Rearrangement phylogenies -- Software -- Open problems.
Summary
A comprehensive survey of a rapidly expanding field of combinatorial optimization, mathematically orientated but offering biological explanations when required, this volume offers the first comprehensive survey of a rapidly expanding application of combinatorial optimization.
Local Note
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - North America