Back to Search
Start Over
A Fast Suffix-Sorting Algorithm.
- Source :
- General Theory of Information Transfer & Combinatorics; 2006, p719-734, 16p
- Publication Year :
- 2006
-
Abstract
- We present an algorithm to sort all suffixes of ]> lexicographically, where ]> . 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]). [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540462446
- Database :
- Complementary Index
- Journal :
- General Theory of Information Transfer & Combinatorics
- Publication Type :
- Book
- Accession number :
- 76792949
- Full Text :
- https://doi.org/10.1007/11889342_46