Dynamic entropy-compressed sequences and full-text indexes

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

Volumn 4009 LNCS, Issue , 2006, Pages 306-317

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

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; ENTROPY;

DYNAMIC ENTROPY; FULL-TEXT INDEXES; WORST-CASE TIME;

INDEXING (OF INFORMATION);

EID: 33746051721     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11780441_28     Document Type: Conference Paper

References (15)

1. A. Apostolico. The myriad virtues of subword trees. In Combinatorial Algorithms on Words, NATO ISI Series, pages 85-96. Springer-Verlag, 1985.
2. D. Arroyuelo and G. Navarro. Space-efficient construction of LZ-index. In Proc. ISAAC'05, LNCS 3827, pages 1143-1152, 2005.
3. M. Burrows and D. Wheeler. A block sorting lossless data compression algorithm. Technical Report Technical Report 124, Digital Equipment Corporation, 1994.
4. W.-L. Chan, W.-K. Hon, and T.-W. Lain. Compressed index for a dynamic collection of texts. In Proc. CPM'04, LNCS 3109, pages 445-456, 2004.
5. P. Dietz. Optimal algorithms for list indexing and subset rank. In Proc. WADS'89, pages 39-46, 1989.
6. P. Ferragina and G. Manzini. Opportunistic data structures with applications. In Proc. FOCS'00, pages 390-398, 2000.
7. P. Ferragina, G. Manzini, V. Mäkinen, and G. Navarro. Compressed representation of sequences and full-text indexes. ACM Transactions on Algorithms, 2006.
8. To appear. Preliminary versions in Proc. SPIRE 2004 and Tech. Rep. TR/DCC-2004-5, Dept. of Computer Science Univ. of Chile, ftp://ftp.dcc.uchile. cl/pub/users/gnavarro/sequences.ps.gz.
9. R. Grossi, A. Gupta, and J. Vitter. High-order entropy-compressed text indexes. In Proc. SODA '03, pages 841-850, 2003.
10. W.-K. Hon, K. Sadakane, and W.-K. Sung. Succinct data structures for searchable partial sums. In Proc. ISAAC'03, LNCS 2906, pages 505-516, 2003.
11. V. Mäkinen and G. Navarro. Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing, 12(1):40-66, 2005.
12. U. Manber and G. Myers. Suffix arrays; a new method for on-line string searches. SIAM Journal on Computing, pages 935-948, 1993.
13. G. Navarro. Indexing text using the Ziv-Lempel trie. Journal of Discrete Algorithms (JDA), 2(1):87-114, 2004.
14. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct dynamic data structures. In Proc. WADS'01, pages 426-437, 2001.
15. R. Raman, V. Raman, and S. Srinivasa Rao. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. In Proc. SODA '02, pages 233-242, 2002.