Combinatorics of genome rearrangements
Sparad:
| Institutionell skapare: | |
|---|---|
| Övriga skapare: | |
| Materialtyp: | Elektronisk E-bok |
| Språk: | engelska |
| Publicerad: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Serie: | Computational molecular biology.
|
| Ämnen: | |
| Länkar: | An electronic book accessible through the World Wide Web; click to view |
| Taggar: |
Lägg till en tagg
Inga taggar, Lägg till första taggen!
|
Innehållsförteckning:
- 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.