Efficient algorithms to compute compressed longest common substrings and compressed palindromes

Theoretical Computer Science

Volumn 410, Issue 8-10, 2009, Pages 900-913

  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

Longest common substring; Palindromes; Straight line program; String processing algorithms; Text compression

Indexed keywords

ALGORITHMS; POLYNOMIAL APPROXIMATION;

LONGEST COMMON SUBSTRING; PALINDROMES; STRAIGHT LINE PROGRAM; STRING PROCESSING ALGORITHMS; TEXT COMPRESSION;

COMBINATORIAL MATHEMATICS;

EID: 59049103692     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2008.12.016     Document Type: Article

References (14)

1. Apostolico A., Breslauer D., and Galil Z. Parallel detection of all palindromes in a string. Theoretical Computer Science 141 (1995) 163-173
2. Gasieniec L., Karpinski M., Plandowski W., and Rytter W. An efficient algorithms for Lempel-Ziv encoding. Proc. 5th Scandinavian Workshop on Algorithm Theory. SWAT'96. Lecture Notes in Computer Science vol. 1097 (1996), Springer-Verlag 392-403
3. Inenaga S., Shinohara A., and Takeda M. An efficient pattern matching algorithm on a subclass of context free grammars. Proc. Eighth International Conference on Developments in Language Theory. DLT'04. Lecture Notes in Computer Science vol. 3340 (2004), Springer-Verlag 225-236
4. Karpinski M., Rytter W., and Shinohara A. An efficient pattern-matching algorithm for strings with short descriptions. Nordic Journal of Computing 4 (1997) 172-186
5. Kieffer J., Yang E., Nelson G., and Cosman P. Universal lossless compression via multilevel pattern matching. IEEE Transactions on Information Theory 46 4 (2000) 1227-1245
6. Lifshits Y. Processing compressed texts: A tractability border. Proc. 18th Annual Symposium on Combinatorial Pattern Matching. CPM'07. Lecture Notes in Computer Science vol. 4580 (2007), Springer-Verlag 228-240
7. Lifshits Y., and Lohrey M. Querying and embedding compressed texts. Proc. 31st International Symposium on Mathematical Foundations of Computer Science. MFCS'06. Lecture Notes in Computer Science vol. 4162 (2006), Springer-Verlag 681-692
8. Matsubara W., Inenaga S., Ishino A., Shinohara A., Nakamura T., and Hashimoto K. Computing longest common substring and all palindromes from compressed strings. Proc. 34th International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM'08. Lecture Notes in Computer Science vol. 4910 (2008), Springer-Verlag 364-375
9. Miyazaki M., Shinohara A., and Takeda M. An improved pattern matching algorithm for strings in terms of straight-line programs. Proc. 8th Annual Symposium on Combinatorial Pattern Matching. CPM'97. Lecture Notes in Computer Science vol. 1264 (1997), Springer-Verlag 1-11
10. Nevill-Manning C.G., Witten I.H., and Maulsby D.L. Compression by induction of hierarchical grammars. Data Compression Conference '94 (1994), IEEE Computer Society 244-253
11. Plandowski W. Testing equivalence of morphisms on context-free languages. Proc. Second Annual European Symposium on Algorithms. ESA'94. Lecture Notes in Computer Science vol. 855 (1994), Springer-Verlag 460-470
12. Rytter W. Grammar compression, LZ-encodings, and string algorithms with implicit input. Proc. 31st International Colloquium on Automata, Languages and Programming. ICALP'04. Lecture Notes in Computer Science vol. 3142 (2004), Springer-Verlag 15-27
13. Ziv J., and Lempel A. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, IT 23 3 (1977) 337-349
14. Ziv J., and Lempel A. Compression of individual sequences via variable-length coding. IEEE Transactions on Information Theory 24 5 (1978) 530-536