A compressed self-index using a Ziv-Lempel dictionary

Information Retrieval

Volumn 11, Issue 4, 2008, Pages 359-388

  Russo, Luís M S ^a   Oliveira, Arlindo L ^a  

^a INESC ID   (Portugal)

Author keywords

Compressed index; Data compression; Pattern matching; Text indexing

Indexed keywords

EID: 43949107477     PISSN: 13864564     EISSN: 15737659     Source Type: Journal    
DOI: 10.1007/s10791-008-9050-3     Document Type: Article

References (29)

1. Arroyuelo, D., Navarro, G., & Sadakane, K. (2006). Reducing the space requirement of LZ-index. In Proceedings of CPM, volume 4009 of Lecture Notes in Computer Science, pp. 318-329.
2. Benoit, D., Demaine, E. D., Munro, J. I., Raman, R., Raman, V., & Rao, S. S. (2005). Representing trees of higher degree. Algorithmica, 43(4), 275-292.
3. Chazelle, B. (1988). A functional approach to data structures and its use in multidimensional searching. SIAM Journal of Computing, 17(3), 427-462.
4. Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to Algorithms (2nd ed.). McGraw.
5. Ferragina, P., & Manzini, G. (2005). Indexing compressed text. Journal of ACM, 52(4), 552-581.
6. Ferragina, P., Manzini, G., Mäkinen, V., & Navarro, G. (2007). Compressed representations of sequences and full-text indexes. ACM Transactions on Algorithms (TALG), 3(2), article 20
7. Geary, R. F., Raman, R., & Raman, V. (2004) Succinct ordinal trees with level-ancestor queries. In Proceedings of SODA, pp. 1-10.
8. Grabowski, S., Navarro, G., Przywarski, R., Salinger, A., & Mäkinen, V. (2006). A simple alphabet-independent fm-index. International Journal of Foundation of Computer Science, 17(6), 1365-1384.
9. Grossi, R., Gupta, A., & Vitter, J. S. (2003). High-order entropy-compressed text indexes. In Proceedings of SODA, pp. 841-850.
10. Grossi, R., & Vitter, J. S. (2005). Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM Journal of Computing, 35(2), 378-407.
11. Gusfield, D. (1999). Algorithms on strings, trees, and sequences. Cambridge University Press.
12. Jacobson, G. (1989). Space-efficient static trees and graphs. In Proceedings of FOCS, pp. 549-554.
13. Kärkkäinen, J., & Ukkonen, E. (1996a). Lempel-Ziv parsing and sublinear-size index structures for string matching. In Proceedings of the 3rd South American Workshop on String Processing, pp. 141-155.
14. Kärkkäinen, J., & Ukkonen, E. (1996b). Sparse suffix trees. In Proceedings of COCOON, volume 1090 of Lecture Notes in Computer Science, pp. 219-230.
15. Kosaraju, S. R., & Manzini, G. (1999). Compression of low entropy strings with Lempel-Ziv algorithms. SIAM Journal of Computing, 29(3), 893-911.
16. Manzini, G. (2001). An analysis of the Burrows-Wheeler transform. Journal of ACM, 48(3), 407-430.
17. Munro, J. I. (1996). Tables. In Proceedings of FSTTCS 1996, volume 1180 of LNCS, pp. 37-42.
18. Munro, J. I., & Raman, V. (2001). Succinct representation of balanced parentheses and static trees. SIAM Journal of Computing, 31(3), 762-776.
19. Munro, J. I., Raman, R., Raman, V., & Rao, S. S. (2003). Succinct representations of permutations. In Proceedings of ICALP, volume 2719 of LNCS, pp. 345-356.
20. Navarro, G. (2004). Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms, 2(1), 87-114.
21. Navarro, G., & Ferragina, P., http://pizzachili.dcc.uchile.cl/.
22. Navarro, G., & Mäkinen, V. (2007). Compressed full-text indexes. ACM Computing Surveys, 39(1):article 2.
23. Pagh, R. (1999). Low redundancy in static dictionaries with o(1) worst case lookup time. In Proceedings of ICALP, volume 1644 of Lecture Notes in Computer Science, pp. 595-604.
24. Raman, R., Raman, V., & Rao, S. S. (2002). Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proceedings of SODA, pp. 233-242.
25. Russo, L. M. S., & Oliveira, A. L. (2006). A compressed self-index using a Ziv-Lempel dictionary. In Proceedings of SPIRE, volume 4209 of Lecture Notes in Computer Science, pp. 163-180.
26. Sadakane, K. (2003). New text indexing functionalities of the compressed suffix arrays. Journal of Algorithms, 48(2), 294-313.
27. Sadakane, K. (2007). Compressed suffix trees with full functionality. Theory of Computing Systems, 41(4), 589-607
28. Sadakane, K., & Grossi, R. (2006). Squeezing succinct data structures into entropy bounds. In Proceedings of SODA, pp. 1230-1239.
29. Ziv, J., & Lempel, A. (1978). Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory, 24(5), 530-536.