2026-07-25T00:39:13Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6065 2024-03-06T10:37:33Z ddc:004 open_access

Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction Tanimura, Yuka I, Tomohiro Bannai, Hideo Inenaga, Shunsuke Puglisi, Simon J. Takeda, Masayuki longest common extension longest common prefix sparse suffix array 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 $i$th and $j$th 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 space-time trade-off between data structure size and query time. In particular, for a parameter 1 <= tau <= n, their best deterministic solution is a data structure of size O(n/tau) which allows LCE queries to be answered in O(tau) 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(tau * min(log(tau),log(n/tau)) query time using O(n/tau) space, but significantly improve the construction time to O(n*tau). Schloss Dagstuhl – Leibniz-Zentrum für Informatik Yuka Tanimura and Tomohiro I and Hideo Bannai and Shunsuke Inenaga and Simon J. Puglisi and Masayuki Takeda 2016 Is Part Of LIPIcs, Volume 54, 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CPM.2016.1 urn:nbn:de:0030-drops-60655 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.1 eng https://creativecommons.org/licenses/by/3.0/legalcode