Time/Space Efficient Compressed Pattern Matching

Fundamenta Informaticae

Volumn 56, Issue 1-2, 2003, Pages 137-154

  Ga̧sieniec, Leszek ^a   Potapov, Igor ^a  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

Compressed pattern matching; Directed acyclic graph traversal; Small extra space; Straight line program

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING; DATA COMPRESSION; TEXT PROCESSING; WORLD WIDE WEB;

STRAIGHT-LINE PROGRAM;

PATTERN MATCHING;

EID: 17544389252     PISSN: 01692968     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (23)

1. A. Amir, G. Benson, and M. Farach, Let sleeping files lie: Pattern matching in Z-compressed files, Proc. of 5th Annual ACM-SIAM Symposium on Discrete Algorithms, January 1994.
2. A. Amir, G.M. Landau, and D. Sokol, Inplace Run-Length 2d Compressed Search, In Proceedings of 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'2000, San Francisco, pp. 817-818.
3. D. Breslauer. Saving comparisons in the Crochemore-Perrin string matching algorithm. Theoretical Computer Science, 158(1-2):177-192, May 1996.
4. M. Crochemore and D. Perrin, Two-way string-matching; Journal of the ACM, 38(3):651-675, July 1991.
5. M. Crochemore, W. Rytter, Text algorithms, Oxford University Press, 1994.
6. M. Farach and M. Thorup, String Matching in Lempel-Ziv Compressed Strings, Proc. 27th ACM Symposium on Theory of Computing, pp. 703-713, 1994.
7. P. Ferragina and G. Manzini, Opportunistic Data Structures with Applications. Proc. 41st IEEE Symposium on Foundations of Computer Science, (FOCS'00). Redondo Beach (CA), 2000, pp. 390-398.
8. Z. Galil and J. Seiferas. Time-space-optimal string matching. Journal of Computer and System Sciences, 26(3):280-294, June 1983.
9. L. Ga̧sieniec, W. Plandowski, and W. Rytter. The zooming method: a recursive approach to time-space efficient string-matching. Theoretical Computer Science, 147(1-2):19-30, August 1995
10. L. Ga̧sieniec, W. Plandowski, and W. Rytter. Constant-space string matching with smaller number of comparisons: Sequential sampling. In Proc. of 6th Combinatorial Pattern Matching, LNCS 937, pages 78-89, Espoo, Finland, July 5-7, 1995.
11. L. Ga̧sieniec and I. Potapov. Time/Space Efficient Compressed Pattern Matching. In Proc. of 13th International Symposium on Fundamentals of Computation Theory, LNCS, Volume 2138, pp 138-152, Springer-Verlag, 2001.
12. L. Ga̧sieniec and W. Rytter. Almost optimal fully compressed pattern matching. In Proceedings of Data Compression Conference (DCC'99), Snowbird, March 1999.
13. J.C. Kieffer, A Survey of Advances in Hierarchical Data Compression, Technical Report, Department of Electrical & Computer Engineering, University of Minnesota, 2000.
14. D. Knuth, J. Morris, and V. Pratt, Fast pattern matching in strings, SIAM J. on Computing, 6 (1977), pp. 323-360.
15. N.J. Larsson, Structures of String Matching and Data Compression. Ph.D. Dissertation, Dept. of Computer Science, Lund University, Sweden, 1999.
16. A. Lempel and J. Ziv On the complexity of finite sequences, IEEE Transactions on Information Theory, pp. 22:75-81, 1976.
17. 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.
18. M. Miyazaki, A. Shinohara, and M. Takeda, An Improved Pattern Matching for Strings in Terms of Straight-Line Programs, Journal of Discrete Algorithms, Vol. 1(1), pp. 187-204, 2000.
19. L. Mouchard, Presentation at London Algorithms Workshop, LAW'2000, King's College London.
20. C. Nevill-Manning and I. Witten, Identifying Hierarchical Structure in Sequences: A Linear-Time Algorithm, Journal of Artificial Intelligence, Vol. 7, pp. 67-82, 1997.
21. H. Schorr and W.M. Waite, An Efficient Machine-Independent Procedure for Garbage Collection in Various List Structure, In CACM 8(10), August 1967.
22. Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, Speeding up pattern matching by text compression, In Proceedings of 4th Italian Conference on Algorithms and Complexity, CIAC 2000, March 1-3, 2000 Rome, Italy.
23. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory, pp. IT-23(3):337-343, 1977.