Combinatorial Pattern Matching

Volume 2676 of the series Lecture Notes in Computer Science pp 55-69


Fast Lightweight Suffix Array Construction and Checking

  • Stefan BurkhardtAffiliated withMax-Planck-Institut für Informatik
  • , Juha KärkkäinenAffiliated withMax-Planck-Institut für Informatik

* Final gross prices may vary according to local VAT.

Get Access


We describe an algorithm that, for any v ∈ [2, n], constructs the suffix array of a string of length n in \( \mathcal{O}\left( {vn + n log{\mathbf{ }}n} \right) \) time using \( \mathcal{O}\left( {v + n/\sqrt v } \right) \) space in addition to the input (the string) and the output (the suffix array). By setting v = log n, we obtain an \( \mathcal{O}\left( {n log n} \right) \) time algorithm using \( \mathcal{O}\left( {n/\sqrt {log n} } \right) \) extra space. This solves the open problem stated by Manzini and Ferragina [ESA ’02] of whether there exists a lightweight (sublinear extra space) \( \mathcal{O}\left( {n log n} \right) \) time algorithm. The key idea of the algorithm is to first sort a sample of suffixes chosen using mathematical constructs called difference covers. The algorithm is not only lightweight but also fast in practice as demonstrated by experiments. Additionally, we describe fast and lightweight suffix array checkers, i.e., algorithms that check the correctness of a suffix array.