Combinatorics of genome rearrangements
Furkejuvvon:
| Searvvušdahkki: | |
|---|---|
| Eará dahkkit: | |
| Materiálatiipa: | Elektrovnnalaš E-girji |
| Giella: | eaŋgalasgiella |
| Almmustuhtton: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Ráidu: | Computational molecular biology.
|
| Fáttát: | |
| Liŋkkat: | An electronic book accessible through the World Wide Web; click to view |
| Fáddágilkorat: |
Lasit fáddágilkoriid
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|
Sisdoallologahallan:
- 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.