Skip to main content
Conference Proceedings

Inducing the LCP-array

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6844 LNCS 374-385
DOI: 10.1007/978-3-642-22300-6_32
58Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

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). © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Fischer, J. (2011). Inducing the LCP-array. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6844 LNCS, pp. 374–385). https://doi.org/10.1007/978-3-642-22300-6_32

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free