ReCombinatorics : the algorithmics of ancestral recombination graphs and explicit phylogenetic networks / Dan Gusfield ; with contributions from Charles H. Langley, Yun S. Song and Yufeng Wu.
Material type: TextPublisher: Cambridge, Massachusetts : The MIT Press, [2014]Description: 1 online resource (xvii, 580 pages)Content type:- text
- computer
- online resource
- 9780262324472
- 0262324474
- 130695780X
- 9781306957809
- Re combinatorics
- 572.8/77 23
- QH443 .G87 2014eb
- QU 475
Item type | Home library | Collection | Call number | Materials specified | Status | Date due | Barcode | |
---|---|---|---|---|---|---|---|---|
Electronic-Books | OPJGU Sonepat- Campus | E-Books EBSCO | Available |
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.
Includes bibliographical references and index.
Print version record.
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.
eBooks on EBSCOhost EBSCO eBook Subscription Academic Collection - Worldwide
There are no comments on this title.