Computing longest palindromic substring after single-character or block-wise edits

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

研究成果: ジャーナルへの寄稿学術誌査読

4 被引用数 (Scopus)

抄録

Palindromes are important objects in strings which have been extensively studied from combinatorial, algorithmic, and bioinformatics points of views. It is known that the length of the longest palindromic substrings (LPSs) of a given string T of length n can be computed in O(n) time by Manacher's algorithm [12]. In this paper, we consider the problem of finding the LPS after the string is edited. We present an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LPSs in O(log⁡(min⁡{σ,log⁡n})) time after a single character substitution, insertion, or deletion, where σ denotes the number of distinct characters appearing in T. We also propose an algorithm that uses O(n) time and space for preprocessing, and answers the length of the LPSs in O(ℓ+log⁡log⁡n) time, after an existing substring in T is replaced by a string of arbitrary length ℓ.

本文言語英語
ページ(範囲)116-133
ページ数18
ジャーナルTheoretical Computer Science
859
DOI
出版ステータス出版済み - 3月 6 2021

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Computing longest palindromic substring after single-character or block-wise edits」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル