Approximate pattern matching in LZ77-compressed texts

Journal of Discrete Algorithms

Volumn 32, Issue , 2015, Pages 64-68

  Gagie, Travis ^a   Gawrychowski, Paweł ^b   Puglisi, Simon J ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Compressed approximate pattern matching; LZ77

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL METHODS;

APPROXIMATE PATTERN MATCHING; EDIT DISTANCE; LZ77; PREPROCESS;

PATTERN MATCHING;

EID: 84925307761     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2014.10.003     Document Type: Conference Paper

References (26)

1. A. Amir, and G. Benson Efficient two-dimensional compressed matching Proceedings of the Data Compression Conference (DCC) 1992 279 288
2. P. Bille, R. Fagerberg, and I.L. Gørtz Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts ACM Trans. Algorithms 6 1 2009
3. P. Bille, G.M. Landau, R. Raman, K. Sadakane, S.R. Satti, and O. Weimann Random access to grammar-compressed strings Proceedings of the 22nd Symposium on Discrete Algorithms (SODA) 2011 373 389
4. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and A. Shelat The smallest grammar problem IEEE Trans. Inf. Theory 51 7 2005 2554 2576
5. F. Claude, and G. Navarro Improved grammar-based compressed indexes Proceedings of the 19th Symposium on String Processing and Information Retrieval (SPIRE) 2012 180 192
6. R. Cole, and R. Hariharan Approximate string matching: a simpler faster algorithm SIAM J. Comput. 31 6 2002 1761 1782
7. T. Gagie, P. Gawrychowski, J. Kärkkäinen, Y. Nekrich, and S.J. Puglisi A faster grammar-compressed self-index Proceedings of the 6th Conference on Language and Automata Theory and Applications (LATA) 2012 240 251
8. T. Gagie, P. Gawrychowski, and S.J. Puglisi Faster approximate pattern matching in compressed repetitive texts Proceedings of the 22nd International Symposium on Algorithms and Computation (ISAAC) 2011 653 662
9. L. Gąsieniec, R.M. Kolpakov, I. Potapov, and P. Sant Real-time traversal in grammar-based compressed files http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.59.6639
10. L. Gąsieniec, R.M. Kolpakov, I. Potapov, and P. Sant Real-time traversal in grammar-based compressed files Proceedings of the Data Compression Conference (DCC) 2005 458
11. P. Gawrychowski Pattern matching in Lempel-Ziv compressed strings: fast, simple and deterministic Proceedings of the 19th European Symposium on Algorithms (ESA) 2011 421 432
12. P. Gawrychowski, and D. Straszak Beating O (nm) in approximate LZW-compressed pattern matching Proceedings of the 24th International Symposium on Algorithms and Computation (ISAAC) 2013 78 88
13. J. Kärkkäinen, G. Navarro, and E. Ukkonen Approximate string matching on Ziv-Lempel compressed text J. Discrete Algorithms 1 3-4 2003 313 338
14. S. Kuruppu, S.J. Puglisi, and J. Zobel Relative Lempel-Ziv compression of genomes for large-scale storage and retrieval Proceedings of the 17th Symposium on String Processing and Information Retrieval (SPIRE) 2010 201 206
15. G.M. Landau, and U. Vishkin Fast parallel and serial approximate string matching J. Algorithms 10 2 1989 157 169
16. N.J. Larsson, and A. Moffat Offline dictionary-based compression Proceedings of the Data Compression Conference (DCC) 1999 296 305
17. M. Lohrey Algorithmics on SLP-compressed strings: a survey Groups Complex. Cryptol. 4 2 2012 241 299
18. M. Miyazaki, A. Shinohara, and M. Takeda An improved pattern matching algorithm for strings in terms of straight-line programs Proceedings of the 8th Symposium on Combinatorial Pattern Matching (CPM) 1997 1 11
19. G. Navarro A guided tour to approximate string matching ACM Comput. Surv. 33 1 2001 31 88
20. W. Rytter Application of Lempel-Ziv factorization to the approximation of grammar-based compression Theor. Comput. Sci. 302 1-3 2003 211 222
21. A. Tiskin Semi-local string comparison: algorithmic techniques and applications Technical report arXiv:0707.3619v19 2013
22. E. Verbin, and W. Yu Data structure lower bounds on random access to grammar-compressed strings Proceedings of the 24th Symposium on Combinatorial Pattern Matching (CPM) 2013 247 258
23. S. Wandelt, and U. Leser String searching in referentially compressed genomes Proceedings of the Conference on Knowledge Discovery and Information Retrieval (KDIR) 2012 95 102
24. T. Welch A technique for high-performance data compression Computer 17 6 1984 8 19
25. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Trans. Inf. Theory 23 3 1977 337 343
26. J. Ziv, and A. Lempel Compression of individual sequences via variable-rate coding IEEE Trans. Inf. Theory 24 5 1978 530 536