Online Public Access Catalogue (OPAC)
Library,Documentation and Information Science Division

“A research journal serves that narrow

borderland which separates the known from the unknown”

-P.C.Mahalanobis


Image from Google Jackets

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.

By: Contributor(s): Material type: TextTextPublication details: Cambridge : MIT Press, c2014.Description: xvii, 580 p. : illustrations ; 23 cmISBN:
  • 9780262027526 (hardcover : alk. paper)
Subject(s): DDC classification:
  • 572.877 23 G982
Contents:
1. 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.
Summary: In 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Holdings
Item type Current library Call number Status Date due Barcode Item holds
Books ISI Library, Kolkata 572.877 G982 (Browse shelf(Opens below)) Available 136335
Total holds: 0

Includes bibliographical references and index.

1. 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.

In 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.

There are no comments on this title.

to post a comment.
Library, Documentation and Information Science Division, Indian Statistical Institute, 203 B T Road, Kolkata 700108, INDIA
Phone no. 91-33-2575 2100, Fax no. 91-33-2578 1412, ksatpathy@isical.ac.in