Combinatorics of genome rearrangements
Saved in:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Electronisk eBog |
| Sprog: | engelsk |
| Udgivet: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Serier: | Computational molecular biology.
|
| Fag: | |
| Online adgang: | An electronic book accessible through the World Wide Web; click to view |
| Tags: |
Tilføj Tag
Ingen Tags, Vær først til at tagge denne postø!
|
Indholdsfortegnelse:
- 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.