Finding characteristic substrings from compressed texts

Proceedings of the Prague Stringology Conference 2009

Volumn , Issue , 2009, Pages 40-54

  Inenaga, Shunsuke ^a   Bannai, Hideo ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPRESSION SCHEME; STRAIGHT LINE PROGRAM; SUB-STRINGS; SUBSTRING; TEXT MINING; TIME POLYNOMIALS;

ALGORITHMS; DATA MINING;

PROBLEM SOLVING;

EID: 80054005774     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. A. Blumer, J. Blumer, D. Haussler, R. Mcconnell, and A. Ehrenfeucht: Complete inverted files for efficient text retrieval and analysis. J. ACM 34(3), 1987, pp. 578-595.
2. R. Feldman and J. Sanger: The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data, Cambridge University Press, 2007.
3. L. Gasieniec, M. Karpinski, W. Plandowski, and W. Rytter: Efficient algorithms for Lempel-Ziv encoding, in Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT'96), vol. 1097 of Lecture Notes in Computer Science, Springer-Verlag, 1996, pp. 392-403.
4. M. Karpinski, W. Rytter, and A. Shinohara: An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing, 4 1997, pp. 172-186.
5. J. Kieffer, E. Yang, G. Nelson, and P. Cosman: Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory, 46(4) 2000, pp. 1227-1245.
6. Y. Lifshits: Solving classical string problems an compressed texts, in Combinatorial and Al- gorithmic Foundations of Pattern and Association Discovery, no. 06201 in Dagstuhl Seminar Proceedings, 2006.
7. Y. Lifshits: Processing compressed texts: A tractability border, in Proc. 18th Annual Sympo- sium on Combinatorial Pattern Matching (CPM'07), vol. 4580 of Lecture Notes in Computer Science, Springer-Verlag, 2007, pp. 228-240.
8. 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, pp. 900-913.
9. M. Miyazaki, A. Shinohara, and M. Takeda: An improved pattern matching algorithm for strings in terms of straight-line programs, in Proc. 8th Annual Symposium on Combinatorial Pattern Matching (CPM'97), vol. 1264 of Lecture Notes in Computer Science, Springer-Verlag, 1997, pp.1-11
10. K. Narisawa, H. Bannai, K. Hatano, and M. Takeda: Unsupervised spam detection based on string alienness measures, in Proc. 10th International Conference on Discovery Science (DS'07), vol. 4755 of Lecture Notes in Artificial Intelligence, 2007, pp. 161-172.
11. C. G. Nevill-Manning, I. H. Witten, and D. L. Maulsby: Compression by induction of hierarchical grammars, in Proc. Data Compression Conference'94 (DCC'94), IEEE Computer Society, 1994, pp. 244-253.
12. W. Rytter: Grammar compression, LZ-encodings, and string algorithms with implicit input, in Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP'04), vol. 3142 of Lecture Notes in Computer Science, Springer-Verlag, 2004, pp. 15-27.
13. M. Takeda, T. Matsumoto, T. Fukuda, and I. Nanri: Discovering characteristic expressions in literary works. Theoretical Computer Science, 292(2) 2003, pp. 525-546.
14. J. Ziv and A. Lempel: A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3) 1977, pp. 337-349.
15. J. Ziv and A. Lempel: Compression of individual sequences via variable-length coding. IEEE Transactions on Information Theory, 24(5) 1978, pp. 530-536.