Faster range LCP queries
Document Type
Conference Proceeding
Publication Date
1-1-2013
Abstract
Range LCP (longest common prefix) is an extension of the classical LCP problem and is defined as follows: Preprocess a string S[1...n] so that max a,b∈{i...j}LCP(Sa,Sb) can be computed efficiently for the input i, j ∈ [1, n], where LCP(Sa,S b) is the length of the longest common prefix of the suffixes of S starting at locations a and b. In this paper, we describe a linear space data structure with O((j - i)1/2 log∈(j - i)) query time, where ∈ > 0 is any constant. This improves the linear space and O((j - i) log log n) query time solution by Amir et. al. [ISAAC, 2011]. © Springer International Publishing 2013.
Publication Source (Journal or Book title)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
First Page
263
Last Page
270
Recommended Citation
Patil, M., Shah, R., & Thankachan, S. (2013). Faster range LCP queries. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 8214 LNCS, 263-270. https://doi.org/10.1007/978-3-319-02432-5_29