Efficient Storing of Suffix Arrays using Block-Sorting Compression
Geon-Ho Lee, Geun-Su Park · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2001
The block-sorting algorithm is a text compression method with good balance of compression ratio and speed. When a compressed text is decoded, the suffix array of the text is also obtained in 0(n) time. However, the longest common prefix (lcp) information is not obtained whichis necessary for efficient searching with a suffix array. We present an algorithm to obtain the lcp information in 0(n) time from the original text and its suffix array,