Computing left-right maximal generic words

Takaaki Nishimoto, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

1 被引用数 (Scopus)

抄録

The maximal generic words problem was proposed by Kucherov et al. (SPIRE 2012). Let D be a set of documents. In this problem, given a pattern P and a threshold δ ≤ |D|, we want to compute all right-maximal extensions of P which occur in at least δ distinct documents. They proposed an O(n)-space data structure which can solve this problem in O(|P| + rocc) time where n is the total length of documents in D and rocc is the number of right-maximal extensions of P. The data structure can be constructed in O(n) time. In this paper, we propose a more generalized problem. Given a pattern P and a threshold δ ≤ |D|, we want to compute all left-right-maximal extensions of P which occur in at least δ distinct documents. We propose an O(n log n)- space data structure which can solve this problem in O(|P| + occ log2 n + rocc log n) time where occ is the number of left-right-maximal extensions of P.

本文言語英語
ホスト出版物のタイトルProceedings of the Prague Stringology Conference 2015, PSC 2015
編集者Jan Zd'arek, Jan Holub
出版社Prague Stringology Club
ページ5-16
ページ数12
ISBN(電子版)9788001057872
出版ステータス出版済み - 1 1 2015
イベント19th Prague Stringology Conference, PSC 2015 - Prague, チェコ共和国
継続期間: 8 24 20158 26 2015

出版物シリーズ

名前Proceedings of the Prague Stringology Conference 2015, PSC 2015

その他

その他19th Prague Stringology Conference, PSC 2015
国/地域チェコ共和国
CityPrague
Period8/24/158/26/15

All Science Journal Classification (ASJC) codes

  • 数学 (全般)

フィンガープリント

「Computing left-right maximal generic words」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル