000			03252cam a2200277 i 4500
001			136335
003			ISI Library, Kolkata
005			20151117165307.0
008			131212s2014 maua b 001 0 eng
020			_a9780262027526 (hardcover : alk. paper)
040			_aISI Library
082	0	4	_a572.877 _223 _bG982
100	1		_aGusfield, Dan.
245	1	0	_aReCombinatorics : _bthe algorithmics of ancestral recombination graphs and explicit phylogenetic networks / _cDan Gusfield ; with contributions from Charles H. Langley, Yun S. Song and Yufeng Wu.
260			_aCambridge : _bMIT Press, _cc2014.
300			_axvii, 580 p. : _billustrations ; _c23 cm.
504			_aIncludes bibliographical references and index.
505	0		_a1. Introduction -- 2. Trees first -- 3. A deeper introduction to recombination and networks -- 4. Exploiting recombination -- 5. First bounds -- 6. Fundamental combinatorial structure and tools -- 7. First uses of fundamental structure -- 8. Galled trees -- 9. General ARG contruction methods -- 10. The History and Forest lower bounds -- 11. Conditions to guarantee a fully decomposed MinARG -- 12. Tree and ARG-based haplotyping -- 13. Tree and ARG-based association mapping -- 14. Extensions and connections -- A. A short introduction to integer linear programming-- Bibliography-- Index.
520			_aIn this book, Dan Gusfield examines combinatorial algorithms to construct genealogical and exact phylogenetic networks, particularly ancestral recombination graphs (ARGs). The algorithms produce networks (or information about networks) that serve as hypotheses about the true genealogical history of observed biological sequences and can be applied to practical biological problems. Phylogenetic trees have been the traditional means to represent evolutionary history, but there is a growing realization that networks rather than trees are often needed, most notably for recent human history. This has led to the development of ARGs in population genetics and, more broadly, to phylogenetic networks. ReCombinatorics offers an in-depth, rigorous examination of current research on the combinatorial, graph-theoretic structure of ARGs and explicit phylogenetic networks, and algorithms to reconstruct or deduce information about those networks. ReCombinatorics, a groundbreaking contribution to the emerging field of phylogenetic networks, connects and unifies topics in population genetics and phylogenetics that have traditionally been discussed separately and considered to be unrelated. It covers the necessary combinatorial and algorithmic background material; the various biological phenomena; the mathematical, population genetic, and phylogenetic models that capture the essential elements of these phenomena; the combinatorial and algorithmic problems that derive from these models; the theoretical results that have been obtained; related software that has been developed; and some empirical testing of the software on simulated and real biological data.
650		0	_aGenetic recombination.
650		0	_aEvolution (Biology)
700	1		_aLangley, Charles H., _econtributor
700	1		_aSong Yun S., _econtributor
700	1		_aWu, Yufeng, _econtributor
942			_2ddc _cBK
999			_c419401 _d419401