The Steiner problem in phylogeny is NP-complete (Q1167073)
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 Steiner problem in phylogeny is NP-complete |
scientific article; zbMATH DE number 3771395
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The Steiner problem in phylogeny is NP-complete |
scientific article; zbMATH DE number 3771395 |
Statements
The Steiner problem in phylogeny is NP-complete (English)
0 references
1982
0 references
evolutionary tree
0 references
protein sequences
0 references
maximum parsimony
0 references
minimal spanning tree
0 references
NP-completeness
0 references
Steiner problem
0 references
phylogeny
0 references
DNA structures
0 references
Hamming distance
0 references
