Unique Perfect Phylogeny Is NP-Hard (Q3011849): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Aspects of Tree Amalgamation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive graph searches / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterisation of rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of generalized satisfiability counting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An idealized concept of the true cladistic character / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algebraic analysis of cladistic characters / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical foundation for the analysis of cladistic character compatibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Sandwich Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and algorithms for reasoning about time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for inferring evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique perfect phylogeny is intractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating 3-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangulating Vertex-Colored Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization for a set of partial partitions to define an \(X\)-tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of reconstructing trees from qualitative characters and subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Latest revision as of 05:25, 4 July 2024

scientific article
Language Label Description Also known as
English
Unique Perfect Phylogeny Is NP-Hard
scientific article

    Statements

    Unique Perfect Phylogeny Is NP-Hard (English)
    0 references
    0 references
    0 references
    29 June 2011
    0 references

    Identifiers