Matching for run-length encoded strings

[1] AHO AV, 1976, J ACM, V23, P1, DOI 10.1145/321921.321922

[2] APOSTOLICO A, 1996, HDB FORMAL LANGUAGES, V2, P361

[3] AN IMPROVED ALGORITHM FOR COMPUTING THE EDIT DISTANCE OF RUN-LENGTH CODED STRINGS [J]. INFORMATION PROCESSING LETTERS, 1995, 54 (02) : 93 - 96

[4] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343

[5] THE SET-SET LCS PROBLEM [J]. ALGORITHMICA, 1989, 4 (04) : 503 - 510

[6] INFORMATION-THEORETIC LOWER BOUND FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (01) : 40 - 41

[7] A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 18 - 31

[8] Mitchell J.S.B., 1997, GEOMETRIC SHORTEST P

[9] SAZAKLIS G, 1997, P 13 ACM S COMP GEOM

[10] ON THE SET LCS AND SET SET LCS PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1993, 14 (03) : 466 - 477

[1] AHO AV, 1976, J ACM, V23, P1, DOI 10.1145/321921.321922

[2] APOSTOLICO A, 1996, HDB FORMAL LANGUAGES, V2, P361

[3] AN IMPROVED ALGORITHM FOR COMPUTING THE EDIT DISTANCE OF RUN-LENGTH CODED STRINGS [J]. INFORMATION PROCESSING LETTERS, 1995, 54 (02) : 93 - 96

[4] LINEAR SPACE ALGORITHM FOR COMPUTING MAXIMAL COMMON SUBSEQUENCES [J]. COMMUNICATIONS OF THE ACM, 1975, 18 (06) : 341 - 343

[5] THE SET-SET LCS PROBLEM [J]. ALGORITHMICA, 1989, 4 (04) : 503 - 510

[6] INFORMATION-THEORETIC LOWER BOUND FOR LONGEST COMMON SUBSEQUENCE PROBLEM [J]. INFORMATION PROCESSING LETTERS, 1978, 7 (01) : 40 - 41

[7] A FASTER ALGORITHM COMPUTING STRING EDIT DISTANCES [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1980, 20 (01) : 18 - 31

[8] Mitchell J.S.B., 1997, GEOMETRIC SHORTEST P

[9] SAZAKLIS G, 1997, P 13 ACM S COMP GEOM

[10] ON THE SET LCS AND SET SET LCS PROBLEMS [J]. JOURNAL OF ALGORITHMS, 1993, 14 (03) : 466 - 477