Storage and retrieval of highly repetitive sequence collections

Journal of Computational Biology

Volumn 17, Issue 3, 2010, Pages 281-308

  Mäkinen, Veli ^a   Navarro, Gonzalo ^b   Sirén, Jouni ^a   Välimäki, Niko ^a  

^a UNIVERSITY OF HELSINKI   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

Comparative genomics; Compressed data structures; Full text indexing; Suffix tree

Indexed keywords

BIOLOGY; CONFERENCE PAPER; GENETICS; HUMAN; INFORMATION RETRIEVAL; METHODOLOGY; MUTATION; NUCLEOTIDE REPEAT; NUCLEOTIDE SEQUENCE; TIME;

BASE SEQUENCE; COMPUTATIONAL BIOLOGY; HUMANS; INFORMATION STORAGE AND RETRIEVAL; MUTATION; REPETITIVE SEQUENCES, NUCLEIC ACID; TIME FACTORS;

EID: 77950788830     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2009.0169     Document Type: Conference Paper

References (43)

1. Apostolico, A. 1985. The myriad virtues of subword trees, 85-96. Combinatorial Algorithms on Words. NATO ISI Series. Springer-Verlag, New York.
2. Blanford, D., and Blelloch, G. 2004. Compact representations of ordered sets. Proc. 15th Annu. ACM-SIAM Symp. Discrete Algorithms 11-19.
3. Burrows, M., and Wheeler, D. 1994. A block sorting lossless data compression algorithm [Technical Report 124]. Digital Equipment Corporation, Waltham, MA.
4. Chan, H.-L., Hon, W.-K., Lam, T.-W., et al. 2007. Compressed indexes for dynamic text collections. ACM Trans. Algorithms 3, 2.
5. Church, G.M. 2006. Genomes for all. Sci. Am. 294, 47-54.
6. Cover, T., and Thomas, J. 1991. Elements of Information Theory. Wiley, New York.
7. Elias, P. 1975. Universāl codeword sets and representations of the integers. IEEE Trans. Inform. Theory 21, 194-203.
8. Ferragina, P., and Manzini, G. 2005. Indexing compressed texts. J. ACM 52, 552-581.
9. Ferragina, P., Manzini, G., Mäkinen, V., et al. 2007. Compressed representations of sequences and full-text indexes. ACM Trans. Algorithms 3, 2. (Pubitemid 46896790)
10. Fischer, J., Mäkinen, V., and Navarro, G. 2008. An(other) entropy-bounded compressed suffix tree. Lect. Notes Comput. Sci. 5029, 152-165.
11. Giancarlo, R., Scaturro, D., and Utro, F. 2009. Textual data compression in computational biology: a synopsis. Bioinformatics (advance access).
12. González, R., and Navarro, G. 2008. Improved dynamic rank-select entropy-bound structures. Lect. Notes Comput. Sci. 4957, 374-386. (Pubitemid 351632203)
13. Grossi, R., and Vitter, J. 2006. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. SIAM J. Comput. 35, 378-407.
14. Grossi, R., Gupta, A., and Vitter, J. 2003. High-order entropy-compressed text indexes. Proc. 14th Annu. ACM-SIAM Symp. Discrete Algorithms 841-850.
15. Grümbach, S., and Tahi, F. 1993. Compression of DNA sequences. Proc. 13th Data Compression Conf. 340-350.
16. Grümbach, S., and Tahi, F. 1994. A new challenge for compression algorithms: genetic sequences. Inform. Process. Manage. 30, 875-886. (Pubitemid 124012808)
17. Gupta, A. Hon, W.-K., Shah, R., et al. 2006. Compressed data structures: dictionaries and data-aware measures. Proc. 16th Data Compression Conf. 213-222. (Pubitemid 47633447)
18. Gusfield, D. 1997. Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York.
19. Hall, N. 2007. Advanced sequencing technologies and their wider impact in microbiology. J. Exp. Biol. 209, 1518-1525. (Pubitemid 46841957)
20. Hon, W.-K., Lam, T.-W., Sadakane, K., et al. 2007. A space and time efficient algorithm for constructing compressed suffix arrays. Algorithmica 48, 23-36. (Pubitemid 47136627)
21. Kaplan, H. 2005. Handbook of Data Structures and Applications. Chapman & Hall, New York.
22. Karlin, S., Ghandour, G., Ost, F., et al. 1983. New approaches for computer analysis of nucleic acid sequences. Proc. Natl. Acad. Sci. USA 80, 5660-5664. (Pubitemid 14249887)
23. Lam, T. W., Sung, W. K., Tam, S. L., et al. 2008. Compressed indexing and local alignment of DNA. Bioinformatics 24, 791-797.
24. Langmead, B., Trapnell, C., Pop, M., et al. 2009. Ultrafast and memory-efficient alignment of short dna sequences to the human genome. Genome Biol. 10, R25.
25. Lee, S., and Park, K. 2007. Dynamic rank-select structures with applications to run-length encoded texts. Proc. 19th Annu. Symp. Combin. Pattern Match. 95-106.
26. Levenshtein, V. I. 1966. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 10, 707-710.
27. Li, H., and Durbin, R. 2009. Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics 25, 1754-1760.
28. Mäkinen, V., and Navarro, G. 2005. Succinct suffix arrays based on run-length encoding. Nordic J. Comput. 12, 40-66. (Pubitemid 41422513)
29. Mäkinen, V., and Navarro, G. 2008. Dynamic entropy-compressed sequences and full-text indexes. ACM Trans. Algorithms 4, 32. (Pubitemid 44071996)
30. Mäkinen, V., Navarro, G., and Sadakane, K. 2004. Advantages of backward searching-efficient secondary memory and distributed implementation of compressed suffix arrays. Lect. Notes Comput. Sci. 3341, 681-692. (Pubitemid 39745117)
31. Mäkinen, V., and Navarro, G. 2007. Implicit compression boosting with applications to self-indexing. Lect. Notes Comput. Sci. 4726, 214-226.
32. Manber, U., and Myers, G. 1993. Suffix arrays: a new method for on-line string searches. SIAM J. Comput. 22, 935-948.
33. Manzini, G. 2001. An analysis of the Burrows-Wheeler transform. J. ACM 48, 407-430.
34. Navarro, G., and Mäkinen, V. 2007. Compressed full-text indexes. ACM Comput. Surv. 39, 2. (Pubitemid 46572787)
35. Overmars, M. H. 1981. Searching in the past, I. [Technical Report RUU-CS-81-7]. Department of Computer Science, University of Utrecht, The Netherlands.
36. Pagh, R. 2001. Low redundancy in static dictionaries with constant query time. SIAM J. Comput. 31, 353-363. (Pubitemid 33782954)
37. Pennisi, E. 2007. Breakthrough of the year: human genetic variation. Science 21, 1842-1843.
38. Raman, R., Raman, V., and Rao, S. 2002. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets. Proc. 13th Annu. ACM-SIAM Symp. Discrete Algorithms 233-242.
39. Russo, L., Navarro, G., and Oliveira, A. 2008a. Fully-compressed suffix trees. Lect. Notes Comput. Sci. 4957, 362-373. (Pubitemid 351632202)
40. Russo, L., Navarro, G., and Oliveira, A. 2008b. Dynamic fully-compressed suffix trees. Lect. Notes Comput. Sci. 5029, 191-203.
41. Sadakane, K. 2003. New text indexing functionalities of the compressed suffix arrays. J. Algorithms 48, 294-313.
42. Sadakane, K. 2007. Compressed suffix trees with full functionality. Theory Comput. Syst. 41, 589-607.
43. Sirén, J. 2009. Compressed suffix arrays for massive data. Proc. 16th SPIRE. Springer LNLS 5721, 63-74.