Felsenstein's tree-pruning algorithm

Felsenstein's tree-pruning algorithm

From Wikipedia, the free encyclopedia

�0�2�0�2(Redirected from Felsenstein's tree peeling algorithm)

Jump to: navigation, search

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.

[edit] 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.

This genetics article is a stub. You can help Wikipedia by expanding it. v t e

This statistics-related article is a stub. You can help Wikipedia by expanding it. v t e

Retrieved from " http://en.wikipedia.org/w/index.php?title=Felsenstein%27s_tree-pruning_algorithm&oldid=456478671"