next up previous
Next: Branch and Bound Up: Parsimony Previous: Weighted Parsimony

   
Large Parsimony

Even after having solved the problem of small parsimony, we still have a long way to go, because the final goal is to find the optimal phylogeny, not just the optimal internal labeling of a given phylogeny:
\begin{problem}Large Parsimony.\\ {\bf INPUT:} A matrix $M$\space describing $m... ...y for these species, i.e., the one minimizing the parsimony score? \end{problem}

Again, this problem has a weighted and a non-weighted (discrete) version, but the difference is not essential. It can be shown that this problem is NP-hard, even in the discrete version. However, we will present several algorithms attempting to solve the problem of large parsimony.


Peer Itsik
2001-01-01