Computing longest common substring and all palindromes from compressed strings

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

Volumn 4910 LNCS, Issue , 2008, Pages 364-375

  Matsubara, Wataru ^a   Inenaga, Shunsuke ^b   Ishino, Akira ^a   Shinohara, Ayumi ^a   Nakamura, Tomoyuki ^a   Hashimoto, Kazuo ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; POLYNOMIALS; PROBLEM SOLVING;

COMPRESSED STRINGS; PALINDROMES; STRAIGHT LINE PROGRAMS (SLP);

COMPUTER PROGRAMMING;

EID: 38549098620     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77566-9_31     Document Type: Conference Paper

References (13)

1. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Info. Theory IT-23(3), 337-349 (1977)
2. Ziv, J., Lempel, A.: Compression of individual sequences via variable-length coding. IEEE Trans. Info. Theory 24(5), 530-536 (1978)
3. Kieffer, J., Yang, E., Nelson, G., Cosman, P.: Universal lossless compression via multilevel pattern matching. IEEE Trans. Info. Theory 46(4), 1227-1245 (2000)
4. Nevill-Manning, C.G., Witten, I.H., Maulsby, D.L.: Compression by induction of hierarchical grammars. In: DCC 1994, pp. 244-253. IEEE Press, Los Alamitos (1994)
5. Gasieniec, L., Karpinski, M., Plandowski, W., Rytter, W.: Efficient algorithms for Lempel-Ziv encoding. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 392-403. Springer, Heidelberg (1996)
6. Rytter, W.: Grammar compression, lz-encodings, and string algorithms with implicit input. In: Diaz, J., Karhumäki, J., Lepistö, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol. 3142, pp. 15-27. Springer, Heidelberg (2004)
7. Inenaga, S., Shinohara, A., Takeda, M.: An efficient pattern matching algorithm on a subclass of context free grammars. In: Calude, C.S., Calude, E., Dinneen, M.J. (eds.) DLT 2004. LNCS, vol. 3340, pp. 225-236. Springer, Heidelberg (2004)
8. Plandowski, W.: Testing equivalence of morphisms on context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460-470. Springer, Heidelberg (1994)
9. Karpinski, M., Rytter, W., Shinohara, A.: An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing 4, 172-186 (1997)
10. Miyazaki, M., Shinohara, A., Takeda, M.: An improved pattern matching algorithm for strings in terms of straight-line programs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 1-11. Springer, Heidelberg (1997)
11. Lifshits, Y.: Processing compressed texts: A tractability border. In: CPM 2007. LNCS, vol. 4580, pp. 228-240. Springer, Heidelberg (2007)
12. Lifshits, Y., Lohrey, M.: Querying and embedding compressed texts. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 681-692. Springer, Heidelberg (2006)
13. Apostolico, A., Breslauer, D., Galil, Z.: Parallel detection of all palindromes in a string. Theoretical Computer Science 141, 163-173 (1995)