Combinatorics of genome rearrangements
Wedi'i Gadw mewn:
| Awdur Corfforaethol: | |
|---|---|
| Awduron Eraill: | |
| Fformat: | Electronig eLyfr |
| Iaith: | Saesneg |
| Cyhoeddwyd: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Cyfres: | Computational molecular biology.
|
| Pynciau: | |
| Mynediad Ar-lein: | An electronic book accessible through the World Wide Web; click to view |
| Tagiau: |
Ychwanegu Tag
Dim Tagiau, Byddwch y cyntaf i dagio'r cofnod hwn!
|
Tabl Cynhwysion:
- 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.