Compressed text indexes with fast locate

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

Volumn 4580 LNCS, Issue , 2007, Pages 216-227

  González, Rodrigo ^a   Navarro, Gonzalo ^a  

^a UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES; ONLINE SEARCHING; QUERY LANGUAGES; TEXT PROCESSING;

COMPRESSED TEXT; SECONDARY MEMORY; SUFFIX ARRAYS; TRADITIONAL TEXT INDEXES;

DATA COMPRESSION;

EID: 37849029611     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_23     Document Type: Conference Paper

References (15)

1. Ferragina, P., Manzini, G.: Indexing compressed texts. J. of the ACM 52(4), 552-581 (2005)
2. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representation of sequences and full-text indexes. ACM Transactions on Algorithms, 2006. TR 2004-05, Technische Fakultät, Univ. Bielefeld, Germany (to appear)
3. 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)
4. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
5. Jacobson, G.: Space-efficient static trees and graphs. In: Proc. 30th FOCS, pp. 549-554 (1989)
6. Larsson, J., Moffat, A.: Off-line dictionary-based compression. Proc. IEEE 88(11), 1722-1732 (2000)
7. Mäkinen, V.: Compact suffix array - a space-efficient full-text index. Fundamenta Informaticae 56(1-2), 191-210 (2003)
8. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic J. of Computing 12(1), 40-66 (2005)
9. Mäkinen, V., Navarro, G., Sadakane, K.: Advantages of backward searching - efficient secondary memory and distributed implementation of compressed suffix arrays. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 681-692. Springer, Heidelberg (2004)
10. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. Computing 22(5), 935-948 (1993)
11. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. of the ACM 48(3), 407-430 (2001)
12. Navarro, G.: Indexing text using the Ziv-Lempel trie. J. of Discrete Algorithms 2(1), 87-114 (2004)
13. Navarro, G., Mäkinen, V.: Compressed full-text indexes. ACM Computing Surveys (to appear)
14. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. of Algorithms 48(2), 294-313 (2003)
15. Weiner, P.: Linear pattern matching algorithm. In: Proc. 14th IEEE Symp. on Switching and Automata Theory, pp. 1-11 (1973)