The computational complexity of inferring rooted phylogenies by parsimony (Q1086183)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The computational complexity of inferring rooted phylogenies by parsimony |
scientific article; zbMATH DE number 3982966
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The computational complexity of inferring rooted phylogenies by parsimony |
scientific article; zbMATH DE number 3982966 |
Statements
The computational complexity of inferring rooted phylogenies by parsimony (English)
0 references
1986
0 references
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.
0 references
computational complexity
0 references
rooted phylogenies
0 references
evolutionary trees
0 references
evolutionary change
0 references
Camin-Sokal and Dollo parsimony criteria
0 references
cladistic
0 references
qualitative
0 references
binary
0 references
multistate
0 references
NP-complete
0 references
