Inducing the LCP-Array

TL;DR

This paper presents a modification to a linear-time suffix array construction algorithm that also computes the LCP-array efficiently, outperforming recent methods in practical tests.

Contribution

It introduces a novel modification to an existing suffix array algorithm to simultaneously compute the LCP-array efficiently.

Findings

Outperforms recent LCP-array construction algorithms in practical tests

Maintains linear-time complexity for combined suffix array and LCP-array construction

Provides an efficient method suitable for large-scale string processing

Abstract

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).