An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2081574366 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0604108 / 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: O(n2.5) time algorithms for the subgraph homeomorphism problem on 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: Faster algorithms for subgraph isomorphism of \(k\)-connected partial \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: RNA secondary structure comparison: Exact analysis of the Zhang-Shasha tree edit algorithm. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph distance metric combining maximum common subgraph and minimum common supergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding largest subtrees and smallest supertrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem for arc-annotated sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alignment of trees -- an alternative to tree edit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordered and Unordered Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of finding iso- and other morphisms for partial \(k\)- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate labelled subtree homeomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Subtree Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximate algorithms for unordered tree matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for the unit cost editing distance between trees / 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: Q4779780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained Tree Inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained tree inclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Fast Algorithms for the Editing Distance between Trees and Related Problems / rank
 
Normal rank

Latest revision as of 21:59, 24 June 2024

scientific article
Language Label Description Also known as
English
An algebraic view of the relation between largest common subtrees and smallest common supertrees
scientific article

    Statements

    An algebraic view of the relation between largest common subtrees and smallest common supertrees (English)
    0 references
    0 references
    0 references
    20 October 2006
    0 references
    tree pattern matching
    0 references
    subtree isomorphism
    0 references
    subtree homeomorphism
    0 references
    topological embedding
    0 references
    minor containment
    0 references
    largest common subtree
    0 references
    smallest common supertree
    0 references
    0 references
    0 references

    Identifiers

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