An improved bound on the maximum agreement subtree problem (Q1036838): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Tree structures for proximity data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reconstructing the shape of a tree from observed dissimilarity data / 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: Kaikoura tree theorems: Computing the maximum agreement subtree / rank
 
Normal rank
Property / cites work
 
Property / cites work: The agreement metric for labeled binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm to find agreement subtrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4276003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic permutations and evolutionary trees / rank
 
Normal rank

Revision as of 03:47, 2 July 2024

scientific article
Language Label Description Also known as
English
An improved bound on the maximum agreement subtree problem
scientific article

    Statements

    An improved bound on the maximum agreement subtree problem (English)
    0 references
    0 references
    0 references
    13 November 2009
    0 references
    phylogeny
    0 references
    phylogenetic tree
    0 references
    maximum agreement subtree
    0 references
    binary tree
    0 references
    caterpillar
    0 references
    cyclic order
    0 references

    Identifiers

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