The Steiner problem in phylogeny is NP-complete (Q1167073): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank |
Revision as of 03:26, 5 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The Steiner problem in phylogeny is NP-complete |
scientific article |
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