Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.27
URN: urn:nbn:de:0030-drops-104989
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10498/
Funakoshi, Mitsuru ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki
Faster Queries for Longest Substring Palindrome After Block Edit
| pdf-format: |
|
Abstract
Palindromes are important objects in strings which have been extensively studied from combinatorial, algorithmic, and bioinformatics points of views. Manacher [J. ACM 1975] proposed a seminal algorithm that computes the longest substring palindromes (LSPals) of a given string in O(n) time, where n is the length of the string. In this paper, we consider the problem of finding the LSPal after the string is edited. We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LSPals in O(l + log log n) time, after a substring in T is replaced by a string of arbitrary length l. This outperforms the query algorithm proposed in our previous work [CPM 2018] that uses O(l + log n) time for each query.
BibTeX - Entry
@InProceedings{funakoshi_et_al:LIPIcs:2019:10498,
author = {Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
title = {{Faster Queries for Longest Substring Palindrome After Block Edit}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {27:1--27:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Nadia Pisanti and Solon P. Pissis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10498},
URN = {urn:nbn:de:0030-drops-104989},
doi = {10.4230/LIPIcs.CPM.2019.27},
annote = {Keywords: palindromes, string algorithm, periodicity}
}
| Keywords: | palindromes, string algorithm, periodicity | |
| Seminar: | 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 06.06.2019 |
