Suffix arrays: a new method for on-line string searches
SIAM Journal on Computing
Suffix arrays: a new method for on-line string searches
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Reducing the space requirement of suffix trees
Software—Practice & Experience
A Space and Time Efficient Algorithm for Constructing Compressed Suffix Arrays
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Engineering a Lightweight Suffix Array Construction Algorithm
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
On the Performance of BWT Sorting Algorithms
DCC '00 Proceedings of the Conference on Data Compression
An Efficient Method for in Memory Construction of Suffix Arrays
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Linear work suffix array construction
Journal of the ACM (JACM)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Space efficient linear time construction of suffix arrays
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Linear Time Suffix Array Construction Using D-Critical Substrings
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
| Hi-index | 0.00 |
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.