TY - GEN
T1 - In-place suffix sorting
AU - Franceschini, G.
AU - Muthukrishnan, S.
PY - 2007
Y1 - 2007
N2 - Given string T = T[1,... ,n], the suffix sorting problem is to lexicographically sort the suffixes T[i,... ,n] for all i. This problem is central to the construction of suffix arrays and trees with many applications in string processing, computational biology and compression. A bottleneck in these applications is the amount of workspace needed to perform suffix sorting beyond the space needed to store the input as well as the output. In particular, emphasis is even on the constant c in the O(n) = cn space algorithms known for this problem, Currently the best previous result [5] takes O (nv + n log n) time and O (n/ √v) extra space, for any v ∈6 [1, √n] for strings from a general alphabet. We improve this and present the first known in-place suffix sorting algorithm. Our algorithm takes O (n log n) time using O(1) workspace and is optimal in the worst case for the general alphabet.
AB - Given string T = T[1,... ,n], the suffix sorting problem is to lexicographically sort the suffixes T[i,... ,n] for all i. This problem is central to the construction of suffix arrays and trees with many applications in string processing, computational biology and compression. A bottleneck in these applications is the amount of workspace needed to perform suffix sorting beyond the space needed to store the input as well as the output. In particular, emphasis is even on the constant c in the O(n) = cn space algorithms known for this problem, Currently the best previous result [5] takes O (nv + n log n) time and O (n/ √v) extra space, for any v ∈6 [1, √n] for strings from a general alphabet. We improve this and present the first known in-place suffix sorting algorithm. Our algorithm takes O (n log n) time using O(1) workspace and is optimal in the worst case for the general alphabet.
UR - http://www.scopus.com/inward/record.url?scp=38149140840&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=38149140840&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-73420-8_47
DO - 10.1007/978-3-540-73420-8_47
M3 - Conference contribution
AN - SCOPUS:38149140840
SN - 3540734198
SN - 9783540734192
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 533
EP - 545
BT - Automata, Languages and Programming - 34th International Colloquium, ICALP 2007, Proceedings
PB - Springer Verlag
T2 - 34th International Colloquium on Automata, Languages and Programming, ICALP 2007
Y2 - 9 July 2007 through 13 July 2007
ER -