Faster queries for longest substring palindrome after block edit

研究成果: 著書/レポートタイプへの貢献会議での発言

抄録

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.

元の言語英語
ホスト出版物のタイトル30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
編集者Nadia Pisanti, Solon P. Pissis
出版者Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771030
DOI
出版物ステータス出版済み - 6 1 2019
イベント30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, イタリア
継続期間: 6 18 20196 20 2019

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
128
ISSN(印刷物)1868-8969

会議

会議30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
イタリア
Pisa
期間6/18/196/20/19

Fingerprint

Bioinformatics

All Science Journal Classification (ASJC) codes

  • Software

これを引用

Funakoshi, M., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). Faster queries for longest substring palindrome after block edit. : N. Pisanti, & S. P. Pissis (版), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 [27] (Leibniz International Proceedings in Informatics, LIPIcs; 巻数 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. 版 / Nadia Pisanti; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 27 (Leibniz International Proceedings in Informatics, LIPIcs; 巻 128).

研究成果: 著書/レポートタイプへの貢献会議での発言

Funakoshi, M, Nakashima, Y, Inenaga, S, Bannai, H & Takeda, M 2019, Faster queries for longest substring palindrome after block edit. : N Pisanti & SP Pissis (版), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019., 27, Leibniz International Proceedings in Informatics, LIPIcs, 巻. 128, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, イタリア, 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. : Pisanti N, Pissis SP, 編集者, 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. 編集者 / 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 = "6",
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",

}

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

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

ER -