Felsenstein's tree-pruning algorithm: Difference between revisions

Revision as of 07:14, 11 April 2024

Revision as of 03:09, 22 May 2024

Line 5:

== Details ==

[[File:Tree_exemple.png|thumb|A simple phylogenetic tree exempleexample made from arbitrary data D]]

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 alignment for example ''i.e.'' a succession of <math> n </math> DNA site <math> s </math>) given the tree. It is often written : <math>P(D|T)</math>.

Line 17:

</math>

If I reuse the exempleexample above, <math>D_1</math> tree would be:

Line 56:

== Algorithm ==

== Simple ExempleExample ==

==References==