FM-KZ: An even simpler alphabet-independent FM-index

Proceedings of the Prague Stringology Conference '06

Volumn , Issue , 2006, Pages 226-240

  Przywarski, Rafał ^a   Grabowski, Szymon ^a   Navarro, Gonzalo ^b   Salinger, Alejandro ^c  

^a LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNIVERSITY OF CHILE   (Chile)

^c UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BIT STREAM; BURROWS WHEELER TRANSFORM; DNA TESTS; EFFICIENT IMPLEMENTATION; FM-INDEX; HUFFMAN; HUFFMAN CODEWORD; NEW INDICES; SEARCH TIME; SPACE USE; SUCCINCT DATA STRUCTURE;

DATA STRUCTURES;

PATTERN MATCHING;

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

References (15)

1. M. Burrows and D. Wheeler: A block sorting lossless data compression algorithm, Tech. Rep. 124, Digital Equipment Corporation, 1994.
2. D. Clark: Compact Pat Trees, PhD thesis, University of Waterloo, Canada, 1996.
3. P. Ferragina and G. Manzini: Opportunistic data structures with applications, in Proc. 41st IEEE Symposium on Foundations of Computer Science (FOCS), 2000, pp. 390-398.
4. P. Ferragina and G. Manzini: An experimental study of an opportunistic index, in Proc. 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 2001, pp. 269-278.
5. R. González, S. Grabowski, V. Mäkinen, and G. Navarro: Practical implementation of rank and select queries, in Poster Proceedings Volume of 4th Workshop on Efficient and Experimental Algorithms (WEA'05), Greece, 2005, CTI Press and Ellinika Grammata, pp. 27-38.
6. S. Grabowski, V. Mäkinen, and G. Navarro: First Huffman, then Burrows-Wheeler: An alphabet-independent FM-index, in Proceedings of the 11 Symposium on String Processing and Information Retrieval (SPIRE'04), LNCS v. 3246, 2004, pp. 210-211.
7. S. Grabowski, V. Mäkinen, G. Navarro, and A. Salinger: A simple alphabet-independent FM-index, in Proceedings of the 10th Prague Stringology Conference (PSC'05), 2005, pp. 230-244.
8. G. Jacobson: Space-efficient static trees and graphs, in Proc. 30th IEEE Symposium on Foundations of Computer Science (FOCS), 1989, pp. 549-554.
9. W. H. Kautz: Fibonacci codes for synchronization control. IEEE Transactions on Information Theory, 11 1965, pp. 242-292.
10. V. Mäkinen and G. Navarro: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing, 12(1) 2005, pp. 40-66.
11. I. Munro: Tables, in Proc. 16th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), LNCS v. 1180, 1996, pp. 37-42.
12. G. Navarro: Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms, 2(1) 2004, pp. 87-114.
13. G. Navarro and V. Mäkinen: Compressed full-text indexes (2nd version), Tech. Rep. TR/DCC-2006-6, Department of Computer Science, University of Chile, Chile, Apr. 2006.
14. K. Sadakane: Compressed text databases with efficient query algorithms based on the compressed suffix array, in Proc. 11th International Symposium on Algorithms and Computation (ISAAC), LNCS v. 1969, 2000, pp. 410-421.
15. 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 1972, pp. 179-182.