A note on the Burrows-Wheeler transformation

Theoretical Computer Science

Volumn 332, Issue 1-3, 2005, Pages 567-572

  Crochemore, Maxime ^a   Désarménien, Jacques ^a   Perrin, Dominique ^a  

^a UNIVERSITÉ GUSTAVE EIFFEL   (France)

Author keywords

Combinatorics on words; Text compression

Indexed keywords

CODES (SYMBOLS); COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; CONFORMAL MAPPING; ENCODING (SYMBOLS); INTEGER PROGRAMMING; ITERATIVE METHODS; TEXT PROCESSING; THEOREM PROVING; VECTORS; WORD PROCESSING;

BURROWS-WHEELER TRANSFORMATION; COMBINATORICS ON WORDS; PERMUTATIONS; TEXT COMPRESSION;

MATHEMATICAL TRANSFORMATIONS;

EID: 13644253232     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.11.014     Document Type: Article

References (11)

1. H. Bannai, S. Inenaga, A. Shinohara, M. Takeda, Inferring strings from graphs and arrays, in: B. Rovan, P. Vojtáš (Eds.), Mathematical Foundations of Computer Science 2003, Lecture Notes in Computer Science, Vol. 2747, Springer, Berlin, 2003.
2. M. Burrows, D.J. Wheeler, A block sorting data compression algorithm, Tech. Report, Digital System Research Center, 1994.
3. M. Crochemore, and W. Rytter Jewels of Strigology 2002 World Scientific Singapore
4. J.-P. Duval, and A. Lefebvre Words over an ordered alphabet and suffix permutations Theor. Inform. Appl. 36 2002 249 260
5. I.M. Gessel, and C. Reutenauer Counting permutations with given cycle structure and descent set J. Combin. Theory Ser. A 64 2 1993 189 215
6. J. Kärkkäinen, P. Sanders, Simple linear work suffix array construction, in: J.C.M. Beaten, J.K. Lenstra, J. Parrow, G.J. Woeginger (Eds.), in: Proc. 30th Internat. Coll. on Automata, Languages and Programming (ICALP '03), Lecture Notes in Computer Science, Vol. 2619, Springer, Berlin, 2003, pp. 943-955.
7. D.K. Kim, J.S. Sim, H. Park, K. Park, Linear-time construction of suffix arrays, in: Ricardo Baeza-Yates, E. Chávez, Maxime Crochemore (Eds.), Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 2676, Springer, Berlin, 2003, pp. 186-199.
8. P. Ko, S. Aluru, Space efficient linear time construction of suffix arrays, in: Ricardo Baeza-Yates, E. Chávez, Maxime Crochemore (Eds.), Combinatorial Pattern Matching, Lecture Notes in Computer Science, Vol. 2676, Springer, Berlin, 2003, pp. 200-210.
9. M. Lothaire Algebraic Combinatorics on Words 2002 Cambridge University Press Cambridge
10. S. Mantaci, A. Restivo, and M. Sciortino The Burrows-Wheeler transform and Sturmian words Inform. Process. Lett. 86 2003 241 246
11. G. Manzini An analysis of the Burrows-Wheeler transform J. ACM 48 3 2001 407 430