Combinatorics of genome rearrangements
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.
| Otros Autores: | |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Cambridge, Mass. :
MIT Press
c2009.
|
| Colección: | EBSCO Academic eBook Collection Complete.
Computational molecular biology. |
| Acceso en línea: | Conectar con la versión electrónica |
| Ver en Universidad de Navarra: | https://innopac.unav.es/record=b31424648*spi |
Tabla de Contenidos:
- 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.
