Compressed q-gram indexing for highly repetitive biological sequences

10th IEEE International Conference on Bioinformatics and Bioengineering 2010, BIBE 2010

Volumn , Issue , 2010, Pages 86-91

  Claude, Francisco ^a   Fariña, Antonio ^b   Martínez Prieto, Miguel A ^c   Navarro, Gonzalo ^d  

^a UNIVERSITY OF WATERLOO   (Canada)

^b UNIVERSITY OF A CORUÑA   (Spain)

^c UNIVERSITY OF VALLADOLID   (Spain)

^d UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES; FAST SEARCH; INDIVIDUAL SEQUENCES; NOVEL TECHNIQUES; Q-GRAMS; STORAGE SCHEMES; SUB-STRINGS;

SPREADSHEETS;

BIOINFORMATICS;

EID: 77956153823     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBE.2010.22     Document Type: Conference Paper

References (25)

1. G. M. Church, "Genomes for ALL," Scientific American, vol. 294, no. 1, pp. 47-54, 2006.
2. N. Hall, "Advanced sequencing technologies and their wider impact in microbiology," The J. of Exp. Biology, vol. 209, pp. 1518-1525, 2007.
3. E. Pennisi, "Breakthrough of the year: Human genetic variation," Science, vol. 21, pp. 1842-1843, Dec. 2007.
4. C. G. Nevill-Manning and I. H. Witten, "Protein is incompressible," in Proc. DCC, 1999, p. 257.
5. X. Chen, S. Kwong, and M. Li, "A compression algorithm for DNA sequences and its applications in genome comparison," in Proc. RECOMB, 2000, p. 107.
6. S. Grümbach and F. Tahi, "A new challenge for compression algorithms: Genetic sequences," Inf. Proc. Manag., vol. 30, no. 6, pp. 875-886, 1994.
7. E. Rivals, J.-P. Delahaye, M. Dauchet, and O. Delgrange, "A guaranteed compression scheme for repetitive DNA sequences," in Proc. DCC, 1996, p. 453.
8. H. Sato, T. Yoshioka, A. Konagaya, and T. Toyoda, "DNA data compression in the post genome era," Genome Inf., vol. 12, pp. 512-514, 2001.
9. S. Kuruppu, B. Beresford-Smith, T. Conway, and J. Zobel, "Repetition-based compression of large DNA datasets," in Proc. RECOMB, 2009, poster.
10. V. Mäkinen, G. Navarro, J. Sirén, and N. Välimäki, "Storage and retrieval of individual genomes," in Proc. RECOMB, ser. LNCS 5541, 2009, pp. 121-137.
11. S. Puglisi, W. Smyth, and A. Turpin, "Inverted files versus suffix arrays for locating patterns in primary memory," in Proc. SPIRE, ser. LNCS 4209, 2006, pp. 122-133.
12. J. Larsson and A. Moffat, "Off-line dictionary-based compression," Proc. of the IEEE, vol. 88, no. 11, pp. 1722-1732, 2000.
13. J. Ziv and A. Lempel, "A universal algorithm for sequential data compression," IEEE Trans. Inf. Theo., vol. 23, no. 3, pp. 337-343, 1977.
14. F. Claude and G. Navarro, "Self-indexed text compression using straight-line programs," in Proc. MFCS, ser. LNCS 5734, 2009, pp. 235-246.
15. R. N. Horspool, "Practical fast searching in strings," Soft. Pract. Exper., vol. 10, no. 6, pp. 501-506, 1980.
16. I. Witten, A. Moffat, and T. Bell, Managing Gigabytes, 2nd ed. Morgan Kaufmann, 1999.
17. G. Zipf, Human Behaviour and the Principle of Least Effort. Addison-Wesley, 1949.
18. H. Williams and J. Zobel, "Compressing integers for fast file access," The Computer J., vol. 42, no. 3, pp. 193-201, 1999.
19. G. Navarro and V. Mäkinen, "Compressed full-text indexes," ACM Comp. Surv., vol. 39, no. 1, p. article 2, 2007.
20. J. Munro, R. Raman, V. Raman, and S. S. Rao, "Succinct representations of permutations," in Proc. ICALP, ser. LNCS 2719, 2003, pp. 345-356.
21. F. Claude and G. Navarro, "Practical rank/select queries over arbitrary sequences," in Proc. SPIRE, ser. LNCS 5280, 2008, pp. 176-187.
22. H. Sakamoto, "A fully linear-time approximation algorithm for grammar-based compression," J. Discr. Algor., vol. 3, pp. 416-430, 2005.
23. M. Cao, T. Dix, L. Allison, and C. Mears, "A simple statistical algorithm for biological sequence compression," in Proc. DCC, 2007, pp. 43-52.
24. G. Manzini and M. Rastrero, "A simple and fast DNA compression algorithm," Soft. Pract. Exper., vol. 34, pp. 1397-1411, 2004.
25. R. González and G. Navarro, "Compressed text indexes with fast locate," in Proc. CPM, ser. LNCS 4580, 2007, pp. 216-227.