The computational complexity of inferring rooted phylogenies by parsimony
In systematics, parsimony methods construct phylogenies, or evolutionary trees, in which characters evolve with the least evolutionary change. The Camin-Sokal and Dollo parsimony criteria are used to construct phylogenies from discrete characters. Variations of these problems depend on whether characters are: cladistic or qualitative, binary or multistate. The authors proved that the basic variants of these problems are all NP-complete.
Camin-Sokal and Dollo parsimony criteria
scientific article; zbMATH DE number 3982966