Login Logged in as anonymous / My BiBiServ / Logout
Authors: K. Schuermann, J. Stoye

The suffix array of a string is a permutation of all starting positions of the string's suffixes that are lexicographically sorted. We present a practical algorithm for suffix array construction that consists of two easy-to-implement components. First it sorts the suffixes with respect to a fixed length prefix; then it refines each bucket of suffixes sharing the same prefix using the order of already sorted suffixes. Other suffix array construction algorithms follow more complex strategies. Moreover, we achieve a very fast construction for common strings as well as for worst case strings by enhancing our algorithm with further techniques.

Users of BPR are requested to cite :
Schuermann, Klaus-Bernd and Stoye, Jens An Incomplex Algorithm for Fast Suffix Array Construction, Software: Practice and Experience, 2007
built on March 4 2015 (1:c3f4dbf36e93)