Combinatorics of genome rearrangements / Guillaume Fertin [and others].

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.

Saved in:
Bibliographic Details
Other Authors: Fertin, Guillaume, 1972-
Format: eBook
Published: Cambridge, Mass. : MIT Press, ©2009.
Series:Computational molecular biology.
Online Access:Click for online access
Click for online access
Table of 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.