TY - GEN

T1 - An opportunistic text indexing structure based on run length encoding

AU - Tamakoshi, Yuya

AU - Goto, Keisuke

AU - Inenaga, Shunsuke

AU - Bannai, Hideo

AU - Takeda, Masayuki

N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
Copyright:
Copyright 2015 Elsevier B.V., All rights reserved.

PY - 2015

Y1 - 2015

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84944731108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84944731108&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-18173-8_29

DO - 10.1007/978-3-319-18173-8_29

M3 - Conference contribution

AN - SCOPUS:84944731108

SN - 9783319181721

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 390

EP - 402

BT - Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings

A2 - Widmayer, Peter

A2 - Paschos, Vangelis Th.

PB - Springer Verlag

T2 - 9th International Conference on Algorithms and Complexity, CIAC 2015

Y2 - 20 May 2015 through 22 May 2015

ER -