Combinatorics of genome rearrangements
I tiakina i:
| Kaituhi rangatōpū: | |
|---|---|
| Ētahi atu kaituhi: | |
| Hōputu: | Tāhiko īPukapuka |
| Reo: | Ingarihi |
| I whakaputaina: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Rangatū: | Computational molecular biology.
|
| Ngā marau: | |
| Urunga tuihono: | An electronic book accessible through the World Wide Web; click to view |
| Ngā Tūtohu: |
Tāpirihia he Tūtohu
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|
Rārangi ihirangi:
- 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.