LZgrep: A Boyer-Moore string matching tool for Ziv-Lempel compressed text

Software - Practice and Experience

Volumn 35, Issue 12, 2005, Pages 1107-1130

  Navarro, Gonzalo ^a   Tarhio, Jorma ^b  

^a UNIVERSITY OF CHILE   (Chile)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Compressed pattern matching; Direct search on compressed text; Text searching; Ziv Lempel format

Indexed keywords

COMPRESSED PATTERN MATCHING; TEXT SEARCHING; UNIX GZIP; ZIV-LEMPEL FORMAT;

ALGORITHMS; COMPUTER AIDED SOFTWARE ENGINEERING; ONLINE SEARCHING; PATTERN RECOGNITION; TEXT PROCESSING;

DATA COMPRESSION;

EID: 26444518168     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/spe.663     Document Type: Article

References (47)

1. Crochemore M, Rytter W. Text Algorithms. Oxford University Press: Oxford, 1994.
2. Navarro G, Raffinot M. Flexible Pattern Matching in Strings. Cambridge University Press: Cambridge, 2002.
3. Boyer RS, Moore JS. A fast string searching algorithm. Communications of the ACM 1977: 20(10):762-772.
4. Bell T, Cleary J, Witten I. Text Compression. Prentice-Hall, 1990.
5. Ziv J, Lempel A, A universal algorithm for sequential data compression. IEEE Transactions on Information Theory 1977; 23:337-343.
6. Ziv J, Lempel A. Compression of individual sequences via variable length coding. IEEE Transactions on Information Theory 1978; 24:530-536.
7. Welch TA. A technique for high performance data compression. IEEE Computer Magazine 1984; 17(6):8-19.
8. Burrows M, Wheeler D. A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation. 1994.
9. Amir A, Benson G. Efficient two-dimensional compressed matching. Proceedings of the 2nd IEEE Data Compression Conference (DCC'92). IEEE Press. 1992; 279-288.
10. Huffman D. A method for the construction of minimum-redundancy codes. Proceedings of the I.R.E. 1952; 40(91:1090-1101.
11. Moffat A. Word-based text compression. Software Practice and Experience 1989; 19(2): 185-198.
12. Moura E, Navarro G. Ziviani N, Baeza-Yates R. Fast and flexible word searching on compressed text. ACM Transactions on Information Systems 2000: 18(2): 113-139.
13. Witten I, Moffat A, Bell T. Managing Gigabytes (2nd edn). Morgan Kaufmann: New York. 1999.
14. Navarro G. Moura E, Neubert M, Ziviani N. Baeza-Yates R. Adding compression to block addressing inverted indexes. Information Retrieval 2000; 3(1):49-77.
15. Manber U, Wu S. Glimpse: A tool to search through entire rile systems. Technical Report 93-34, Department of Computer Science, University of Arizona. 1993.
16. Manber U. A text compression scheme that allows fast searching directly in the compressed file. ACM Transactions on Information Systems 1997; 15(2):124-136.
17. Shibata Y, Matsumoto T, Takeda M. Shinohara A, Arikawa S. A Boyer-Moore type algorithm for compressed pattern matching. Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM'00) (Lecture Notes in Computer Science, vol. 1848). Springer, 2000; 181-194.
18. Miyazaki M, Shinohara A, Takeda M. Speeding up the pattern matching machine for compressed texts. Transactions of Information Processing Society of Japan 1998: 39(9):2638-2648.
19. Klein S, Shapira D. Pattern matching in Huffman encoded texts. Proceedings of the 11th IEEE Data Compression Conference (DCC'01). IEEE Press, 2001; 449-458.
20. Navarro G, Raffinot M. Practical and flexible pattern matching over Ziv-Lempel compressed text. Journal of Discrete Algorithms 2004; 2(3):347-371.
21. Klein S, Shapira D. A new compression method for compressed matching. Proceedings of the 10th IEEE Data Compression Conference (DCC'00). IEEE Press. 2000; 400-409.
22. Kida T, Shibata Y, Takeda M, Shinohara A, Arikawa S. A unifying framework for compressed pattern matching. Proceedings of the 6th International Symposium on String Processing and Information Retrieval (SPIRE'99). IEEE Computer Society Press: Los Alamitos, CA, 1999; 89-96.
23. Amir A, Benson G, Farach M. Let sleeping files lie: Pattern matching in Z-compressed files. Journal of Computer and System Sciences 1996; 52(2):299-307.
24. Kida T, Takeda M, Shinohara A, Miyazaki M, Arikawa S. Multiple pattern matching in LZW compressed text. Proceedings of the 8th IEEE Data Compression Conference (DCC'98). IEEE Press, 1998.
25. Kida T, Takeda M, Shinohara A, Miyazaki M, Arikawa S. Shift-And approach to pattern matching in LZW compressed text. Proceedings of the 10th Annual Symposium on Combinatorial Pattern Matching (CPM'99) (Lecture Notes in Computer Science, vol. 1645). Springer. 1999; 1-13.
26. Gasieniec L, Karpinksi M, Plandowski W, Rytter W. Efficient algorithms for Lempel-Ziv encodings. Proceedings of the 5th Scandinavian Workshop in Algorithmic Theory (SWAT'96). Springer, 1996.
27. Kärkkäinen J, Navarro G, Ukkonen E. Approximate string matching over Ziv-Lempel compressed text. Journal of Discrete Algorithms 2003; 1(3/4):313-338.
28. Navarro G, Regular expression searching on compressed text. Journal of Discrete Algorithms 2003: 1(5/6):423-443.
29. Farach M, Thorup M. String matching in Lempel-Ziv compressed strings. Algorithmica 1998; 20:388-404.
30. Navarro G, Tarhio J. Boyer-Moore string matching over Ziv-Lempel compressed text. Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching (CPM'00) (Lecture Notes in Computer Science, vol. 1848). Springer, 2000; 166-180.
31. Miller V, Wegman M. Variations on a theme by Ziv and Lempel. Combinatorial Algorithms on Words (NATO ASI Series F. vol. 12). Springer: Berlin, 1985; 131-140.
32. Fiala E, Greene D. Data compression with finite windows. Communications of the ACM 1989: 32(4):490-505.
33. Horspool RN. Practical fast searching in strings. Software Practice and Experience 1980; 10:501-506.
34. Sunday D. A very fast substring search algorithm. Communications of the ACM 1990; 33(8): 132-142.
35. Wu S, Manber U. A fast algorithm for multi-pattern searching. Report TR-94-17, Department of Computer Science, University of Arizona, 1994.
36. Commentz-Walter B. A string matching algorithm fast on the average. Proceedings of the 6th International Colloquium on Automata, Languages and Programming (ICALP'79) (Lecture Notes in Computer Science, vol. 71). Springer, 1979; 118-132.
37. Crochemore M, Czumaj A, Ga̧sieniec L, Jarominek S, Lecroq T, Plandowski W, Rytter W. Speeding up two string matching algorithms. Algorithmica 1994; 12(4/5):247-267.
38. Navarro G, Raffinot M. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmic (JEA) 2000; 5(4).
39. Allauzen C, Crochemore M, Raffinot M. Efficient experimental string matching by weak factor recognition. Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching (CPM'01) (Lecture Notes in Computer Science, vol. 2089). Springer, 2001; 51-72.
40. Harman D. Overview of the Third Text REtrieval Conference. Proceedings of the Third Text REtrieval Conference (TREC-3)NIST Special Publication 500-207, 1995; 1-19.
41. Knuth D, Morris J, Pratt V. Fast pattern matching in strings. SIAM Journal on Computing 1977; 6(1):323-350.
42. Wu S, Manber U. Agrep - a fast approximate pattern-matching tool. Proceedings of the USENIX Technical Conference, Berkeley, CA. USENIX Association, 1992; 153-162.
43. Peltola H, Tarhio J. String matching in the DNA alphabet. Software Practice and Experience 1997; 27(7):851-861.
44. Aho A, Corasick M. Efficient string matching: An aid to bibliographic search. Communications of the ACM 1975; 18(6):333-340.
45. Navarro G, Kida T, Takeda M, Shinohara A, Arikawa S. Faster approximate string matching over compressed text. Proceedings of the 11th IEEE Data Compression Conference (DCC'01). IEEE Press. 2001; 459-468.
46. Watson B. A new regular grammar pattern matching algorithm. Proceedings of the 4th European Symposium on Algorithms (ESA'96) (Lecture Notes in Computer Science, vol. 1136). Springer. 1996; 364-377.
47. Kytöjoki J, Salmela L, Tarhio J. Tuning string matching for huge pattern sets. Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching (CPM'03) (Lecture Notes in Computer Science, vol. 2676). IEEE Press, 2003; 211-224.