| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950917 | Information Processing Letters | 2017 | 5 Pages |
Abstract
We show how the longest common prefix (LCP) array can be generated as a by-product of the suffix array construction algorithm SACA-K (Nong, 2013). Our algorithm builds on Fischer's proposal (Fischer, WADS'11), and also runs in linear time, but uses only constant extra memory for constant alphabets.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Felipe A. Louza, Simon Gog, Guilherme P. Telles,