Faster queries for longest substring palindrome after block edit

Mitsuru Funakoshi; Yuto Nakashima; Shunsuke Inenaga; Hideo Bannai; Masayuki Takeda

doi:10.4230/LIPIcs.CPM.2019.27

Faster queries for longest substring palindrome after block edit

Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

Mathematical Informatics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

3 Citations (Scopus)

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(ℓ + 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.

Original language	English
Title of host publication	30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
Editors	Nadia Pisanti, Solon P. Pissis
Publisher	Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)	9783959771030
DOIs	https://doi.org/10.4230/LIPIcs.CPM.2019.27
Publication status	Published - Jun 1 2019
Event	30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, Italy Duration: Jun 18 2019 → Jun 20 2019

Publication series

Name	Leibniz International Proceedings in Informatics, LIPIcs
Volume	128
ISSN (Print)	1868-8969

Conference

Conference	30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
Country	Italy
City	Pisa
Period	6/18/19 → 6/20/19

All Science Journal Classification (ASJC) codes

Software

Access to Document

10.4230/LIPIcs.CPM.2019.27

Fingerprint Dive into the research topics of 'Faster queries for longest substring palindrome after block edit'. Together they form a unique fingerprint.

Cite this

Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). Faster queries for longest substring palindrome after block edit. In N. Pisanti, & S. P. Pissis (Eds.), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 [27] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 128). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2019.27

Faster queries for longest substring palindrome after block edit. / Funakoshi, Mitsuru; Nakashima, Yuto ; Inenaga, Shunsuke; Bannai, Hideo; Takeda, Masayuki.

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. ed. / Nadia Pisanti; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 27 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 128).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Funakoshi, M, Nakashima, Y , Inenaga, S, Bannai, H & Takeda, M 2019, Faster queries for longest substring palindrome after block edit. in N Pisanti & SP Pissis (eds), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019., 27, Leibniz International Proceedings in Informatics, LIPIcs, vol. 128, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, 6/18/19. https://doi.org/10.4230/LIPIcs.CPM.2019.27

Funakoshi M, Nakashima Y , Inenaga S, Bannai H, Takeda M. Faster queries for longest substring palindrome after block edit. In Pisanti N, Pissis SP, editors, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 27. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2019.27

Funakoshi, Mitsuru ; Nakashima, Yuto ; Inenaga, Shunsuke ; Bannai, Hideo ; Takeda, Masayuki. / Faster queries for longest substring palindrome after block edit. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. editor / Nadia Pisanti ; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).

@inproceedings{5fad857f96ed4f7eb05c610619dceea3,

title = "Faster queries for longest substring palindrome after block edit",

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(ℓ + 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.",

author = "Mitsuru Funakoshi and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda",

year = "2019",

month = jun,

day = "1",

doi = "10.4230/LIPIcs.CPM.2019.27",

language = "English",

series = "Leibniz International Proceedings in Informatics, LIPIcs",

publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

editor = "Nadia Pisanti and Pissis, {Solon P.}",

booktitle = "30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019",

note = "30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 ; Conference date: 18-06-2019 Through 20-06-2019",

}

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

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 - 18 June 2019 through 20 June 2019

ER -