Content deleted Content added
Extend the previous stub. I started to detail the functionning of Felsenstein's pruning algorith. It still needs exemples, illustrations and, of course, the algorithme itselfs. |
m v2.05b - WPcleaner - Fix errors for CW project (Heading start with three "=" and later with level two) |
||
Line 4:
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.
The '''likelihood''' of a tree <math>T</math> is, by definition, the probability of observing certain data <math>D</math> (<math>D</math> being a nucleotide sequence alignement for example ''i.e.'' a succesion of <math> n </math> DNA site <math> s </math>) given the tree. It is often written : <math>P(D|T)</math>.
Line 51:
After doing so for every site <math>s</math>, one can finally obtain the likelihood of the global evolutionary tree.
==References==
| |||