Simple compression code supporting random access and fast string matching

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

Volumn 4525 LNCS, Issue , 2007, Pages 203-216

  Fredriksson, Kimmo ^a   Nikitin, Fedor ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHARACTER RECOGNITION; COMPUTATIONAL METHODS; DATA COMPRESSION;

ALPHABETS; COMPRESSED SEQUENCES; STRING MATCHING ALGORITHMS; TRADE-OFFS;

CODES (SYMBOLS);

EID: 37149017026     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72845-0_16     Document Type: Conference Paper

References (28)

1. Amir, A., Benson, G.: Two-dimensional periodicity and its applications. In: Proceedings of SODA'92, pp. 440-452 (1992)
2. Baeza-Yates, R.A., Gonnet, G.H.: A new approach to text searching. Commun. ACM 35(10), 74-82 (1992)
3. Brisaboa, N., Iglesias, E., Navarro, C., Parama, J.: An efficient compression code for text databases. In: Sebastiani, F. (ed.) ECIR 2003. LNCS, vol. 2633, pp. 468-481. Springer, Heidelberg (2003)
4. Brown, J.L.: Zeckendorf's theorem and some applications. Fib. Quart. vol. 2, pp. 163-168
5. Brown, J.L.: A new characterization of the Fibonacci numbers. Fib. Quart. 3, 1-8 (1965)
6. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report 124, Digital Equipment Corporation (1994)
7. Clark, D.R.: Compact Pat Trees. PhD thesis, University of Waterloo, Ontario, Canada (1998)
8. Elias, P.: Universal codeword sets and representation of the integers. IEEE Transactions on Information Theory 21(2), 194-203 (1975)
9. Fredriksson, K.: Shift-or string matching with super-alphabets. Information Processing Letters 87(1), 201-204 (2003)
10. González, R., Navarro, G.: Statistical encoding of succinct data structures. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 295-306. Springer, Heidelberg (2006)
11. Grabowski, S., Navarro, C., Przywarski, R., Salinger, A., Mäkinen, V.: A simple alphabet-independent FM-index. International Journal of Foundations of Computer Science (IJFCS) 17(6), 1365-1384 (2006)
12. Heaps, H.S.: Information retrieval: theoretical and computational aspects. Academic Press, New York (1978)
13. Horspool, R.N.: Practical fast searching in strings. Softw. Pract. Exp. 10(6), 501-506 (1980)
14. Huffman, D.A.: A method for the construction of minimum redundancy codes. Proceedings of I.R.E 40, 1098-1101 (1951)
15. Jacobson, G.: Succinct static data structures. PhD thesis, Carnegie Mellon University (1989)
16. Mäkinen, V., Navarro, G.: Rank and select revisited and extended. Theoretical Computer Science, Special issue on "The Burrows-Wheeler Transform and its Applications". To appear (2006)
17. Manber, U.: A text compression scheme that allows fast searching directly in the compressed file. ACM Trans. Inform. Syst. 15(2), 124-136 (1997)
18. Moura, E., Navarro, C., Ziviani, N., Baeza-Yates, R.: Fast and flexible word searching on compressed text. ACM Transactions on Information Systems (TOIS) 18(2), 113-139 (2000)
19. Munro, J.I.: Tables. In: Chandru, V., Vinay, V. (eds.) Foundations of Software Technology and Theoretical Computer Science. LNCS, vol. 1180, pp. 37-42. Springer, Heidelberg (1996)
20. Navarro, C., Raffinot, M.: Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), vol. 5(4) (2000)
21. Okanohara, D., Sadakane, K.: Practical entropy-compressed rank/select dictionary. In: Proceedings of ALENEX'07, ACM Press, New York (2007)
22. Pagh, R.: Low redundancy in static dictionaries with o(1) worst case lookup time. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 595-604. Springer, Heidelberg (1999)
23. Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proceedings of SODA'02, pp. 233-242. ACM Press, New York (2002)
24. Sadakane, K., Grossi, R.: Squeezing succinct data structures into entropy bounds. In: Proceedings of SODA'06, pp. 1230-1239. ACM Press, New York (2006)
25. Sunday, D.M.: A very fast substring search algorithm. Commun. ACM 33(8), 132-142 (1990)
26. Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Communications of the ACM 30(6), 520 (1987)
27. Yao, A.C.: The complexity of pattern matching for a random string. SIAM J. Comput. 8(3), 368-387 (1979)
28. Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theory 23, 337-343 (1977)