Combinatorics of genome rearrangements
Kaydedildi:
| Müşterek Yazar: | |
|---|---|
| Diğer Yazarlar: | |
| Materyal Türü: | Elektronik Ekitap |
| Dil: | İngilizce |
| Baskı/Yayın Bilgisi: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Seri Bilgileri: | Computational molecular biology.
|
| Konular: | |
| Online Erişim: | An electronic book accessible through the World Wide Web; click to view |
| Etiketler: |
Etiketle
Etiket eklenmemiş, İlk siz ekleyin!
|
İçindekiler:
- 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.