Abstract
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 (l(T) + |Σ|log n + O(1))-bit working space (excluding the space for the output suffix array), where Σ is an integer or constant alphabet, and l(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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
