An Incomplex Algorithm for Fast Suffix Array Construction Klaus-Bernd Sch¨urmann∗ Jens Stoye† Abstract Our aim is to provide full text indexing data structures and algorithms for universal usage in text indexing. We present a practical algorithm for suffix array construction. The fundamental algorithm is less complex than other construction algorithms. We achieve very fast construction times for comm