Run-length compressed indexes are superior for highly repetitive sequence collections

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

Volumn 5280 LNCS, Issue , 2008, Pages 164-175

  Sirén, Jouni ^a   Välimäki, Niko ^a   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

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS; ENTROPY;

BASE SEQUENCES; CURRENT STRUCTURE; GENOME SEQUENCES; RUN-LENGTH ENCODING; SMALL VARIATIONS; SPACE EFFICIENT; STATE OF THE ART; VERSION CONTROL; BURROWS;

INFORMATION RETRIEVAL;

EID: 85041128864     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-89097-3_17     Document Type: Conference Paper

References (25)

1. Arroyuelo, D., Navarro, G., Sadakane, K.: Reducing the space requirement of LZ- index. In: Lewenstein, M., Valiente, G. (eds.) CPM 2006. LNCS, vol. 4009, pp. 318-329. Springer, Heidelberg (2006)
2. Burrows, M., Wheeler, D.: A block sorting lossless data compression algorithm. Technical Report Technical Report 124, Digital Equipment Corporation (1994)
3. Church, G.M.: Genomes for all. Scientific American 294(1), 47-54 (2006)
4. Ferragina, P., Giancarlo, R., Manzini, G.: 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)
5. Ferragina., P., Manzini, G.: Indexing compressed texts. J. of the ACM 52(4), 552-581 (2005)
6. Ferragina, P., Manzini, G., Mäkinen, V., Navarro, G.: Compressed representations of sequences and full-text indexes. ACM TALG 3(2) article 20 (2007)
7. Fischer, J., Mäkinen, V., Navarro, G.: An(other) entropy-bounded compressed suffix tree. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 152-165. Springer, Heidelberg (2008)
8. Grossi, R., Gupta, A., Vitter, J.: High-order entropy-compressed text indexes. In: Proc. 14th SODA, pp. 841-850 (2003)
9. Grossi, R., Vitter, J.: Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. on Computing 35(2), 378-407 (2006)
10. Gupta, A., Hon, W.-K., Shah, R., Vitter, J.S.: Compressed data structures: Dictionaries and data-aware measures. In: Proc. 16th DCC, pp. 213-222 (2006)
11. Gusfleld, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)
12. Hall, N.: Advanced sequencing technologies and their wider impact in microbiology. The Journal of Experimental Biology 209, 1518-1525 (2007)
13. Kärkkäinen, J.: Repetition-based text indexes. Technical Report A-1999-4, Department of Computer Science, University of Helsinki, Finland (1999)
14. Mäkinen, V., Navarro, G.: Succinct suffix arrays based on run-length encoding. Nordic Journal of Computing 12(1), 40-66 (2005)
15. 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, vol. 3341, pp. 681-692. Springer, Heidelberg (2004)
16. Mäkinen, V., Navarro, G., Sirén, J., Välimäki, N.: Run-length compressed indexes for repetitive sequence collections. Technical Report C-2008-42, Department of Computer Science, University of Helsinki, Finland (2008)
17. Manber, U., Myers, G.: Suffix arrays: a new method for on-line string searches. SIAM J. on Computing 22(5), 935-948 (1993)
18. Manzini, G.: An analysis of the Burrows-Wheeler transform. J. of the ACM 48(3), 407-430 (2001)
19. Navarro, G.: Indexing text using the ziv-lempel trie. J. of Discrete Algorithms (JDA) 2(1), 87-114 (2004)
20. Navarro, G., Makinen, V.: Compressed full-text indexes. ACM Computing Surveys 39(1) article 2 (2007)
21. Pennisi, E.: Breakthrough of the year: Human genetic variation. Science 21, 1842-1843 (2007)
22. Russo, L., Navarro, G., Oliveira, A.: Dynamic fully-compressed suffix trees. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 191-203. Springer, Heidelberg (2008)
23. Russo, L., Navarro, G., Oliveira, A.: Fully-compressed suffix trees. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 362-373. Springer, Heidelberg (2008)
24. Sadakane, K.: New text indexing functionalities of the compressed suffix arrays. J. of Algorithms 48(2), 294-313 (2003)
25. Sadakane, K.: Compressed suffix trees with full functionality. Theory of Computing Systems 41(4), 589-607 (2007)