Finding gapped palindromes online

Yuta Fujishige, Michitaro Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

6 被引用数 (Scopus)

抄録

A string s is said to be a gapped palindrome iff s = xyxRfor some strings x, y such that |x| ≥ 1, |y| ≥ 2, and xR denotes the reverse image of x.In this paper we consider two kinds of gapped palindromes, and present efficient online algorithms to compute these gapped palindromes occurring in a string.First, we show an online algorithm to find all maximal g-gapped palindromes with fixed gap length g ≥ 2 in a string of length n in O(n log σ) time and O(n) space, where σ is the alphabet size.Second, we show an online algorithm to find all maximal lengthconstrained gapped palindromes with arm length at least A ≥ 1 and gap length in range [gmin, gmax] in O (formula presented) time and O(n) space.We also show that if A is a constant, then there exists a string of length n which contains Ω(n(gmax− gmin)) maximal LCGPs, which implies we cannot hope for a significant speed-up in the worst case.

本文言語英語
ホスト出版物のタイトルCombinatorial Algorithms - 27th International Workshop, IWOCA 2016, Proceedings
編集者Veli Mäkinen, Simon J. Puglisi, Leena Salmela
出版社Springer Verlag
ページ191-202
ページ数12
ISBN(印刷版)9783319445427
DOI
出版ステータス出版済み - 2016
イベント27th International Workshop on Combinatorial Algorithms, IWOCA 2016 - Helsinki, フィンランド
継続期間: 8 17 20168 19 2016

出版物シリーズ

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

その他

その他27th International Workshop on Combinatorial Algorithms, IWOCA 2016
Countryフィンランド
CityHelsinki
Period8/17/168/19/16

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Finding gapped palindromes online」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル