Finding characteristic substrings from compressed texts

International Journal of Foundations of Computer Science

Volumn 23, Issue 2, 2012, Pages 261-280

  Inenaga, Shunsuke ^a   Bannai, Hideo ^a  

^a KYUSHU UNIVERSITY   (Japan)

Author keywords

polynomial time algorithms; straight line programs; string data mining; Text compression

Indexed keywords

EID: 84863101615     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054112400126     Document Type: Article

References (17)

1. A. Blumer, J. Blumer, D. Haussler, R. McConnell, and A. Ehrenfeucht. Complete inverted files for efficient text retrieval and analysis. Journal of the ACM, 34(3):578-595, 1987. (Pubitemid 17653424)
2. R. Feldman and J. Sanger. The Text Mining Handbook: Advanced Approaches in Analyzing Unstructured Data. Cambridge University Press, 2007.
3. L. Ga̧sieniec, M. Karpinski, W. Plandowski, and W. Rytter. Efficient algorithms for Lempel-Ziv encoding. In Proc. 5th Scandinavian Workshop on Algorithm Theory (SWAT1996), volume 1097 of Lecture Notes in Computer Science, pages 392-403. Springer-Verlag, 1996. (Pubitemid 126091945)
4. M. Karpinski, W. Rytter, and A. Shinohara. An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing, 4:172-186, 1997.
5. J. Kieffer, E. Yang, G. Nelson, and P. Cosman. Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory, 46(4):1227-1245, 2000.
6. Y. Lifshits. Solving classical string problems an compressed texts. In Combinatorial and Algorithmic Foundations of Pattern and Association Discovery, number 06201 in Dagstuhl Seminar Proceedings, 2006.
7. Y. Lifshits. Processing compressed texts: A tractability border. In Proc. 18th Annual Symposium on Combinatorial Pattern Matching (CPM2007), volume 4580 of Lecture Notes in Computer Science, pages 228-240. Springer-Verlag, 2007.
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):900-913, 2009.
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 (CPM1997), volume 1264 of Lecture Notes in Computer Science, pages 1-11. Springer-Verlag, 1997. (Pubitemid 127097464)
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 (DS2007), volume 4755 of Lecture Notes in Artificial Intelligence, pages 161-172. Springer-Verlag, 2007.
11. C. G. Nevill-Manning, I. H. Witten, and D. L. Maulsby. Compression by induction of hierarchical grammars. In Data Compression Conference 1994, pages 244-253. IEEE Computer Society, 1994.
12. W. Rytter. Grammar compression, LZ-encodings, and string algorithms with implicit input. In Proc. 31st International Colloquium on Automata, Languages and Programming (ICALP2004), volume 3142 of Lecture Notes in Computer Science, pages 15-27. Springer-Verlag, 2004.
13. J. Storer and T. Szymanski. Data compression via textual substitution. Journal of the ACM, 29(4):928-951, 1982.
14. M. Takeda, T. Matsumoto, T. Fukuda, and I. Nanri. Discovering characteristic expressions in literary works. Theoretical Computer Science, 292(2):525-546, 2003.
15. T. A. Welch. A technique for high performance data compression. IEEE Computer, 17:8-19, 1984.
16. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT-23(3):337-349, 1977.
17. J. Ziv and A. Lempel. Compression of individual sequences via variable-length coding. IEEE Transactions on Information Theory, 24(5):530-536, 1978. (Pubitemid 8631609)