Lightweight LCP-Array Construction in Linear Time
Data Structures and Algorithms
2010-12-21 v1
Abstract
The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) are therefore used instead. A CST consists of three (compressed) components: the suffix array, the LCP-array, and data structures for simulating navigational operations on the suffix tree. The LCP-array stores the lengths of the longest common prefixes of lexicographically adjacent suffixes, and it can be computed in linear time. In this paper, we present new LCP-array construction algorithms that are fast and very space efficient. In practice, our algorithms outperform the currently best algorithms.
Cite
@article{arxiv.1012.4263,
title = {Lightweight LCP-Array Construction in Linear Time},
author = {Simon Gog and Enno Ohlebusch},
journal= {arXiv preprint arXiv:1012.4263},
year = {2010}
}