Combinatorics of genome rearrangements
Сохранить в:
| Соавтор: | |
|---|---|
| Другие авторы: | |
| Формат: | Электронный ресурс eКнига |
| Язык: | английский |
| Опубликовано: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| Серии: | Computational molecular biology.
|
| Предметы: | |
| Online-ссылка: | An electronic book accessible through the World Wide Web; click to view |
| Метки: |
Добавить метку
Нет меток, Требуется 1-ая метка записи!
|
Оглавление:
- 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.