A simple alphabet-independent FM-index

International Journal of Foundations of Computer Science

Volumn 17, Issue 6, 2006, Pages 1365-1384

  Grabowski, Szymon ^a   Navarro, Gonzalo ^b   Przywarski, Rafał ^a   Salinger, Alejandro ^c   Mäkinen, Veli ^d  

^a LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33845549039     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129054106004467     Document Type: Conference Paper

References (26)

1. M. Burrows and D. Wheeler. 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. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. FOCS'00, pp. 390-398, 2000.
4. P. Ferragina and G. Manzini. An experimental study of an opportunistic index. In Proc. SODA'01, pp. 269-278, 2001.
5. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. An alphabet-friendly FM-index. In Proc. SPIRE'04, pp. 150-160, 2004. LNCS 3246.
6. 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.
7. 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.
8. 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.
9. Sz. Grabowski, V. Mäkinen, G. Navarro, and A. Salinger. A simple alphabet-independent FM-index. In Proc. PSC'05, pp. 230-244, 2005.
10. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. SODA '03, pp. 841-850, 2003.
11. R. Grossi, A. Gupta, and J. Vitter. When indexing equals compression: Experiments with compressing suffix arrays and applications. In Proc. SODA '04, 2004.
12. R. Grossi and J. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. In Proc. STOC'00, pp. 397-406, 2000.
13. J. Kärkkäinen. Repetition-Based Text Indexes, PhD Thesis, Report A-1999-4, Department of Computer Science, University of Helsinki, Finland, 1999.
14. W. Kautz. Fibonacci codes for synchronization control. IEEE Trans. on Inf. Th., 11, pp. 284-292, 1965.
15. U. Manber and G. Myers. Suffix arrays: A new method for on-line string searches. SIAM J. Comput., 22, pp. 935-948, 1993.
16. V. Mäkinen. Compact Suffix Array - A space-efficient full-text index. Fundamenta Informaticae 56(1-2), pp. 191-210, 2003.
17. V. Mäkinen and G. Navarro. Compressed compact suffix arrays. In Proc. CPM'04, pp. 420-433. LNCS 3109, 2004.
18. V. Mäkinen and G. Navarro. Succinct suffix arrays based on run-length encoding. Nordic J. of Computing 12(1):40-66, 2005.
19. I. Munro. Tables. In Proc. FSTTCS'96, pp. 37-42, 1996.
20. G. Navarro. Indexing text using the Ziv-Lempel trie. J. of Discrete Algorithms 2(1):87-114, 2004.
21. R. Przywarski, Sz. Grabowski, G. Navarro, and A. Salinger. FM-KZ: An even simpler alphabet-independent FM-index. In Proc. PSC'06, 2006. To appear.
22. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. 13th ACM-SIAM SODA, pp. 233-242, 2002.
23. 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.
24. P. Weiner. Linear pattern matching algorithm. Proc. 14th Annual IEEE Symposium on Switching and Automata Theory pp. 1-11, 1973.
25. I. Witten, A. Moffat, and T. Bell. Managing Gigabytes. Morgan Kaufmann Publishers, New York, 1999. Second edition.
26. E. Zeckendorf. Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres Lucas. Bull. Soc. Roy. Sci. Liège 41, pp. 179-182, 1972.