Identifying approximately common substructures in trees based on a restricted edit distance
- 2 December 1999
- journal article
- Published by Elsevier in Information Sciences
- Vol. 121 (3-4) , 367-386
- https://doi.org/10.1016/s0020-0255(99)00100-0
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Identification of common molecular subsequencesPublished by Elsevier ,2004
- Advances in software engineeringComputer, 1996
- Algorithms for the constrained editing distance between ordered labeled trees and related problemsPattern Recognition, 1995
- Approximate Tree Matching in the Presence of Variable Length Don′t CaresJournal of Algorithms, 1994
- A system for approximate tree matchingIEEE Transactions on Knowledge and Data Engineering, 1994
- Practical minimal perfect hash functions for large databasesCommunications of the ACM, 1992
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- THE TREE-TO-TREE EDITING PROBLEMInternational Journal of Pattern Recognition and Artificial Intelligence, 1988
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- The tree-to-tree editing problemInformation Processing Letters, 1977