Revision as of 07:06, 20 October 2011 edit Tony1 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Template editors 279,034 edits m moved Felsenstein's tree pruning algorithm to Felsenstein's tree-pruning algorithm ← Previous edit		Revision as of 07:06, 20 October 2011 edit undo Tony1 (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers, Template editors 279,034 edits mNo edit summary Next edit →
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. 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.

Felsenstein's tree-pruning algorithm: Difference between revisions