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

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

Finding most parsimonious tree

   There are exponentially many trees with n nodes
   Finding most parsimonious tree is NP-complete (for most variants of parsimony models)
   Exception: Perfect phylogeny if exists can be found quickly. Problem – perfect phylogeny is to restrictive in practice.