Simple Linear Work Suffix Array Construction

Abstract

A suffix array represents the suffixes of a string in sorted order. Being a simpler and more compact alternative to suffix trees, it is an important tool for full text indexing and other string processing tasks. We introduce the skew algorithm for suffix array construction over integer alphabets that can be implemented to run in linear time using integer sorting as its only nontrivial subroutine: 1. recursively sort suffixes beginning at positions i mod 3 = 0. 2. sort the remaining suffixes using the information obtained in step one. 3. 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.

DOI: 10.1007/3-540-45061-0_73

Extracted Key Phrases

2 Figures and Tables

0204060'03'05'07'09'11'13'15'17
Citations per Year

470 Citations

Semantic Scholar estimates that this publication has 470 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Krkkinen2003SimpleLW, title={Simple Linear Work Suffix Array Construction}, author={Juha K{\"a}rkk{\"a}inen and Peter Sanders}, booktitle={ICALP}, year={2003} }