Felsenstein's tree-pruning algorithm: Difference between revisions

Revision as of 21:09, 16 February 2011

Revision as of 21:12, 16 February 2011

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 a [[Coalescent theory|coalescent tree]] from a set of [[genotype]]s.

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

==References==