ReCombinatorics : The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks /
Combinatorial structure and algorithms for deducing genetic recombination history, represented by ancestral recombination graphs and other networks, and their role in the emerging field of phylogenetic networks.
Auteur principal: | |
---|---|
Autres auteurs: | , , |
Format: | Électronique eBook |
Langue: | Inglés |
Publié: |
Cambridge, Massachusetts :
The MIT Press,
[2014]
|
Collection: | Book collections on Project MUSE.
|
Sujets: | |
Accès en ligne: | Texto completo |
Table des matières:
- Introduction
- Trees first
- A deeper introduction to recombination and networks
- Exploiting recombination
- First bounds
- Fundamental combinatorial structure and tools
- First uses of fundamental structure
- Galled trees
- General ARG construction methods
- The History and Forest lower bounds
- Conditions to guarantee a fully decomposed MinARG
- Tree and ARG-based haplotyping
- Tree and ARG-based association mapping
- Extensions and connections
- A short introduction to integer linear programming.