Abstract
We present an algorithm to sort all suffixes of \(x^n=(x_1,\dots,x_n) \in {\cal X}^n\) lexicographically, where \({\cal X}=\{0,\dots,q-1\}\). Fast and efficient sorting of a large amount of data according to its suffix structure (suffix-sorting) is a useful technology in many fields of application, front-most in the field of Data Compression where it is used e.g. for the Burrows and Wheeler Transformation (BWT for short), a block-sorting transformation ([3],[9]).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Balkenhol, B., Kurtz, S.: Space efficient linear time computation of the Burrows and Wheeler transformation. In: Althöfer, I., Cai, N., Dueck, G., Khachatrian, L., Pinsker, M., Sárközy, A., Wegener, I., Zhang, Z. (eds.) Number, Information and Complexity, Special volume in honour of R. Ahlswede on occasion of his 60th birthday, pp. 375–384. Kluwer Acad. Publ., Dordrecht (1999)
Bentley, J., Sedgewick, R.: Fast algorithm for sorting and searching strings. In: Proceedings of the ACM–SIAM Symposium on Discrete Algorithms, pp. 360–369 (1997)
Burrows, M., Wheeler, D.J.: A block–sorting lossless data compression algorithm, Technical report, Digital Systems Research Center (1994)
Larsson, N.J.: The context trees of block sorting compression. In: Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 30-April 1, pp. 189–198. IEEE Computer Society Press, Los Alamitos (1998)
Larsson, N.J.: Structures of string matching and data compression, PhD thesis, Dept. of Computer Science, Lund University (1999)
Larsson, N.J., Sadakane, K.: Faster suffix–sorting, Technical Report LU–CS–TR: 99–214, LUNDFD6/(NFCS–3140)/1–20/(1999), Dept. of Computer Science, Lund University (1999)
Manber, U., Myers, E.W.: Suffix arrays: A new method for on–line string searches. SIAM Journal on Computing 22(5), 935–948 (1993)
Sadakane, K.: A fast algorithm for making suffix arrays and for Burrows–Wheeler transformation. In: Proceedings of the IEEE Data Compression Conference, Snowbird, Utah, March 30–April 1, pp. 129–138. IEEE Computer Society Press, Los Alamitos (1998)
Schindler, M.: A fast block–sorting algorithm for lossless data compression. In: Proceedings of the Conference on Data Compression, p. 469 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ahlswede, R., Balkenhol, B., Deppe, C., Fröhlich, M. (2006). A Fast Suffix-Sorting Algorithm. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_46
Download citation
DOI: https://doi.org/10.1007/11889342_46
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46244-6
Online ISBN: 978-3-540-46245-3
eBook Packages: Computer ScienceComputer Science (R0)