Inducing the LCP-Array
- Cite this paper as:
- Fischer J. (2011) Inducing the LCP-Array. In: Dehne F., Iacono J., Sack JR. (eds) Algorithms and Data Structures. WADS 2011. Lecture Notes in Computer Science, vol 6844. Springer, Berlin, Heidelberg
We show how to modify the linear-time construction algorithm for suffix arrays based on induced sorting (Nong et al., DCC’09) such that it computes the array of longest common prefixes (LCP-array) as well. Practical tests show that this outperforms recent LCP-array construction algorithms (Gog and Ohlebusch, ALENEX’11).
Unable to display preview. Download preview PDF.