Edit distance of run-length encoded strings

Information Processing Letters

Volumn 83, Issue 6, 2002, Pages 307-314

  Arbell, Ora ^a   Landau, Gad M ^a,b   Mitchell, Joseph S B ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

^c Stony Brook University   (United States)

Author keywords

Algorithms; Dynamic programming; Edit distance; Run length compression; String matching

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTER SIMULATION; DYNAMIC PROGRAMMING; FACSIMILE; IMAGE COMPRESSION; MATRIX ALGEBRA; OPTICAL CHARACTER RECOGNITION;

EDIT DISTANCES; RUN-LENGTH ENCODED STRINGS;

ENCODING (SYMBOLS);

EID: 0037200863     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0190(02)00215-6     Document Type: Article

References (9)

1. Matching for run length encoded strings
2. An improved algorithm for computing the edit distance of run length coded strings
3. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices
4. Binary codes capable of correcting, deletions, insertions and reversals
5. Approximate matching of run-length compressed strings
6. Algorithms for approximate string matching
7. On approximate string matching