Faster fully compressed pattern matching by recompression

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

Volumn 7391 LNCS, Issue PART 1, 2012, Pages 533-544

  Jez, Artur ^a  

^a UNIVERSITY OF WROC AW   (Poland)

Author keywords

Algorithms for compressed data; Compressed pattern matching; Lempel Ziv compression; Pattern matching; Straight line programms

Indexed keywords

COMPRESSED DATUM; COMPRESSED PATTERN MATCHING; LZ COMPRESSION; PATTERN MATCHING PROBLEMS; RECOMPRESSION; RUNNING TIME; STRAIGHT LINE PROGRAM; STRAIGHT-LINE PROGRAMMS;

ALGORITHMS; AUTOMATA THEORY; DATA COMPRESSION;

PATTERN MATCHING;

EID: 84883800747     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-31594-7_45     Document Type: Conference Paper

References (19)

1. Alstrup, S., Brodal, G.S., Rauhe, T.: Pattern matching in dynamic texts. In: Proc. 11th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 819-828 (2000)
2. Gawrychowski, P.: personal communication (2011)
3. Gawrychowski, P.: Optimal pattern matching in LZW compressed strings. In: Randall, D. (ed.) SODA, pp. 362-372. SIAM (2011)
4. Gawrychowski, P.: Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic. In: Demetrescu, C., Halldórsson, M.M. (eds.) ESA 2011. LNCS, vol. 6942, pp. 421-432. Springer, Heidelberg (2011)
5. Gawrychowski, P.: Simple and Efficient LZW-Compressed Multiple Pattern Matching. In: Kärkkäinen, J. (ed.) CPM 2012. LNCS, vol. 7354, pp. 232-242. Springer, Heidelberg (2012)
6. Gawrychowski, P.: Tying up the loose ends in fully LZW-compressed pattern matching. In: Dürr, C., Wilke, T. (eds.) STACS 2012. LIPIcs, vol. 14, pp. 624-635. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)
7. Ga̧sieniec, L., Karpiñski, M., Plandowski, W., Rytter, W.: Efficient Algorithms for Lempel-Ziv Encoding. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 392-403. Springer, Heidelberg (1996)
8. Ga̧sieniec, L., Karpiñski, M., Plandowski, W., Rytter, W.: Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach (Extended Abstract). In: Hirschberg, D.S., Meyers, G. (eds.) CPM 1996. LNCS, vol. 1075, pp. 39-49. Springer, Heidelberg (1996) (Pubitemid 126073707)
9. Hirao, M., Shinohara, A., Takeda, M., Arikawa, S.: Fully compressed pattern matching algorithm for balanced straight-line programs. In: SPIRE 2000, pp. 132-138 (2000)
10. Jeż, A.: Compressed membership for NFA (DFA) with compressed labels is in NP (P). In: Dürr, C., Wilke, T. (eds.) STACS 2012. LIPIcs, vol. 14, pp. 136-147. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)
11. Jeż, A.: Recompression: a simple and powerful technique for word equations. In: CoRR 1203.3705 (submitted, 2012)
12. Shibata, Y., Takeda, M., Shinohara, A., Arikawa, S.: Pattern Matching in Text Compressed by Using Antidictionaries. In: Crochemore, M., Paterson, M. (eds.) CPM 1999. LNCS, vol. 1645, pp. 37-49. Springer, Heidelberg (1999)
13. Lifshits, Y.: Processing Compressed Texts: A Tractability Border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228-240. Springer, Heidelberg (2007)
14. Lifshits, Y., Lohrey, M.: Querying and Embedding Compressed Texts. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 681-692. Springer, Heidelberg (2006)
15. Lohrey, M., Mathissen, C.: Compressed Membership in Automata with Compressed Labels. In: Kulikov, A., Vereshchagin, N. (eds.) CSR 2011. LNCS, vol. 6651, pp. 275-288. Springer, Heidelberg (2011)
16. Mehlhorn, K., Sundar, R., Uhrig, C.: Maintaining dynamic sequences under equality tests in polylogarithmic time. Algorithmica 17(2), 183-198 (1997)
17. Miyazaki, M., Shinohara, A., Takeda, M.: An Improved Pattern Matching Algorithm for Strings in Terms of Straight-Line Programs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 1-11. Springer, Heidelberg (1997) (Pubitemid 127097464)
18. Plandowski, W.: Testing Equivalence of Morphisms on Context-Free Languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460-470. Springer, Heidelberg (1994)
19. Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theor. Comput. Sci. 302(1-3), 211-222 (2003)