Online Lectures on Bioinformatics

Phylogenetic Trees and Multiple AlignmentsParsimonyGiven a tree topology and i.e. DNAsequences as leaves. Parsimony means to minimize the number of mutations, which are necessary to explain the DNAsequences: Find the assignment of characters to the interior nodes, such that the number of mutations along the edges is minimale. There exists a dynamic programming algorithm by Fitch and Hartigan. If the treetopolgy is not given, the task is to find the topology, which minimizes the parsimonyscore. The most pasimonious tree problem is NPcomplete (use branch and bound methods).
Comments are very welcome. luz@molgen.mpg.de 