Faster queries for longest substring palindrome after block edit

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

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

3 被引用数 (Scopus)

抄録

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
Countryイタリア
CityPisa
Period6/18/196/20/19

All Science Journal Classification (ASJC) codes

  • Software

フィンガープリント 「Faster queries for longest substring palindrome after block edit」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル