An efficient algorithm for some tree matching problems
From MaRDI portal
Publication:1182118
DOI10.1016/0020-0190(91)90062-MzbMath0735.68041MaRDI QIDQ1182118
Publication date: 27 June 1992
Published in: Information Processing Letters (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Data structures and algorithms for approximate string matching
- On the subtree isomorphism problem for ordered trees
- Lexicographic generation of ordered trees
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Fast Algorithms for Finding Nearest Common Ancestors
- Pattern Matching in Trees
This page was built for publication: An efficient algorithm for some tree matching problems