eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2016-06-27
1:1
1:10
10.4230/LIPIcs.CPM.2016.1
article
Deterministic Sub-Linear Space LCE Data Structures With Efficient Construction
Tanimura, Yuka
I, Tomohiro
Bannai, Hideo
Inenaga, Shunsuke
Puglisi, Simon J.
Takeda, Masayuki
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).
https://drops.dagstuhl.de/storage/00lipics/lipics-vol054-cpm2016/LIPIcs.CPM.2016.1/LIPIcs.CPM.2016.1.pdf
longest common extension
longest common prefix
sparse suffix array