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

From Wikisource
Jump to navigation Jump to search
This page has been proofread, but needs to be validated.

Variants of parsimony

   Fitch Parsimony unordered, multistate characters with reversibility
   Wagner Parsimony ordered, multistate characters with reversibility
   Dollo Parsimony ordered, binary characters with reversibility but only one insertion allowed per character characters that are relatively chard to gain but easy to lose (like introns)
   Camin-Sokal Parsimony- no reversals, derived states arise once only
   (binary) prefect phylogeny – binary and nonreversible; each character changes at most once.