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]

Authors

Wataru Matsubara

This author has not been identified. Look up 'Wataru Matsubara' in Google

Shunsuke Inenaga

This author has not been identified. Look up 'Shunsuke Inenaga' in Google

Akira Ishino

This author has not been identified. Look up 'Akira Ishino' in Google

Ayumi Shinohara

This author has not been identified. Look up 'Ayumi Shinohara' in Google

Tomoyuki Nakamura

This author has not been identified. Look up 'Tomoyuki Nakamura' in Google

Kazuo Hashimoto

This author has not been identified. Look up 'Kazuo Hashimoto' in Google