A general practical approach to pattern matching over ziv-lempel compressed text

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

Volumn 1645, Issue , 1999, Pages 14-36

  Navarro, Gonzalo ^a   Raffinot, Mathieu ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b Université de Marne la Vallée   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMPRESSION SCHEME; ESSENTIAL FEATURES; SEARCH ALGORITHMS; STRING MATCHING; TEXT DATABASE;

PATTERN MATCHING;

EID: 84957716302     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48452-3_2     Document Type: Conference Paper

References (32)

1. [1] A. Amir and G. Benson. Efficient two-dimensional compressed matching. In Proc. Second IEEE Data Compression Conference, pages 279-288, March 1992.
2. [2] A. Amir, G. Benson, and M. Farach. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences, 52(2):299-307, 1996.
3. [3] R. Baeza-Yates. Text retrieval: Theory and practice. In 12th IFIP World Com-puter Congress, volume I, pages 465-476. Elsevier Science, September 1992.
4. [4] R. Baeza-Yates and G. Gonnet. A new approach to text searching. Communica-tions of the ACM, 35(10):74-82, October 1992.
5. [5] T. Bell, J. Cleary, and I. Witten. Text Compression. Prentice Hall, New Jersey, 1990.
6. [6] T. Bell and D. Kulp. Longest-match string searching for Ziv-Lempel compression. Software-Practice and Experience, 23(7):757-771, July 1993.
7. [7] J. Bentley, D. Sleator, R. Tarjan, and V.Wei. A locally adaptive data compression scheme. Communications of the ACM, 29:320-330, 1986.
8. [8] R. S. Boyer and J. S. Moore. A fast string searching algorithm. Communications of the ACM, 20(10):762-772, 1977.
9. [9] A. Czumaj, Maxime Crochemore, L. Gasieniec, S. Jarominek, Thierry Lecroq, W. Plandowski, and W. Rytter. Speeding up two string-matching algorithms. Algorithmica, 12:247-267, 1994.
10. [10] P. Elias. Universal codeword sets and representations of the integers. IEEE Transactions on Information Theory, 21:194-203, 1975.
11. [11] M. Farach and M. Thorup. String matching in Lempel-Ziv compressed strings. In 27th ACM Annual Symposium on the Theory of Computing, pages 703-712, 1995.
12. [12] E. Fiala and D. Greene. Data compression with finite windows. Communications of the ACM, 32(4):490-505, 4 1989.
13. [13] L. Gasieniec, M. Karpinksi, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encodings. In Proc. SWAT'96, 1996.
14. [14] R. N. Horspool. Practical fast searching in strings. Software Practice and Expe-rience, 10:501-506, 1980.
15. [15] D. Huffman. A method for the construction of minimum-redundancy codes. Proc. of the I.R.E., 40(9):1090-1101, 1952.
16. [16] J. Kärkkäinen and E. Ukkonen. Sparse suffix trees. In COCOON'96, pages 219-230, 1996. LNCS v. 1090.
17. [17] M. Karpinski, A. Shinohara, and W. Rytter. Pattern matching problem for strings with short descriptions. Nordic Journal of Computing, 4(2):172-186, 1997.
18. [18] T. Kida, M. Takeda, A. Shinohara, and S. Arikawa. Shift-and approach to pattern matching in lzw compressed text. In Proc. CPM'99, 1999. To appear.
19. [19] D. E. Knuth, J. H. Morris, Jr, and V. R. Pratt. Fast pattern matching in strings. SIAM Journal on Computing, 6(1):323-350, 1977.
20. [20] U. Manber. A text compression scheme that allows fast searching directly in the compressed file. ACM Transactions on Information Systems, 15(2):124-136, 1997.
21. [21] V. Miller and M. Wegman. Variations on a theme by Ziv and Lempel. In Combi-natorial Algorithms on Words, volume 12 of NATO ASI Series F, pages 131-140. Springer-Verlag, 1985.
22. [22] A. Moffat. Word-based text compression. Software Practice and Experience, 19(2):185-198, 1989.
23. [23] E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Direct pattern matching on compressed text. In Proc. SPIRE'98, pages 90-95. IEEE CS Press, 1998.
24. [24] E. Moura, G. Navarro, N. Ziviani, and R. Baeza-Yates. Fast searching on compressed text allowing errors. In Proc. SIGIR'98, pages 298-306. York Press, 1998.
25. [25] G. Navarro and M. Raffinot. A bit-parallel approach to su_x automata: Fast extended string matching. In Proc. CPM'98, LNCS v. 1448, pages 14-33, 1998.
26. [26] G. Navarro and M. Raffinot. A general practical approach to pattern matching over Ziv-Lempel compressed text. Technical Report TR/DCC-98-12, Dept. of Computer Science, Univ. of Chile, 1998.
27. [27] D. Sunday. A very fast substring search algorithm. Communications of the ACM, 33(8):132-142, August 1990.
28. [28] T. A. Welch. A technique for high performance data compression. IEEE Computer Magazine, 17(6):8-19, June 1984.
29. [29] I. Witten, R. Neal, and J. Cleary. Arithmetic coding for data compression. Com-munications of the ACM, 30(6):520-541, 1987.
30. [30] M. Zipstein. Data compression with factor automata. Theor. Comput. Sci., 92(1):213-221, 1992.
31. [31] J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory, 23:337-343, 1977.
32. [32] J. Ziv and A. Lempel. Compression of individual sequences via variable length coding. IEEE Trans. Inf. Theory, 24:530-536, 1978.