A simple alphabet-independent FM-index

Proceedings of the Prague Stringology Conference '05

Volumn , Issue , 2005, Pages 231-245

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

^a LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

^b BIELEFELD UNIVERSITY   (Germany)

^c UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHABET SIZE; AVERAGE SEARCH TIME; BURROWS WHEELER TRANSFORM; FM-INDEX; FULL-TEXT INDEX; HUFFMAN; SUBSTRING; SUCCINCT DATA STRUCTURE; ZERO-ORDER ENTROPY;

DATA STRUCTURES;

PATTERN MATCHING;

EID: 84869104309     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. M. Burrows and D. J. Whcclcr. A block-sorting lossless data compression algorithm. DEC SRC Research Report 124, 1994.
2. D. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, 1996.
3. P. Fcrragina and G. Manzini. Opportunistic data structures with applications. In Proc. FOGS'00, pp. 390-398, 2000.
4. P. Fcrragina and G. Manzini. An experimental study of an opportunistic index. In Proc. SODA '01, pp. 269-278, 2001.
5. Sz. Grabowski, V. Mäkinen, and G. Navarro. First Huffman, then Burrows-Wheeler: an alphabet-independent FM-index. In Proc. SPIRE'04, pp. 210-211, 2004. Poster.
6. Sz. Grabowski, V. Mäkinen, and G. Navarro. First Huffman, then Burrows-Wheeler: an alphabet-independent FM-index. Technical Report TR/DCC-2004-4. Dept, of Computer Science, Univ. of Chile, July 2004. ftp://ftp.dcc.uchile.cl/pub/users/gnavarro/huffbwt.ps.gz.
7. R. González, Sz. Grabowski, V. Mäkinen, and G. Navarro. Practical implementation of rank and select queries. In Poster Proc. WEA '05, pp. 27-38, 2005.
8. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. SODA '03, pp. 841-850, 2003.
9. R. Grossi, A. Gupta, and J. Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proc. SODA '04, 2004.
10. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proc. STOC'OO, pp. 397-406, 2000.
11. G. Jacobson. Succinct. Static Data Structures. PhD thesis, CMU-CS-89-112, Carnegie Mellon University, 1989.
12. J. Kärkkäinen. Repetition-Based Text Indexes, PhD Thesis, Report A-1999-4, Department of Computer Science, University of Helsinki, Finland, 1999.
13. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22, pp. 935-948, 1993.
14. I. Munro. Tables. In Proc. FSTTCS'96, pp. 37-42, 1996.
15. V. Mäkinen. Compact Suffix Array A space-efficient full-text index. Fundamenta Informaticae 56(1-2), pp. 191-210, 2003.
16. V. Mäkinen and G. Navarro. Compressed compact suffix arrays. In Proc. CPM'04, pp. 420-433. LNCS 3109, 2004.
17. V. Mäkinen and G. Navarro. Succinct suffix arrays based on run-length encoding. In Proc. CPM'05, pp. 45-56. LNCS 3537, 2005.
18. G. Navarro. Indexing text using the Ziv-Lempel trie. J. of Discrete Algorithms 2(1):87-114, 2004.
19. K. Sadakane. Compressed text databases with efficient query algorithms based on the compressed suffix array. In Proc. ISAAC'00, LNCS 1969, pp. 410-421, 2000.
20. E. Ukkonen. On-line construction of suffix-trees. Algorithmica, 14, pp. 249-260, 1995.
21. I. Witten, A. Moffat and T. Bell. Managing Gigabytes. Morgan Kaufmann Publishers, New York, 1999. Second edition.