Page:Principles of Computational Biology Lecture 11, Phylogenetic trees.pdf/5

This page has been proofread, but needs to be validated.

Assumption of character based parsimony

   Each taxa is described by a set of characters
   Each character can be in one of finite number of states
   In one step certain changes are allowed in character states
   Goal: find evolutionary tree that explains the states of the taxa with minimal number of changes