Combinatorics of genome rearrangements
Saved in:
| 企业作者: | |
|---|---|
| 其他作者: | |
| 格式: | 电子 电子书 |
| 语言: | 英语 |
| 出版: |
Cambridge, Mass. :
MIT Press,
c2009.
|
| 丛编: | Computational molecular biology.
|
| 主题: | |
| 在线阅读: | An electronic book accessible through the World Wide Web; click to view |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
书本目录:
- 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.