First huffman, then burrows-wheeler: A simple alphabet-independent FM-index

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3246, Issue , 2004, Pages 210-211

  Grabowski, Szymon ^a   Mäkinen, Veli ^b   Navarro, Gonzalo ^c  

^a LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF HELSINKI   (Finland)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84871093558     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_29     Document Type: Conference Paper

References (4)

1. M. Burrows and D. J. Wheeler. A block-sorting lossless data compression algorithm. DEC SRC Research Report 124, 1994.
2. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. FOCS'00, pp. 390-398, 2000.
3. Sz. Grabowski,V. Mäkinen and G. Navarro. First Huffman, then Burrows-Wheeler: A Simple Alphabet-Independent FM-Index. Technical Report TR/DCC-2004-4, Dept. of Computer Science, University of Chile. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/huffbwt.ps.gz
4. I. Munro. Tables. In Proc. FSTTCS'96, pp. 37-42, 1996.