Includes bibliographical references (p. [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.
Reproduction
Electronic reproduction. Ann Arbor, MI : ProQuest, 2015. Available via World Wide Web. Access may be limited to ProQuest affiliated libraries.
