@InProceedings{funakoshi_et_al:LIPIcs.CPM.2018.12,
author = {Funakoshi, Mitsuru and Nakashima, Yuto and Inenaga, Shunsuke and Bannai, Hideo and Takeda, Masayuki},
title = {{Longest substring palindrome after edit}},
booktitle = {29th Annual Symposium on Combinatorial Pattern Matching (CPM 2018)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-074-3},
ISSN = {1868-8969},
year = {2018},
volume = {105},
editor = {Navarro, Gonzalo and Sankoff, David and Zhu, Binhai},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2018.12},
URN = {urn:nbn:de:0030-drops-86977},
doi = {10.4230/LIPIcs.CPM.2018.12},
annote = {Keywords: maximal palindromes, edit operations, periodicity, suffix trees}
}