Exact algorithms for computing the tree edit distance between unordered trees (Q620949): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Decomposition Algorithm for Tree Edit Distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an algorithm of Zemlyachenko for subtree isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED 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: Ordered and Unordered Tree Inclusion / 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: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the editing distance between unordered labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some MAX SNP-hard results concerning unordered labeled trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained edit distance between unordered labeled trees / rank
 
Normal rank

Latest revision as of 17:57, 3 July 2024

scientific article
Language Label Description Also known as
English
Exact algorithms for computing the tree edit distance between unordered trees
scientific article

    Statements

    Exact algorithms for computing the tree edit distance between unordered trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2011
    0 references
    0 references
    0 references
    0 references
    0 references
    tree edit distance
    0 references
    fixed-parameter algorithms
    0 references
    dynamic programming
    0 references
    unordered trees
    0 references
    0 references