Approximate string matching over Ziv-Lempel compressed text

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

Volumn 1848, Issue , 2000, Pages 195-209

  Kärkkäinen, Juha ^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;

ALPHABET SIZE; APPROXIMATE PATTERN MATCHING; APPROXIMATE STRING MATCHING; EXISTENCE PROBLEMS;

PATTERN MATCHING;

EID: 84937429802     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45123-4_18     Document Type: Conference Paper

References (24)

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 files lie: Pattern matching in Z-compressed files. J. of Comp. and Sys. Sciences, 52(2):299-307, 1996. Earlier version in Proc. SODA'94.
3. A. Apostolico and Z. Galil. Pattern Matching Algorithms. Oxford University Press, Oxford, UK, 1997.
4. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
5. T. Bell, J. Cleary, and I. Witten. Text Compression. Prentice Hall, 1990.
6. W. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In Proc. CPM'92, LNCS 644, pages 172-181, 1992.
7. W. Chang and T. Marr. Approximate string matching and local similarity. In Proc. CPM'94, LNCS 807, pages 259-273, 1994.
8. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994.
9. M. Farach and M. Thorup. String matching in Lempel-Ziv compressed strings. Algorithmica, 20:388-404, 1998. Previous version in STOC'95.
10. Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM J. on Computing, 19(6):989-999, 1990.
11. 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.
12. T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, and S. Arikawa. Shift-And approach to pattern matching in LZW compressed text. In Proc. CPM'99, LNCS 1645, pages 1-13, 1999.
13. G. Myers. A fast bit-vector algorithm for approximate pattern matching based on dynamic progamming. In Proc. CPM'98, LNCS 1448, pages 1-13, 1998.
14. G. Navarro. A guided tour to approximate string matching. Technical Report TR/DCC-99-5, Dept. of Computer Science, Univ. of Chile, 1999. To appear in ACM Computing Surveys. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/survasm.ps.gz.
15. G. Navarro and R. Baeza-Yates. Very fast and simple approximate string matching. Information Processing Letters, 72:65-70, 1999.
16. G. Navarro and M. Rafinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. In Proc. CPM'99, LNCS 1645, pages 14-36, 1999.
17. G. Navarro and J. Tarhio. Boyer-Moore string matching over Ziv-Lempel compressed text. In Proc. CPM'2000, LNCS 1848, 2000, pp. 166-180. In this same volume.
18. S. Needleman and C. Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. J. of Molecular Biology, 48:444-453, 1970.
19. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. J. of Algorithms, 1:359-373, 1980.
20. E. Ukkonen. Finding approximate patterns in strings. J. of Algorithms, 6:132-137, 1985.
21. T. A. Welch. A technique for high performance data compression. IEEE Computer Magazine, 17(6):8-19, June 1984.
22. S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83-91, 1992.
23. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, 23:337-343, 1977.
24. J. Ziv and A. Lempel. Compression of individual sequences via variable length coding. IEEE Trans. Inf. Theory, 24:530-536, 1978.