A fast suffix-sorting algorithm

Authors:
R. Ahlswede;B. Balkenhol;C. Deppe;M. Fröhlich
Affiliations:
Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany;-;Fakultät für Mathematik, Universität Bielefeld, Bielefeld, Germany;-
Venue:
General Theory of Information Transfer and Combinatorics
Year:
2006

Citing 5
Cited 0

Suffix arrays: a new method for on-line string searches

SIAM Journal on Computing
Fast algorithms for sorting and searching strings

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A Fast Block-Sorting Algorithm for Lossless Data Compression

DCC '97 Proceedings of the Conference on Data Compression
A Fast Algorithms for Making Suffix Arrays and for Burrows-Wheeler Transformation

DCC '98 Proceedings of the Conference on Data Compression
The Context Trees of Block Sorting Compression

DCC '98 Proceedings of the Conference on Data Compression

Quantified Score

Hi-index	0.00

Visualization

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]).