Simple Linear Work Suffix Array Construction
recursively sort suffixes beginning at positions i mod 3 ≠ 0.
sort the remaining suffixes using the information obtained in step one.
merge the two sorted sequences obtained in steps one and two.
The algorithm is much simpler than previous linear time algorithms that are all based on the more complicated suffix tree data structure. Since sorting is a well studied problem, we obtain optimal algorithms for several other models of computation, e.g. external memory with parallel disks, cache oblivious, and parallel. The adaptations for BSP and EREW-PRAM are asymptotically faster than the best previously known algorithms.
Unable to display preview. Download preview PDF.