We present a linear-time algorithm to compute the longest common prefix information in suffix arrays. As two applications
of our algorithm, we show that our algorithm is crucial to the effective use of block-sorting compression, and we present
a linear-time algorithm to sim- ulate the bottom-up traversal of a suffix tree with a suffix array combined with the longest
common prefix information.