Approximate matching of run-length compressed strings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2089, Issue , 2001, Pages 31-49

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b   Ukkonen, Esko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE MATCHING; APPROXIMATE SEARCHING; GREEDY ALGORITHMS; LEVENSHTEIN DISTANCE; LONGEST COMMON SUBSEQUENCES; RUN LENGTH; RUN-LENGTH ENCODING;

PATTERN MATCHING;

EID: 84956983768     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48194-x_3     Document Type: Conference Paper

References (20)

1. A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. DCC'92, pages 279-288, 1992.
2. A. Amir, G. Benson, and M. Farach. Let sleeping less lie: Pattern matching in Z-compressed less. J. Of Comp. And Sys. Sciences, 52(2):299-307, 1996.
3. A. Apostolico, G. Landau, and S. Skiena. Matching for run-length encoded strings. J. Of Complexity, 15:4-16, 1999. (Also at Sequences'97, Positano Italy, June 11-13, 1997).
4. O. Arbell, G. Landau, and J. Mitchell. Edit distance of run-length encoded strings. Submitted for publication, August 2000.
5. R. Baeza-Yates and G. Navarro. Fast two-dimensional approximate pattern matching. In Proc. LATIN'98, LNCS 1380, pages 341-351, 1998.
6. H. Bunke and J. Csirik. An algorithm for matching run-length coded strings. Computing, 50:297-314, 1993.
7. H. Bunke and J. Csirik. An improved algorithm for computing the edit distance of run-length coded strings. Information Processing Letters, 54(2):93-96, 1995.
8. M. Farach and M. Thorup. String matching in Lempel-Ziv compressed texts. Algorithmica, 20:388-404, 1998.
9. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying framework for compressed pattern matching. In Proc. SPIRE'99, pages 89-96. IEEE CS Press, 1999.
10. T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pattern matching in LZW compressed text. In Proc. DCC'98, pages 103-112, 1998.
11. J. Kärkkäinen, G. Navarro, and E. Ukkonen. Approximate string matching over Ziv-Lempel compressed text. In Proc. CPM'2000, LNCS 1848, pages 195-209, 2000.
12. V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 6: 707-710, 1966.
13. T. Matsumoto, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Bit-parallel approach to approximate string matching. In Proc. SPIRE'2000, IEEE CS Press, pages 221-228, 2000.
14. J. Mitchell. A geometric shortest path problem, with application to computing a longest common subsequence in run-length encoded strings. In Technical Report, Dept. of Applied Mathematics, SUNY Stony Brook, 1997.
15. G. Navarro, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Faster Approximate String Matching over Compressed Text. In Proc. 11th IEEE Data Compression Conference (DCC'01), 2001, To appear.
16. P. Sellers. The theory and computation of evolutionary distances: Pattern recognition. J. Of Algorithms, 1(4):359-373, 1980.
17. E. Ukkonen. Algorithms for approximate string matching. Information and Control 64(1-3):100-118, 1985.
18. E. Ukkonen. Finding approximate patterns in strings. J. Of Algorithms 6(1-3):132-137, 1985.
19. R. Wagner and M. Fisher. The string-to-string correction problem. J. Of the ACM 21(1):168-173, 1974.
20. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, 23:337-343, 1977.