Faster range LCP queries

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.