Computing Longest Common Substring and All Palindromes from Compressed Strings

Wataru Matsubara, Shunsuke Inenaga, Akira Ishino, Ayumi Shinohara, Tomoyuki Nakamura, Kazuo Hashimoto. Computing Longest Common Substring and All Palindromes from Compressed Strings. In Viliam Geffert, Juhani Karhumäki, Alberto Bertoni, Bart Preneel, Pavol Návrat, Mária Bieliková, editors, SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Proceedings. Volume 4910 of Lecture Notes in Computer Science, pages 364-375, Springer, 2008. [doi]

Possibly Related Publications

The following publications are possibly variants of this publication: