Algorithms for finding a most similar subforest
From MaRDI portal
Publication:538470
DOI10.1007/S00224-010-9274-7zbMATH Open1217.68242OpenAlexW2136355740MaRDI QIDQ538470FDOQ538470
Authors: Jesper Jansson, Zeshan Peng 
Publication date: 25 May 2011
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-010-9274-7
Recommendations
dynamic programmingapproximate pattern matchingclosed subforestforest edit distancesibling substructuresimple substructure
Cites Work
- The Tree-to-Tree Correction Problem
- A survey on tree edit distance and related problems
- Title not available (Why is that?)
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Title not available (Why is that?)
- Alignment of trees -- an alternative to tree edit
- Ordered and Unordered Tree Inclusion
- Approximate string-matching with \(q\)-grams and maximal matches
- New algorithm for ordered tree-to-tree correction problem
- Title not available (Why is that?)
- Theoretical Computer Science
- Algorithms and Computation
- Simple and efficient string matching with k mismatches
- Constrained tree inclusion
- An optimal decomposition algorithm for tree edit distance
- Computing similarity between RNA structures
- Title not available (Why is that?)
- Comparing similar ordered trees in linear-time
Cited In (5)
This page was built for publication: Algorithms for finding a most similar subforest
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q538470)
