Skip to main content
SpringerLink
Log in
Book cover

Encyclopedia of Algorithms pp 564–567Cite as

Distance-Based Phylogeny Reconstruction (Fast-Converging)

  • Reference work entry
  • First Online:

  • 118 Accesses

Years and Authors of Summarized Original Work

  • 2003; King, Zhang, Zhou

Problem Definition

Introduction

From a mathematical point of view, a phylogeny defines a probability space for random sequences observed at the leaves of a binary tree T. The tree T represents the unknown hierarchy of common ancestors to the sequences. It is assumed that (unobserved) ancestral sequences are associated with the inner nodes. The tree along with the associated sequences models the evolution of a molecular sequence, such as the protein sequence of a gene. In the conceptually simplest case, each tree node corresponds to a species, and the gene evolves within the organismal lineages by vertical descent.

Phylogeny reconstruction consists of finding Tfrom observed sequences. The possibility of such reconstruction is implied by fundamental principles of molecular evolution, namely, that random mutations within individuals at the genetic level spreading to an entire mating population are not uncommon, since...

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Chang JT (1996) Full reconstruction of Markov models on evolutionary trees: identifiability and consistency. Math Biosci 137:51–73

    Article  MathSciNet  MATH  Google Scholar 

  2. Csürös M (2002) Fast recovery of evolutionary trees with thousands of nodes. J Comput Biol 9(2):277–297, Conference version at RECOMB 2001

    Article  Google Scholar 

  3. Csürös M, Kao M-Y (2001) Provably fast and accurate recovery of evolutionary trees through harmonic greedy triplets. SIAM J Comput 31(1):306–322, Conference version at SODA (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Daskalakis C, Hill C, Jaffe A, Mihaescu R, Mossel E, Rao S (2006) Maximal accurate forests from distance matrices. In: Proceedings of research in computational biology (RECOMB), pp 281–295

    Google Scholar 

  5. Daskalakis C, Mossel E, Roch S (2006) Optimal phylogenetic reconstruction. In: Proceedings of ACM symposium on theory of computing (STOC), pp 159–168

    Google Scholar 

  6. Erdős PL, Steel MA, Székely LA, Warnow TJ (1999) A few logs suffice to build (almost) all trees (I). Random Struct Algorithm 14:153–184, Preliminary version as DIMACS TR97-71

    Article  MathSciNet  MATH  Google Scholar 

  7. Erdős PL, Steel MA, Székely LA, Warnow TJ (1999) A few logs suffice to build (almost) all trees (II). Theor Comput Sci 221:77–118, Preliminary version as DIMACS TR97-72

    Article  MathSciNet  MATH  Google Scholar 

  8. Felsenstein J (2004) Inferring pylogenies. Sinauer Associates, Sunderland

    Google Scholar 

  9. Huson D, Nettles S, Warnow T (1999) Disk-covering, a fast converging method of phylogenetic reconstruction. J Comput Biol 6(3–4):369–386, Conference version at RECOMB (1999)

    Article  Google Scholar 

  10. King V, Zhang L, Zhou Y (2003) On the complexity of distance based evolutionary tree reconstruction. In: Proceedings of ACM-SIAM symposium on discrete algorithms (SODA), pp 444–453

    Google Scholar 

  11. Lagergren J (2002) Combining polynomial running time and fast convergence for the disk-covering method. J Comput Syst Sci 65(3):481–493

    Article  MathSciNet  MATH  Google Scholar 

  12. Lake JA (1994) Reconstructing evolutionary trees from DNA and protein sequences: paralinear distances. Proc Natl Acad Sci USA 91:1455–1459

    Article  Google Scholar 

  13. Lockhart PJ, Steel MA, Hendy MD, Penny D (1994) Recovering evolutionary trees under a more realistic model of sequence evolution. Mol Biol Evol 11:605–612

    Google Scholar 

  14. Neyman J (1971) Molecular studies of evolution: a source of novel statistical problems. In: Gupta SS, Yackel J (eds) Statistical decision theory and related topics. Academic, New York, pp 1–27

    Google Scholar 

  15. Ohta T (2002) Near-neutrality in evolution of genes and gene regulation. Proc Natl Acad Sci USA 99:16134–16137

    Article  Google Scholar 

  16. Steel MA (1994) Recovering a tree from the leaf colourations it generates under a Markov model. Appl Math Lett 7:19–24

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Montréal, Montréal, QC, Canada

    Miklós Csürös

Authors
  1. Miklós Csürös
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Csürös, M. (2016). Distance-Based Phylogeny Reconstruction (Fast-Converging). In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_114

Download citation

Publish with us

Policies and ethics

Search

Navigation