A faster algorithm for computing maximal α-gapped repeats in a string

Yuka Tanimura, Yuta Fujishige, Tomohiro I, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

14 被引用数 (Scopus)

抄録

A string x = uvu with both u, v being non-empty is called a gapped repeat with period p = |uv|, and is denoted by pair (x, p). If p ≤ α(|x| − p) with α > 1, then (x, p) is called an α-gapped repeat. An occurrence [i, i+|x|−1] of an α-gapped repeat (x, p) in a string w is called a maximal α-gapped repeat of w, if it cannot be extended either to the left or to the right in w with the same period p. Kolpakov et al. (CPM 2014) showed that, given a string of length n over a constant alphabet, all the occurrences of maximal α-gapped repeats in the string can be computed in O(α2n+occ) time, where occ is the number of occurrences. In this paper, we propose a faster O(αn + occ)-time algorithm to solve this problem, improving the result of Kolpakov et al. by a factor of α.

本文言語英語
ホスト出版物のタイトルString Processing and Information Retrieval - 22nd International Symposium, SPIRE 2015, Proceedings
編集者Simon J. Puglisi, Costas S. Iliopoulos, Emine Yilmaz
出版社Springer Verlag
ページ124-136
ページ数13
ISBN(印刷版)9783319238258
DOI
出版ステータス出版済み - 2015
イベント22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015 - London, 英国
継続期間: 9 1 20159 4 2015

出版物シリーズ

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

その他

その他22nd International Symposium on String Processing and Information Retrieval, SPIRE 2015
Country英国
CityLondon
Period9/1/159/4/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「A faster algorithm for computing maximal α-gapped repeats in a string」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル