Compressed dynamic tries with applications to LZ-compression in sublinear time and space

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

Volumn 4855 LNCS, Issue , 2007, Pages 424-435

  Jansson, Jesper ^a   Sadakane, Kunihiko ^a   Sung, Wing Kin ^b,c  

^a KYUSHU UNIVERSITY   (Japan)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c GENOME INSTITUTE OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN RECOGNITION; PROBLEM SOLVING;

COMPRESSED DYNAMIC TRIES; LZ-COMPRESSION ALGORITHM; SUBLINEAR TIME;

DATA STRUCTURES;

EID: 38349142588     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77050-3_35     Document Type: Conference Paper

References (20)

1. Andersson, A., Nilsson, S.: Improved behaviour of tries by adaptive branching. Information Processing Letters 46, 295-300 (1993)
2. Aoe, J.: An efficient digital search algorithm by using a double array structure. IEEE Transactions on Software Engineering 15(9), 1066-1077 (1989)
3. Arroyuelo, D., Navarro, G.: Space-efficient construction of LZ-index. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, Springer, Heidelberg (2005)
4. Beame, P., Fich, F.E.: Optimal bounds for the predecessor problem. In: Proc. of the 31 "Annual ACM Symposium on the Theory of Computing (STOC 1999), pp. 295-304 (1999)
5. Brent, R.P.: A linear algorithm for data compression. Australian Computer Journal 19(2), 64-68 (1987)
6. Devroye, L., Szpankowski, W.: Probabilistic behavior of asymmetric level compressed tries. Random Structures and Algorithms 27, 185-200 (2005)
7. Fredkin, E.: Trie memory. Communications of the ACM 3, 490-500 (1960)
8. Geary, R.F., Rahman, N., Raman, R., Raman, V.: A simple optimal representation for balanced parentheses. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 159-172. Springer, Heidelberg (2004)
9. Hagerup, T.: Sorting and searching on the word ram. In: Proceedings of Symposium on Theory Aspects of Computer Science, pp. 366-398 (1998)
10. Hon, W.-K., Lam, T.-W., Sadakane, K., Sung, W.-K.: Constructing compressed suffix arrays with large alphabets. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol. 2906, Springer, Heidelberg (2003)
11. Morrison, D.R.: PATRICIA - Practical Algorithm To Retrieve Information Coded In Alphanumeric. Journal of the ACM 15(4), 514-534 (1968)
12. Munro, J.I., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM Journal on Computing 31(3), 762-776 (2001)
13. Navarro, G.: Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithmes (JDA) 2(1), 87-114 (2004)
14. Nilsson, S., Karlsson, G.: IP-address lookup using lc-tries. Journal on Selected Areas in Communications IEEE 17(6), 1083-1092 (1999)
15. Rodeh, M., Pratt, V.R., Even, S.: Linear algorithm for data compression via string matching. Journal of ACM 28(1), 16-24 (1981)
16. Sadakane, K., Grossi, R.: Squeezing Succinct Data Structures into Entropy Bounds. In: Proc. ACM-SIAM SODA, pp. 1230-1239. ACM Press, New York (2006)
17. Welch, T.A.: A technique for high-performance data compression. IEEE Computer, 8-19 (1984)
18. Willard, D.E.: Log-logarithmic worst case range queries are possible in space θ(n). Information Processing Letters 17, 81-84 (1983)
19. Willard, D.E.: New trie data structures which support very fast search operations. Journal of Computer and System Sciences 28, 379-394 (1984)
20. Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory IT-24(5), 530-536 (1978)