Algorithms for finding a most similar subforest (Q538470): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W05 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 92D15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5899599 / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate pattern matching
Property / zbMATH Keywords: approximate pattern matching / rank
 
Normal rank
Property / zbMATH Keywords
 
forest edit distance
Property / zbMATH Keywords: forest edit distance / rank
 
Normal rank
Property / zbMATH Keywords
 
simple substructure
Property / zbMATH Keywords: simple substructure / rank
 
Normal rank
Property / zbMATH Keywords
 
sibling substructure
Property / zbMATH Keywords: sibling substructure / rank
 
Normal rank
Property / zbMATH Keywords
 
closed subforest
Property / zbMATH Keywords: closed subforest / rank
 
Normal rank
Property / zbMATH Keywords
 
dynamic programming
Property / zbMATH Keywords: dynamic programming / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-010-9274-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2136355740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Algorithm for Ordered Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / 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: Simple and efficient string matching with k mismatches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4432975 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / 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: Q4252025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing similarity between RNA structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4509227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing similar ordered trees in linear-time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate string-matching with \(q\)-grams and maximal matches / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:57, 4 July 2024

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