Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time (Q1167074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3887489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial mathematics VIII. Proceedings of the Eighth Australian Conference on Combinatorial Mathematics held at Deakin University, Geelong, Australia, August 25-29, 1980 / rank
 
Normal rank
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: 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
Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time
scientific article

    Statements

    Unlikelihood that minimal phylogenies for a realistic biological study can be constructed in reasonable computational time (English)
    0 references
    1982
    0 references
    minimal phylogenies
    0 references
    phylogeny of maximum parsimony
    0 references
    protein sequences
    0 references
    minimal spanning tree
    0 references
    NP-completeness
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references