Shortest unique palindromic substring queries on run-length encoded strings

Kiichi Watanabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

2 引用 (Scopus)

抜粋

For a string S, a palindromic substring S[i.j] is said to be a shortest unique palindromic substring (SUPS) for an interval [s, t] in S, if S[i.j] occurs exactly once in S, the interval [i, j] contains [s, t], and every palindromic substring containing [s, t] which is shorter than S[i.j] occurs at least twice in S. In this paper, we study the problem of answering SUPS queries on run-length encoded strings. We show how to preprocess a given run-length encoded string RLES of size m in O(m) space and O(mlog σRLES + m√log m/log logm) time so that all SUPSs for any subsequent query interval can be answered in O(√log m/log logm+ α) time, where α is the number of outputs, and σRLES is the number of distinct runs of RLES.

元の言語英語
ホスト出版物のタイトルCombinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings
編集者Charles J. Colbourn, Roberto Grossi, Nadia Pisanti
出版者Springer Verlag
ページ430-441
ページ数12
ISBN(印刷物)9783030250041
DOI
出版物ステータス出版済み - 1 1 2019
イベント30th International Workshop on Combinatorial Algorithms, IWOCA 2019 - Pisa, イタリア
継続期間: 7 23 20197 25 2019

出版物シリーズ

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

会議

会議30th International Workshop on Combinatorial Algorithms, IWOCA 2019
イタリア
Pisa
期間7/23/197/25/19

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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

  • これを引用

    Watanabe, K., Nakashima, Y., Inenaga, S., Bannai, H., & Takeda, M. (2019). Shortest unique palindromic substring queries on run-length encoded strings. : C. J. Colbourn, R. Grossi, & N. Pisanti (版), Combinatorial Algorithms - 30th International Workshop, IWOCA 2019, Proceedings (pp. 430-441). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 11638 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-25005-8_35