pdf-format: |
|
@InProceedings{funakoshi_et_al:LIPIcs:2018:8697, author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda}, title = {{Longest substring palindrome after edit}}, booktitle = {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 = {Gonzalo Navarro and David Sankoff and Binhai Zhu}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2018/8697}, URN = {urn:nbn:de:0030-drops-86977}, doi = {10.4230/LIPIcs.CPM.2018.12}, annote = {Keywords: maximal palindromes, edit operations, periodicity, suffix trees} }
Keywords: | maximal palindromes, edit operations, periodicity, suffix trees | |
Seminar: | Annual Symposium on Combinatorial Pattern Matching (CPM 2018) | |
Issue date: | 2018 | |
Date of publication: | 18.05.2018 |