A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Faster suffix sorting
2007
Theoretical Computer Science
We propose a fast and memory-efficient algorithm for lexicographically sorting the suffixes of a string, a problem that has important applications in data compression as well as string matching. Our algorithm eliminates much of the overhead of previous specialized approaches while maintaining their robustness for degenerate inputs. For input size n, our algorithm operates in only two integer arrays of size n, and has worst-case time complexity O(n log n). We demonstrate experimentally that our
doi:10.1016/j.tcs.2007.07.017
fatcat:hp4z2fauxfhjxkqiqbdhimfnz4