Shortest unique palindromic substring queries in optimal time

Yuto Nakashima, Hiroe Inoue, Takuya Mieno, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

抜粋

palindrome is a string that reads the same forward and backward. A palindromic substring P of a string S is called a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if P occurs exactly once in S, this occurrence of P contains interval [s, t], and every palindromic substring of S which contains interval [s, t] and is shorter than P occurs at least twice in S. The SUPS problem is, given a string S, to preprocess S so that for any subsequent query interval [s, t] all the SUPSs for interval [s, t] can be answered quickly. We present an optimal solution to this problem. Namely, we show how to preprocess a given string S of length n in O(n) time and space so that all SUPSs for any subsequent query interval can be answered in O(α + 1) time, where α is the number of outputs.

元の言語英語
ホスト出版物のタイトルCombinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers
編集者William F. Smyth, Ljiljana Brankovic, Joe Ryan
出版者Springer Verlag
ページ397-408
ページ数12
ISBN(印刷物)9783319788241
DOI
出版物ステータス出版済み - 1 1 2018
イベント28th International Workshop on Combinational Algorithms, IWOCA 2017 - Newcastle, NSW, オーストラリア
継続期間: 7 17 20177 21 2017

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
10765 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他28th International Workshop on Combinational Algorithms, IWOCA 2017
オーストラリア
Newcastle, NSW
期間7/17/177/21/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Shortest unique palindromic substring queries in optimal time' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Nakashima, Y., Inoue, H., Mieno, T., Inenaga, S., Bannai, H., & Takeda, M. (2018). Shortest unique palindromic substring queries in optimal time. : W. F. Smyth, L. Brankovic, & J. Ryan (版), Combinatorial Algorithms - 28th International Workshop, IWOCA 2017, Revised Selected Papers (pp. 397-408). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 10765 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-78825-8_32