Improved algorithms for maximum agreement and compatible supertrees (Q627540): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i>(<i>n</i>log <i>n</i>) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128909 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Dynamic Programming for Evolutionary-Tree Comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the agreement of many trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial 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: Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of comparing evolutionary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910733 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rooted maximum agreement supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree Contractions and Evolutionary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526970 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A supertree method for rooted trees / 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: Kaikoura tree theorems: Computing the maximum agreement subtree / rank
 
Normal rank

Latest revision as of 19:27, 3 July 2024

scientific article
Language Label Description Also known as
English
Improved algorithms for maximum agreement and compatible supertrees
scientific article

    Statements

    Improved algorithms for maximum agreement and compatible supertrees (English)
    0 references
    0 references
    0 references
    0 references
    2 March 2011
    0 references
    phylogenetic tree
    0 references
    suptree
    0 references
    maximum agreement supertree
    0 references
    maximum compatible supertree
    0 references

    Identifiers

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