Algorithms for the constrained editing distance between ordered labeled trees and related problems
- 31 March 1995
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 28 (3) , 463-474
- https://doi.org/10.1016/0031-3203(94)00109-y
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Some MAX SNP-hard results concerning unordered labeled treesInformation Processing Letters, 1994
- Approximate Tree Matching in the Presence of Variable Length Don′t CaresJournal of Algorithms, 1994
- On the editing distance between unordered labeled treesInformation Processing Letters, 1992
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- The Tree-to-Tree Correction ProblemJournal of the ACM, 1979
- The tree-to-tree editing problemInformation Processing Letters, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- The String-to-String Correction ProblemJournal of the ACM, 1974