Combinatorics of genome rearrangements / Guillaume Fertin ... [et al.].
Saved in:
| Superior document: | Computational molecular biology |
|---|---|
| : | |
| TeilnehmendeR: | |
| Year of Publication: | 2009 |
| Language: | English |
| Series: | Computational molecular biology.
|
| Online Access: | |
| Physical Description: | xi, 288 p. :; ill. |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
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.