Constrained string editing
- 31 December 1986
- journal article
- Published by Elsevier in Information Sciences
- Vol. 40 (3), 267-284
- https://doi.org/10.1016/0020-0255(86)90061-7
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- The Noisy Substring Matching ProblemIEEE Transactions on Software Engineering, 1983
- Similarity measures for sets of strings †International 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
- The Complexity of Some Problems on Subsequences and SupersequencesJournal of the ACM, 1978
- Algorithms for the Longest Common Subsequence ProblemJournal of the ACM, 1977
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- Bounds on the Complexity of the Longest Common Subsequence ProblemJournal of the ACM, 1976
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975