@inproceedings{conf/sofsem/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},
booktitle = {SOFSEM},
crossref = {conf/sofsem/2008},
editor = {Viliam Geffert and Juhani Karhumäki and Alberto Bertoni and Bart Preneel and Pavol Návrat and Mária Bieliková},
pages = {364-375},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
url = {http://dblp.uni-trier.de/db/conf/sofsem/sofsem2008.html#MatsubaraIISNH08},
volume = {4910},
year = {2008},
description = {dblp},
ee = {http://dx.doi.org/10.1007/978-3-540-77566-9_31}, isbn = {978-3-540-77565-2}, date = {2008-01-09},
keywords = {dblp }
}
::