Maximum agreement and compatible supertrees (Q2466022): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions / rank
 
Normal rank
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: Efficient probabilistically checkable proofs and applications to approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Phylogenetic supertrees. Combining information to reveal the tree of life / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension operations on sets of leaf-labelled trees / 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: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the domatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411282 / 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: On the complexity of constructing evolutionary trees / 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: Finding largest subtrees and smallest supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a maximum compatible tree is NP-hard for sequences and trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Finding Nearest Common Ancestors / 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: Rooted maximum agreement supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938785 / 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: Q4410170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4422502 / rank
 
Normal rank

Revision as of 14:03, 27 June 2024

scientific article
Language Label Description Also known as
English
Maximum agreement and compatible supertrees
scientific article

    Statements

    Maximum agreement and compatible supertrees (English)
    0 references
    0 references
    0 references
    11 January 2008
    0 references
    algorithms
    0 references
    trees
    0 references
    isomorphism and refinement relations
    0 references
    supertrees
    0 references
    computational biology
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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