1. Matching for run length encoded strings;Apostolico;J. Complexity,1999
2. An improved algorithm for computing the edit distance of run length coded strings;Bunke;Inform. Process. Lett.,1995
3. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices;Crochemore,2002
4. Binary codes capable of correcting, deletions, insertions and reversals;Levenshtein;Soviet Phys. Dokl.,1966
5. Approximate matching of run-length compressed strings;Mäkinen,2001