Skip to main navigation Skip to search Skip to main content

Faster external memory LCP array construction

  • University of Helsinki

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

11 Scopus citations

Abstract

The suffix array, perhaps the most important data structure in modern string processing, needs to be augmented with the longest-common-prefix (LCP) array in many applications. Their construction is often a major bottleneck especially when the data is too big for internal memory. We describe two new algorithms for computing the LCP array from the suffix array in external memory. Experiments demonstrate that the new algorithms are about a factor of two faster than the fastest previous algorithm.

Original languageEnglish
Title of host publication24th Annual European Symposium on Algorithms, ESA 2016
EditorsChristos Zaroliagis, Piotr Sankowski
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770156
DOIs
StatePublished - Aug 1 2016
Event24th Annual European Symposium on Algorithms, ESA 2016 - Aarhus, Denmark
Duration: Aug 22 2016Aug 24 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume57
ISSN (Print)1868-8969

Conference

Conference24th Annual European Symposium on Algorithms, ESA 2016
Country/TerritoryDenmark
CityAarhus
Period08/22/1608/24/16

Keywords

  • External memory algorithms
  • LCP array
  • Suffix array

Fingerprint

Dive into the research topics of 'Faster external memory LCP array construction'. Together they form a unique fingerprint.

Cite this