Combinatorics of genome rearrangements
Spremljeno u:
| Autor kompanije: | |
|---|---|
| Daljnji autori: | |
| Format: | Elektronički e-knjiga |
| Jezik: | engleski |
| Izdano: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Serija: | Computational molecular biology.
|
| Teme: | |
| Online pristup: | An electronic book accessible through the World Wide Web; click to view |
| Oznake: |
Dodaj oznaku
Bez oznaka, Budi prvi tko označuje ovaj zapis!
|
Sadržaj:
- 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.