Jump to content

Felsenstein's tree-pruning algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Szentendrei (talk | contribs) at 14:02, 27 July 2013. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

In statistical genetics, Felsenstein's tree-pruning algorithm (or Felsenstein's tree-peeling algorithm), due to Joseph Felsenstein, is an algorithm for computing the likelihood of an evolutionary tree from nucleic acid sequence data.

The algorithm is often used as a subroutine in a search for a maximum likelihood estimate for an evolutionary tree. Further, it can be used in a hypothesis test for whether evolutionary rates are constant (by using likelihood ratio tests). It can also be used to provide error estimates for the parameters describing an evolutionary tree.

References

  • Felsenstein, Joseph (1973). "Maximum likelihood and minimum-steps methods for estimating evolutionary trees from data on discrete characters". Systematic Zoology. 22 (3): 240–249.