Implicit compression boosting with applications to self-indexing

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

Volumn 4726 LNCS, Issue , 2007, Pages 229-241

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

INDEXING (OF INFORMATION); LINEAR PROGRAMMING; MATHEMATICAL TRANSFORMATIONS; WAVELET ANALYSIS;

BURROWS-WHEELER TRANSFORM; COMPRESSION BOOSTING; K-TH ORDER ENTROPY; OPTIMAL PARTITIONING;

DATA COMPRESSION;

EID: 38049045198     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75530-2_21     Document Type: Conference Paper

References (23)

1. Apostolico, A.: The myriad virtues of subword trees. In: Combinatorial Algorithms on Words, NATO ISI Series, pp. 85-96. Springer, Heidelberg (1985)
2. Arroyuelo, D., Navarro, G.: Space-efficient construction of LZ-index. In: Deng, X., Du, D.-Z. (eds.) ISAAC 2005. LNCS, vol. 3827, pp. 1143-1152. Springer, Heidelberg (2005)
3. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report Technical Report 124, Digital Equipment Corporation (1994)
4. Chan, H.-L., Hon, W.-K., Lam, T.-W.: Compressed index for a dynamic collection of texts. In: Sahinalp, S.C., Muthukrishnan, S.M., Dogrusoz, U. (eds.) CPM 2004. LNCS, vol. 3109, pp. 445-456. Springer, Heidelberg (2004)
5. Ferragina, P., Giancarlo, R., Manzini, C.: The myriad virtues of wavelet trees. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol. 4051, pp. 560-571. Springer, Heidelberg (2006)
6. Ferragina, P., Manzini, G.: Opportunistic data structures with applications. In: Proc. FOCS 2000, pp. 390-398 (2000)
7. Ferragina, P., Manzini, G.: Compression boosting in optimal linear time using the Burrows-Wheeler transform. In: Proc. SODA 2004, pp. 655-663 (2004)
8. Ferragina, P., Manzini, G: Indexing compressed texts. J. of the ACM 52(4), 552-581 (2005)
9. Ferragina, P., Manzini, C., Mäkinen, V., Navarro, C.: Compressed representations of sequences and full-text indexes. ACM TALG, 3(2):article 20 (2007)
10. Gagie, T.: Large alphabets and incompressibility. IPL 99(6), 246-251 (2006)
11. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. SODA 2003, pp. 841-850 (2003)
12. Grossi, R., Gupta, A., Vitter, J.: When indexing equals compression: Experiments with compressing suffix arrays and applications. In: Proc. SODA 2004, pp. 636-645 (2004)
13. Hon, W.-K., Sadakane, K., Sung, W.-K.: Breaking a time-and-space barrier in constructing full-text indexes. In: Proc. FOCS 2003, pp. 251-260 (2003)
14. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. FOCS 1989, pp. 549-554 (1989)
15. Kärkkäinen, J.: Fast BWT in small space by blockwise suffix sorting. In: Proc. DIMACS Working Group on the Burrows-Wheeler Transform (2004)
16. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic J. of Computing 12(1), 40-66 (2005)
17. Mäkinen, V., Navarro, G.: Dynamic entropy-compressed sequences and full-text indexes. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 307-318. Springer, Heidelberg (2006)
18. Manber, U., Myers, C.: Suffix arrays: a new method for on-line string searches. SIAM J. on Computing, 935-948 (1993)
19. Manzini, C.: An analysis of the Burrows-Wheeler transform. J. of the ACM 48(3), 407-430 (2001)
20. Na, J.C.: Linear-time construction of compressed suffix arrays using o(n log n)-bit working space for large alphabets. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 57-67. Springer, Heidelberg (2005)
21. Pagh, R.: Low redundancy in 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)
22. Raman, R., Raman, V., Srinivasa, S.: Succinct dynamic data structures. In: Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 2001. LNCS, vol. 2125, pp. 426-437. Springer, Heidelberg (2001)
23. Raman, R., Raman, V., Srinivasa Roa, S.: Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In: Proc. SODA 2002, pp. 233-242 (2002)