On finding common subtrees
- 15 February 1993
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 108 (2) , 345-356
- https://doi.org/10.1016/0304-3975(93)90198-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Faster tree pattern matchingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the subtree isomorphism problem for ordered treesInformation Processing Letters, 1989
- Pattern Matching in TreesJournal of the ACM, 1982
- Variations on the Common Subexpression ProblemJournal of the ACM, 1980
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976
- Efficient string matchingCommunications of the ACM, 1975