Fast q-gram mining on SLP compressed strings

Journal of Discrete Algorithms

Volumn 18, Issue , 2013, Pages 89-99

  Goto, Keisuke ^a   Bannai, Hideo ^a   Inenaga, Shunsuke ^a   Takeda, Masayuki ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

Compressed string mining; q grams; Straight line programs

Indexed keywords

COMPUTATIONAL EXPERIMENT; Q-GRAMS; SIMPLE AND EFFICIENT ALGORITHMS; STRAIGHT LINE PROGRAM; TIME AND SPACE ALGORITHMS;

ALGORITHMS;

DATA MINING;

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

References (30)

1. A. Amir, G. Benson, Efficient two-dimensional compressed matching, in: Proc. DCC92, 1992, pp. 279-288.
2. H. Arimura, A. Wataki, R. Fujino, and S. Arikawa A fast algorithm for discovering optimal string patterns in large text databases Proc. 9th International Conference on Algorithmic Learning Theory 1998 Springer London, UK 247 261
3. A. Brazma, I. Jonassen, I. Eidhammer, and D. Gilbert Approaches to the automatic discovery of patterns in biosequences Journal of Computational Biology 5 2 1998 279 305
4. S. Chan, B. Kao, C.L. Yip, and M. Tang Mining emerging substrings DASFAA03: Proceedings of the Eighth International Conference on Database Systems for Advanced Applications 2003 IEEE Computer Society Washington, DC, USA 119
5. M. Charikar, E. Lehman, D. Liu, R. Panigrahy, M. Prabhakaran, A. Sahai, and Abhi Shelat The smallest grammar problem IEEE Transactions on Information Theory 51 7 2005 2554 2576
6. F. Claude, and G. Navarro Self-indexed grammar-based compression Fundamenta Informaticae 111 3 2011 313 337
7. L. Gasieniec, M. Karpinski, W. Plandowski, W. Rytter, Efficient algorithms for Lempel-Ziv encoding, in: Proc. SWAT, 1996, pp. 392-403.
8. K. Goto, H. Bannai, S. Inenaga, M. Takeda, Fast q-gram mining on SLP compressed strings, in: Proc. SPIRE01, 2011, pp. 278-289.
9. D. Gusfield Algorithms on Strings, Trees, and Sequences 1997 Cambridge University Press
10. D. Hermelin, G.M. Landau, S. Landau, O. Weimann, A unified algorithm for accelerating edit-distance computation via text-compression, in: Proc. STACS09, 2009, pp. 529-540.
11. L.C.K. Hui Color set size problem with application to string matching Combinatorial Pattern Matching LNCS vol. 644 1992 Springer 230 243
12. S. Inenaga, and H. Bannai Finding characteristic substrings from compressed texts International Journal of Foundations of Computer Science 23 2 2012 261 280
13. J. Kärkkäinen, and P. Sanders Simple linear work suffix array construction Proc. ICALP03 LNCS vol. 2719 2003 Springer 943 955
14. M. Karpinski, W. Rytter, and A. Shinohara An efficient pattern-matching algorithm for strings with short descriptions Nordic Journal of Computing 4 1997 172 186
15. T. Kasai, G. Lee, H. Arimura, S. Arikawa, and K. Park Linear-time longest-common-prefix computation in suffix arrays and its applications Proc. CPM01 LNCS vol. 2089 2001 181 192
16. T. Kida, Y. Shibata, M. Takeda, A. Shinohara, and S. Arikawa Collage system: A unifying framework for compressed pattern matching Theoretical Computer Science 298 1 2003 253 272
17. N.J. Larsson, and A. Moffat Offline dictionary-based compression Proc. DCC99 1999 IEEE Computer Society 296 305
18. C. Leslie, E. Eskin, W.S. Noble, The spectrum kernel: A string kernel for SVM protein classification, in: Pacific Symposium on Biocomputing, vol. 7, 2002, pp. 566-575.
19. Y. Lifshits Processing compressed texts: A tractability border Proc. CPM 2007 LNCS vol. 4580 2007 228 240
20. U. Manber, and G. Myers Suffix arrays: A new method for on-line string searches SIAM Journal on Computing 22 5 1993 935 948
21. S. Maruyama, M. Takeda, M. Nakahara, H. Sakamoto, An online algorithm for lightweight grammar-based compression, in: Proc. CCP, 2011, pp. 19-28.
22. W. Matsubara, S. Inenaga, A. Ishino, A. Shinohara, T. Nakamura, and K. Hashimoto Efficient algorithms to compute compressed longest common substrings and compressed palindromes Theoretical Computer Science 410 8-10 2009 900 913
23. G. Navarro, and V. Mäkinen Compressed full-text indexes ACM Computing Surveys 39 1 2007 2
24. C.G. Nevill-Manning, I.H. Witten, D.L. Maulsby, Compression by induction of hierarchical grammars, in: Proc. DCC94, 1994, pp. 244-253.
25. W. Rytter Application of Lempel-Ziv factorization to the approximation of grammar-based compression Theoretical Computer Science 302 1-3 2003 211 222
26. Y. Shibata, T. Kida, S. Fukamachi, M. Takeda, A. Shinohara, T. Shinohara, and S. Arikawa Speeding up pattern matching by text compression Proc. 4th Italian Conference on Algorithms and Complexity LNCS vol. 1767 2000 Springer 306 315
27. C.H. Teo, S.V.N. Vishwanathan, Fast and space efficient string kernels using suffix arrays, in: Proc. ICML, 2006, pp. 929-936.
28. S.V.N. Vishwanathan, A.J. Smola, Fast kernels for string and tree matching, in: Proc. NIPS, 2002, pp. 569-576.
29. J. Ziv, and A. Lempel A universal algorithm for sequential data compression IEEE Transactions on Information Theory 23 3 1977 337 349
30. J. Ziv, and A. Lempel Compression of individual sequences via variable-length coding IEEE Transactions on Information Theory 24 5 1978 530 536