The Steiner problem in phylogeny is NP-complete (Q1167073): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: The Complexity of Computing Steiner Minimal Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Steiner Minimal Trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel concepts in graph theory / rank | |||
Normal rank |
Latest revision as of 16:23, 13 June 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