An improved algorithm for computing the edit distance of run-length coded strings
- 28 April 1995
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 54 (2) , 93-96
- https://doi.org/10.1016/0020-0190(95)00005-w
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- An algorithm for matching run-length coded stringsComputing, 1993
- On the Set LCS and Set-Set LCS ProblemsJournal of Algorithms, 1993
- Approximate Boyer–Moore String MatchingSIAM Journal on Computing, 1993
- Fast text searchingCommunications of the ACM, 1992
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Algorithms for approximate string matchingInformation and Control, 1985
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974