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 aan [[Coalescent theory|coalescentevolutionary tree]] from a set of [[genotypenucleic acid]]s sequence data.
InThe particular,algorithm Felsenstein'sis treeoften pruningused algorithm providesas a computationallysubroutine feasiblein a schemesearch for findinga [[maximum likelihood]] estimatesestimate for [[an evolutionary tree]]s. from [[nucleic acid]] sequence data. Further, it allowsit thecan hypothesesbe toused bein testeda abouthypothesis test for whether evolutionary rates are constant (by using [[likelihood ratio test]]s,). anditIt can also indicationsbe ofused theto likelyprovide sizeserror ofestimates error infor the estimatedparameters treesdescribing an evolutionary tree.