## COMP571 (Fall 2020, a.k.a. COVID times)

Important note: The information contained in the course syllabus, other than the absence policies, may be subject to change with reasonable advance notice, a...

Important note: The information contained in the course syllabus, other than the absence policies, may be subject to change with reasonable advance notice, a...

In this example we will calculate the likelihood \(P(D|T,h)\) where \(D\) is a single site, \(T\) is a rooted tree topology, and \(h\) is the node heights fo...

The Sankoff algorithm can efficiently calculate the parsimony score of a tree topology. Felsensteinâ€™s pruning algorithm can efficiently calculate the probabi...

Long branch attraction is the phenomenon where two branches which are in truth not sisters are inferred to be sister branches when using maximum parsimony in...

The likelihood of a tree is the probability of a multiple sequence alignment or matrix of trait states (commonly known as a character matrix) given a tree to...