Felsenstein's tree-pruning algorithm: Difference between revisions

Revision as of 14:02, 27 July 2013

Revision as of 11:27, 6 August 2013

Line 1:

In [[statistical genetics]], '''Felsenstein's tree-pruning algorithm''' (or '''Felsenstein's tree-peeling algorithm'''), due to [[Joe_Felsenstein|Joseph Felsenstein]], is an [[algorithm]] for computing the [[likelihood]] of an [[evolutionary tree]] from [[nucleic acid]] sequence data. <ref>{{cite doi|10.1093/sysbio/22.3.240}}</ref><ref>{{cite doi|10.1007/BF01734359}}</ref>

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 test]]s). It can also be used to provide error estimates for the parameters describing an evolutionary tree.

==References==

{{reflist}}

* {{cite journal |authorlink=Joseph Felsenstein |last=Felsenstein |first=Joseph |year=1973 |title=Maximum likelihood and minimum-steps methods for estimating evolutionary trees from data on discrete characters |journal=Systematic Zoology |volume=22 |pages=240-249 |issue=3 }}

* {{cite journal |authorlink=Joseph Felsenstein |last=Felsenstein |first=Joseph |year=1981 |title=Evolutionary trees from DNA sequences: a maximum likelihood approach |journal=J Mol Evol |volume=17 |pages=368–376 |pmid=7288891 |doi=10.1007/BF01734359 |issue=6 }}

{{genetics-stub}}