Matching for Run-Length Encoded Strings

This publication has 8 references indexed in Scilit:

• Geometric decision trees for optical character recognition (extended abstract)
  Published by Association for Computing Machinery (ACM) ,1997
• An improved algorithm for computing the edit distance of run-length coded strings
  Information Processing Letters, 1995
• On the Set LCS and Set-Set LCS Problems
  Journal of Algorithms, 1993
• The set-set LCS problem
  Algorithmica, 1989
• A faster algorithm computing string edit distances
  Journal of Computer and System Sciences, 1980
• An information-theoretic lower bound for the longest common subsequence problem
  Information Processing Letters, 1978
• Bounds on the Complexity of the Longest Common Subsequence Problem
  Journal of the ACM, 1976
• A linear space algorithm for computing maximal common subsequences
  Communications of the ACM, 1975