Beating O(nm) in approximate LZW-compressed pattern matching

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

Volumn 8283 LNCS, Issue , 2013, Pages 78-88

  Gawrychowski, Paweł ^a   Straszak, Damian ^b  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b UNIVERSITY OF WROC AW   (Poland)

Author keywords

approximate pattern matching; edit distance; Lempel Ziv

Indexed keywords

APPROXIMATE MATCHING; APPROXIMATE PATTERN MATCHING; BLACK BOXES; EDIT DISTANCE; LEMPEL-ZIV; LINEAR SPACES; RUNNING TIME; TIME COMPLEXITY;

ALGORITHMS; HAMMING DISTANCE;

PATTERN MATCHING;

EID: 84893361113     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-45030-3_8     Document Type: Conference Paper

References (13)

1. Amir, A., Benson, G., Farach, M.: Let sleeping files lie: Pattern matching in Z-compressed files. J. Comput. Syst. Sci. 52(2), 299-307 (1996)
2. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257-275 (2004)
3. Bille, P., Fagerberg, R., Gørtz, I.L.: Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts. ACM Transactions on Algorithms 6(1) (2009)
4. Cole, R., Hariharan, R.: Approximate string matching: A simpler faster algorithm. SIAM J. Comput. 31(6), 1761-1782 (2002)
5. Crochemore, M., Rytter, W.: Jewels of stringology. World Scientific (2002)
6. Gawrychowski, P.: Optimal pattern matching in LZW compressed strings. In: Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2011, pp. 362-372. SIAM (2011)
7. Gawrychowski, P.: Simple and efficient LZW-compressed multiple pattern matching. In: Kärkkäinen, J., Stoye, J. (eds.) CPM 2012. LNCS, vol. 7354, pp. 232-242. Springer, Heidelberg (2012)
8. Gawrychowski, P.: Tying up the loose ends in fully LZW-compressed pattern matching. In: Dürr, C., Wilke, T. (eds.) STACS. LIPIcs, vol. 14, pp. 624-635. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2012)
9. Kärkkäinen, J., Navarro, G., Ukkonen, E.: Approximate string matching on Ziv-Lempel compressed text. J. Discrete Algorithms 1(3-4), 313-338 (2003)
10. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theor. Comput. Sci. 43, 239-249 (1986)
11. Landau, G.M., Vishkin, U.: Fast parallel and serial approximate string matching. J. Algorithms 10(2), 157-169 (1989)
12. Welch, T.A.: A technique for high-performance data compression. Computer 17(6), 8-19 (1984)
13. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530-536 (1978)