Approximate matching of run-length compressed strings

Algorithmica (New York)

Volumn 35, Issue 4, 2003, Pages 347-369

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

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Compressed pattern matching; Levenshtein distance; Longest common subsequence; Run length encoding; Weighted edit distance

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; DYNAMIC PROGRAMMING; ENCODING (SYMBOLS); PROBLEM SOLVING; THEOREM PROVING;

APPROXIMATE MATCHING; LEVENSHTEIN DISTANCE; LONGEST COMMON SUBSEQUENCE; RUN-LENGTH COMPRESSED STRINGS; RUN-LENGTH ENCODING; WEIGHTED EDIT DISTANCE;

PATTERN MATCHING;

EID: 0942279288     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-1005-2     Document Type: Article

References (27)

1. A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. 2nd IEEE Data Compression Conference (DCC'92), pages 279-288, 1992.
2. A. Amir, G. Benson, and M. Farach. Let sleeping files lie: pattern matching in Z-compressed files. Journal of Computer and Systems Sciences, 52(2):299-307, 1996.
3. A. Amir, G. Landau, and D. Sokol. Inplace run-length 2d compressed search. In Proc. 11th Symposium on Discrete Algorithms (SODA'00), pages 817-818, 2000.
4. A. Apostolico, G. Landau, and S. Skiena. Matching for run-length encoded strings. Journal of Complexity, 15:4-16, 1999.
5. O. Arbell, G. Landau, and J. Mitchell. Edit distance of run-length encoded strings. Information Processing Letters, 83(6):307-314, 2002.
6. R. Baeza-Yates and G. Navarro. New models and algorithms for multidimensional approximate pattern matching. Journal of Discrete Algorithms, 1(1):21-49, 2000. Special Issue on Matching Patterns.
7. H. Bunke and J. Csirik. An algorithm for matching run-length coded strings. Computing, 50:297-314, 1993.
8. 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.
9. M. Crochemore, G. M. Landau, and M. Ziv-Ukelson. A sub-quadratic sequence alignment algorithm for unrestricted cost matrices. In Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA '02), pages 679-688, 2002 (the citation is to the revised report 2001-08 at Institut Gaspard-Monge, Université de Marne-la-Vallée).
10. M. Farach and M. Thorup. String matching in Lempel-Ziv compressed texts. Algorithmica, 20:388-404, 1998.
11. W. Feller. An Introduction to Probability Theory and Its Applications, Vol. II. Wiley, New York, 1966.
12. K. Fredriksson. Rotation invariant histogram filters for similarity and distance measures between digital images. In Proc. 7th Symposium on String Processing and Information Retrieval (SPIRE'00), pages 105-115. IEEE Computer Society Press, Los Alamitos, CA, 2000.
13. H. Gajewska and R. Tarjan. Deques with heap order. Information Processing Letters, 12(4):197-200, 1986.
14. J. Kärkkäinen, G. Navarro, and E. Ukkonen. Approximate string matching over Ziv-Lempel compressed text. In Proc. 11th Annual Symposium on Combinatorial Pattern Matching (CPM'00), pages 195-209. LNCS 1848, Springer-Verlag, Berlin, 2000. Extended version to appear in the Journal of Discrete Algorithms.
15. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa. A unifying framework for compressed pattern matching. In Proc. 6th Symposium on String Processing and Information Retrieval (SPIRE'99), pages 89-96. IEEE Computer Society Press, Los Alamitos, CA. 1999.
16. T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Multiple pattern matching in LZW compressed text. In Proc. 8th IEEE Data Compression Conference (DCC'98), 1998.
17. K. Krithivasan and R. Sitalakshmi. Efficient two-dimensional pattern matching in the presence of errors. Information Sciences, 43:169-184, 1987.
18. V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 6:707-710, 1966.
19. V. Mäkinen, G. Navarro, and E. Ukkonen. Approximate matching of run-length compressed strings. In Proc. 12th Annual Symposium on Combinatorial Pattern Matching (CPM'01), pages 31-49, LNCS 2089, Springer-Verlag, Berlin, 2001.
20. T. Matsumoto, T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Bit-parallel approach to approximate string matching. In Proc. 7th Symposium on String Processing and Information Retrieval (SPIRE'00), pages 221-228. IEEE Computer Society Press, Los Alamitos, CA, 2000.
21. J. Mitchell. A geometric shortest path problem, with application to computing a longest common subsequence in run-length encoded strings. Technical Report, Department of Applied Mathematics, SUNY Stony Brooks, NY, 1997.
22. 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), pages 459-468, 2001.
23. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms, 1(4):359-373, 1980.
24. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64(1-3):100-118, 1985.
25. E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6(1-3):132-137, 1985.
26. R. Wagner and M. Fisher. The string-to-string correction problem. Journal of the ACM, 21(1):168-173, 1974.
27. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23:337-343, 1977.