This article presents our divide-and-conquer optimal algorithms for lightweight suffix array construction for constant alphabets. These algorithms can efficiently compute the suffix array of a size-n text T with an alphabet Σ using O(n log Σ) time and (ℓ(T) + |Σ|[log n] + O(1))-bit working space (excluding the space for the output suffix array), where Σ is an integer or constant alphabet, and ℓ(T) is the length of T measured in bits. For popular applications in practice with n ≤ 232 and |Σ| ≤ 256, these results translate into O(n) time and a total space of 5n + O(1) bytes, which are the optimal time and space complexities for lightweight suffix array construction. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Nong, G., & Zhang, S. (2007). Optimal lightweight construction of suffix arrays for constant alphabets. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4619 LNCS, pp. 613–624). Springer Verlag. https://doi.org/10.1007/978-3-540-73951-7_53
Mendeley helps you to discover research relevant for your work.