String alignment with substitution, insertion, deletion, squashing, and expansion operations
- 31 March 1995
- journal article
- Published by Elsevier in Information Sciences
- Vol. 83 (1-2) , 89-107
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Spelling correction using probabilistic methodsPattern Recognition Letters, 1984
- The Noisy Substring Matching ProblemIEEE Transactions on Software Engineering, 1983
- Similarity measures for sets of stringsInternational Journal of Computer Mathematics, 1983
- A common basis for similarity measures involving two strings†International Journal of Computer Mathematics, 1983
- An effective algorithm for string correction using generalized edit distances—I. Description of the algorithm and its optimalityInformation Sciences, 1981
- Approximate String MatchingACM Computing Surveys, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976