Improving time and space complexity for compressed pattern matching

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

Volumn 4288 LNCS, Issue , 2006, Pages 484-493

  Maruyama, Shirou ^a   Miyagawa, Hiromitsu ^a   Sakamoto, Hiroshi ^a  

^a KYUSHU INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION RATIOS; COMPRESSED PATTERN MATCHING; GRAMMAR-BASED COMPRESSION; TIME AND SPACE; UPPER BOUND;

APPROXIMATION ALGORITHMS; COMPUTATION THEORY; DATA COMPRESSION; PATTERN MATCHING;

COMPUTATIONAL EFFICIENCY;

EID: 77249149417     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11940128_49     Document Type: Conference Paper

References (29)

1. A. Amir, G. Benson, Efficient two-dimensional compressed matching, in: Proc. Data Compression Conference, p.279, 1992.
2. A. Amir, G. Benson, M. Farach, Let sleeping files lie: pattern matching in Zcompressed files, J. Comput. System Sci. 52:299-307, 1996.
3. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, M. Protasi, Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties, Springer, 1999.
4. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Rasala, A. Sahai, A. Shelat, Approximating the Smallest Grammar: Kolmogorov Complexity in Natural Models, in: Proc. 29th Ann. Sympo. on Theory of Computing, 792-801, 2002.
5. M. Farach, M. Thorup, String-matching in Lempel-Ziv compressed strings, in: 27th ACM STOC, pp. 703-713, 1995.
6. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Computer Science and Computational Biology, Cambridge University Press, 1997.
7. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, S. Arikawa, Collage System: a Unifying Framework for Compressed Pattern Matching, Theoret. Comput. Sci. 298:253-272.
8. T. Kida, M. Takeda, A. Shinohara, M. Miyazaki, S. Arikawa, Multiple pattern matching in LZW compressed text, J. Discrete Algorithms 1(1):133-158, 2000.
9. J. C. Kieffer, E.-H. Yang, Grammar-Based Codes: a New Class of Universal Lossless Source Codes, IEEE Trans, on Inform. Theory, 46(3):737-754, 2000.
10. J. C. Kieffer, E.-H. Yang, G. Nelson, P. Cosman, Universal Lossless Compression via Multilevel Pattern Matching, IEEE Trans. Inform. Theory, IT-46(4), 1227-1245, 2000.
11. D. Knuth, Seminumerical Algorithms, Addison-Wesley, 441-462, 1981.
12. N. J. Leusson, A. Moffat, Offline Dictionary-Based Compression, Proceedings of the IEEE, 88(11):1722-1732, 2000.
13. E. Lehman, Approximation Algorithms for Grammen-Based Compression, PhD thesis, MIT, 2002.
14. E. Lehman, A. Shelat, Approximation Algorithms for Grammar-Based Compression, in: Proc. 20th Ann. ACM-SIAM Sympo. on Discrete Algorithms, 205-212, 2002.
15. M. Lothaire, Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications, Addison-Wesley, 1983.
16. G. Navarro, M. Raffinot, A general practical approach to pattern matching over Ziv-Lempel compressed text, in: Proc. 10th Ann. Symp. on Combinatorial Pattern Matching, LNCS 1645, pp. 14-36, 1999.
17. C. Nevill-Manning, I. Witten, Compression and Explanation Using Hierarchical Grammars, Computer Journal, 40(2/3):103-116, 1997.
18. C. Nevill-Manning, I. Witten, Identifying hierarchical structure in sequences: a linear-time algorithm, J. Artificial Intelligence Research, 7:67-82, 1997.
19. W. Rytter, Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression, in: Proc. 13th Ann. Sympo. Combinatorial Pattern Matching, 20-31, 2002.
20. H. Sakamoto, A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression, Journal of Discrete Algorithms, 3:416-430, 2005.
21. H. Sakamoto, T. Kida, S. Shimozono, A Space-Saving Linear-Time Algorithm for Grammar-Based Compression, in: Proc. 11th International Symposium on String Processing and Information Retrieval, pp.218-229, 2004.
22. D. Salomon, Data compression: the complete reference, Springer, second edition, 1998.
23. J. Storer, T. Szymanski, Data compression via textual substitution, J. Assoc. Comput. Mach., 29(4):928-951, 1982.
24. J. A. Storer, T. G. Szymanski, The Macro Model for Data Compression, in: Proc. 10th Ann. Sympo. on Theory of Computing, pp. 30-39, 1978.
25. T. A. Welch, A Technique for High Performance Data Compression, IEEE Cornput., 17:8-19, 1984.
26. S. Wu, U. Manber, Agrep-a fast approximate pattern-matching tool, in: Usenix Winter 1992 Technical Conference, pp. 153-162, 1992.
27. E.-H. Yang, J. C. Kieffer, Efficient Universal Lossless Data Compression Algorithms Based on a Greedy Sequential Grammar Transform-Part One: without Context Models, IEEE Trans. on Inform. Theory, 46(3):755-777, 2000.
28. J. Ziv, A. Lempel, A Universal Algorithm for Sequential Data Compression, IEEE Trans, on Inform. Theory, IT-23(3):337-349, 1977.
29. J. Ziv, A. Lempel, Compression of Individual Sequences via Variable-Rate Coding, IEEE Trans, on Inform. Theory, 24(5):530-536, 1978.