An algorithm for matching run-length coded strings
- 1 December 1993
- journal article
- Published by Springer Nature in Computing
- Vol. 50 (4) , 297-314
- https://doi.org/10.1007/bf02243873
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- Algorithms for approximate string matchingInformation and Control, 1985
- Approximate String MatchingACM Computing Surveys, 1980
- A faster algorithm computing string edit distancesJournal of Computer and System Sciences, 1980
- A fast algorithm for computing longest common subsequencesCommunications of the ACM, 1977
- The String-to-String Correction ProblemJournal of the ACM, 1974