Jump to content

Felsenstein's tree-pruning algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Quantling (talk | contribs) at 21:09, 16 February 2011 (moved Felsenstein's tree peeling algorithm to Felsenstein's tree pruning algorithm: Use the name from the source paper, Felsenstein (1981, doi:10.1007/BF01734359)). 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 peeling algorithm, due to Joseph Felsenstein, is an algorithm for computing the likelihood of a coalescent tree from a set of genotypes.

In particular, Felsenstein's tree peeling algorithm provides a computationally feasible scheme for finding maximum likelihood estimates for evolutionary trees from nucleic acid sequence data. Further, it allows the hypotheses to be tested about whether evolutionary rates are constant (by using likelihood ratio tests, and it can also indications of the likely sizes of error in the estimated trees.

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.
Stub icon

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

Stub icon

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

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