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]
@inproceedings{MatsubaraIISNH08,
title = {Computing Longest Common Substring and All Palindromes from Compressed Strings},
author = {Wataru Matsubara and Shunsuke Inenaga and Akira Ishino and Ayumi Shinohara and Tomoyuki Nakamura and Kazuo Hashimoto},
year = {2008},
doi = {10.1007/978-3-540-77566-9_31},
url = {http://dx.doi.org/10.1007/978-3-540-77566-9_31},
researchr = {https://researchr.org/publication/MatsubaraIISNH08},
cites = {0},
citedby = {0},
pages = {364-375},
booktitle = {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},
editor = {Viliam Geffert and Juhani Karhumäki and Alberto Bertoni and Bart Preneel and Pavol Návrat and Mária Bieliková},
volume = {4910},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-540-77565-2},
}