Jump to content

Felsenstein's tree-pruning algorithm

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Tony1 (talk | contribs) at 07:06, 20 October 2011. 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 (1981). "Evolutionary trees from DNA sequences: a maximum likelihood approach". J Mol Evol. 17 (6): 368โ€“376. doi:10.1007/BF01734359. PMID 7288891.