TY - GEN
T1 - Faster queries for longest substring palindrome after block edit
AU - Funakoshi, Mitsuru
AU - Nakashima, Yuto
AU - Inenaga, Shunsuke
AU - Bannai, Hideo
AU - Takeda, Masayuki
N1 - Funding Information:
Funding Yuto Nakashima: Supported by JSPS KAKENHI Grant Number JP18K18002. Shunsuke Inenaga: Supported by JSPS KAKENHI Grant Number JP17H01697. Hideo Bannai: Supported by JSPS KAKENHI Grant Number JP16H02783. Masayuki Takeda: Supported by JSPS KAKENHI Grant Number JP18H04098.
PY - 2019/6/1
Y1 - 2019/6/1
N2 - 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(ℓ + log log n) time, after a substring in T is replaced by a string of arbitrary length ℓ. This outperforms the query algorithm proposed in our previous work [CPM 2018] that uses O(ℓ + log n) time for each query.
AB - 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(ℓ + log log n) time, after a substring in T is replaced by a string of arbitrary length ℓ. This outperforms the query algorithm proposed in our previous work [CPM 2018] that uses O(ℓ + log n) time for each query.
UR - http://www.scopus.com/inward/record.url?scp=85068094447&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85068094447&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.CPM.2019.27
DO - 10.4230/LIPIcs.CPM.2019.27
M3 - Conference contribution
AN - SCOPUS:85068094447
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
A2 - Pisanti, Nadia
A2 - Pissis, Solon P.
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
Y2 - 17 June 2019 through 19 June 2019
ER -