Visit our Christmas Gift Finder
ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks - The MIT Press (Hardback)
  • ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks - The MIT Press (Hardback)
zoom

ReCombinatorics: The Algorithmics of Ancestral Recombination Graphs and Explicit Phylogenetic Networks - The MIT Press (Hardback)

(author)
£50.00
Hardback 600 Pages / Published: 03/07/2014
  • We can order this

Usually dispatched within 1 week

  • This item has been added to your basket
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. 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.

Publisher: MIT Press Ltd
ISBN: 9780262027526
Number of pages: 600
Weight: 1070 g
Dimensions: 229 x 178 x 32 mm


MEDIA REVIEWS
The book is highly organized, easy to follow, and easy to read. It is self-contained both with respect to biology and combinatorics, and it would be suitable for a researcher in either discipline, or in computer science, who wants to learn the necessary background and theorems. -Computing Reviews
The book is highly organized, easy to follow, and easy to read. It is self-contained both with respect to biology and combinatorics, and it would be suitable for a researcher in either discipline, or in computer science, who wants to learn the necessary background and theorems. -Computing Reviews * Reviews *

You may also be interested in...

Proofs from THE BOOK
Added to basket
Introduction to Graph Theory
Added to basket
Discrete Mathematics
Added to basket
Proofs and Fundamentals
Added to basket
Principia Mathematica - Volume One
Added to basket
Problems in Probability
Added to basket
A Geometrical Picture Book
Added to basket
A Combinatorial Introduction to Topology
Added to basket

Please sign in to write a review

Your review has been submitted successfully.