Algorithms and Data Structures

Volume 6844 of the series Lecture Notes in Computer Science pp 374-385

Inducing the LCP-Array

  • Johannes FischerAffiliated withKIT, Institut für Theoretische Informatik

* Final gross prices may vary according to local VAT.

Get Access


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