Simple solutions for approximate tree matching problems
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 193-201
- https://doi.org/10.1007/3-540-53982-4_11
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Faster tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- On the subtree isomorphism problem for ordered treesInformation Processing Letters, 1989
- Efficient tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Introducing efficient parallelism into approximate string matching and a new serial algorithmPublished by Association for Computing Machinery (ACM) ,1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Pattern Matching in TreesJournal of the ACM, 1982