An opportunistic text indexing structure based on run length encoding

Yuya Tamakoshi, Keisuke Goto, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

2 被引用数 (Scopus)

抄録

We present a new text indexing structure based on the run length encoding (RLE) of a text string T which, given the RLE of a query pattern P, reports all the occ occurrences of P in T in O(m+occ+log n) time, where n and m are the sizes of the RLEs of T and P, respectively. The data structure requires n(2 logN+log n+log σ)+O(n) bits of space, where N is the length of the uncompressed text string T and σ is the alphabet size. Moreover, using n(3 logN + logn + logσ) + 2σ log N/σ + O(n log log n) bits of total space, our data structure can be enhanced to answer the beginning position of the lexicographically ith smallest suffix of T for a given rank i in O(log2 n) time. All these data structures can be constructed in O(n log n) time using O(n logN) bits of extra space.

本文言語英語
ホスト出版物のタイトルAlgorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings
編集者Peter Widmayer, Vangelis Th. Paschos
出版社Springer Verlag
ページ390-402
ページ数13
ISBN(印刷版)9783319181721
DOI
出版ステータス出版済み - 2015
イベント9th International Conference on Algorithms and Complexity, CIAC 2015 - Paris, フランス
継続期間: 5 20 20155 22 2015

出版物シリーズ

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

その他

その他9th International Conference on Algorithms and Complexity, CIAC 2015
国/地域フランス
CityParis
Period5/20/155/22/15

All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「An opportunistic text indexing structure based on run length encoding」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル