Algorithms for finding a most similar subforest (Q538470)

From MaRDI portal
Revision as of 01:57, 4 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithms for finding a most similar subforest
scientific article

    Statements

    Algorithms for finding a most similar subforest (English)
    0 references
    0 references
    0 references
    25 May 2011
    0 references
    approximate pattern matching
    0 references
    forest edit distance
    0 references
    simple substructure
    0 references
    sibling substructure
    0 references
    closed subforest
    0 references
    dynamic programming
    0 references

    Identifiers