Inducing the LCP-Array

  • Johannes Fischer
Conference paper

DOI: 10.1007/978-3-642-22300-6_32

Volume 6844 of the book series Lecture Notes in Computer Science (LNCS)
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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Johannes Fischer
    • 1
  1. 1.KITInstitut für Theoretische InformatikKarlsruheGermany