An opportunistic text indexing structure based on run length encoding

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings
EditorsPeter Widmayer, Vangelis Th. Paschos
PublisherSpringer Verlag
Pages390-402
Number of pages13
ISBN (Print)9783319181721
DOIs
Publication statusPublished - 2015
Event9th International Conference on Algorithms and Complexity, CIAC 2015 - Paris, France
Duration: May 20 2015May 22 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9079
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other9th International Conference on Algorithms and Complexity, CIAC 2015
CountryFrance
CityParis
Period5/20/155/22/15

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'An opportunistic text indexing structure based on run length encoding'. Together they form a unique fingerprint.

  • Cite this

    Tamakoshi, Y., Goto, K., Inenaga, S., Bannai, H., & Takeda, M. (2015). An opportunistic text indexing structure based on run length encoding. In P. Widmayer, & V. T. Paschos (Eds.), Algorithms and Complexity - 9th International Conference, CIAC 2015, Proceedings (pp. 390-402). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 9079). Springer Verlag. https://doi.org/10.1007/978-3-319-18173-8_29