Decomposition algorithms for the tree edit distance problem (Q2569420): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Fast Algorithms for Finding Nearest Common Ancestors / 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: Q4252025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tree-to-tree editing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree edit distance with gaps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4779780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The String-to-String Correction Problem / 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 18:04, 10 June 2024

scientific article
Language Label Description Also known as
English
Decomposition algorithms for the tree edit distance problem
scientific article

    Statements

    Decomposition algorithms for the tree edit distance problem (English)
    0 references
    0 references
    0 references
    27 October 2005
    0 references
    algorithm
    0 references
    edit distance
    0 references
    alignment
    0 references
    tree
    0 references
    computational biology
    0 references

    Identifiers

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