Range LCP

In this paper, we define the Range LCP problem as follows. Preprocess a string S, of length n, to enable efficient solutions of the following query: Given $[i,j],\ \ 0 , compute max l, k∈{i,…,j}LCP(Sl, Sk), where LCP(Sl, Sk) is the length of the longest common prefix of the suffixes of S starting at locations l and k. This is a natural generalization of the classical LCP problem. Surprisingly, while it is known how to preprocess a string in linear time to enable LCP computation of two suffixes in constant time, this seems quite difficult in the Range LCP problem. It is trivial to answer such queries in time O(|j−i|2) after a linear-time preprocessing and easy to show an O(1) query algorithm after an O(|S|2) time preprocessing. We provide algorithms that solve the problem with the following complexities: 1 Preprocessing Time:O(|S|), Space:O(|S|), Query Time:O(|j−i|loglogn). Preprocessing Time: no preprocessing, Space:O(|j−i|log|j−i|), Query Time:O(|j−i|log|j−i|). However, the query just gives the pairs with the longest LCP, not the LCP itself. Preprocessing Time:O(|S|log2 |S|), Space:O(|S|log1+e |S|) for arbitrary small constant e, Query Time:O(loglog|S|).