Deterministic sub-linear space LCE data structures with efficient construction

Yuka Tanimura, Tomohiro I, Hideo Bannai, Shunsuke Inenaga, Simon J. Puglisi, Masayuki Takeda

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

5 Citations (Scopus)

Abstract

Given a string S of n symbols, a longest common extension query LCE(i, j) asks for the length of the longest common prefix of the ith and jth suffixes of S. LCE queries have several important applications in string processing, perhaps most notably to suffix sorting. Recently, Bille et al. (J. Discrete Algorithms 25:42-50, 2014, Proc. CPM 2015:65-76) described several data structures for answering LCE queries that offers a trade-off between data structure size and query time. In particular, for a parameter 1 ≤ τ ≤ n, their best deterministic solution is a data structure of size O(n/τ) which allows LCE queries to be answered in O(τ) time. However, the construction time for all deterministic versions of their data structure is quadratic in n. In this paper, we propose a deterministic solution that achieves a similar space-time trade-off of O(τ min{log τ, log n/τ}) query time using O(n/τ) space, but we significantly improve the construction time to O(nτ).

Original languageEnglish
Title of host publication27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
EditorsRoberto Grossi, Moshe Lewenstein
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Pages1.1-1.10
ISBN (Electronic)9783959770125
DOIs
Publication statusPublished - Jun 1 2016
Event27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 - Tel Aviv, Israel
Duration: Jun 27 2016Jun 29 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume54
ISSN (Print)1868-8969

Other

Other27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016
CountryIsrael
CityTel Aviv
Period6/27/166/29/16

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Deterministic sub-linear space LCE data structures with efficient construction'. Together they form a unique fingerprint.

  • Cite this

    Tanimura, Y., I, T., Bannai, H., Inenaga, S., Puglisi, S. J., & Takeda, M. (2016). Deterministic sub-linear space LCE data structures with efficient construction. In R. Grossi, & M. Lewenstein (Eds.), 27th Annual Symposium on Combinatorial Pattern Matching, CPM 2016 (pp. 1.1-1.10). (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 54). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2016.1