Genome compression: A novel approach for large collections

Bioinformatics

Volumn 29, Issue 20, 2013, Pages 2572-2578

  Deorowicz, Sebastian ^a   Danek, Agnieszka ^a   Grabowski, Szymon ^b  

^a SILESIAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b LODZ UNIVERSITY OF TECHNOLOGY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARABIDOPSIS; DNA SEQUENCE; GENETIC DATABASE; GENETICS; GENOMICS; HIGH THROUGHPUT SEQUENCING; HUMAN; HUMAN GENOME; INFORMATION PROCESSING; NUCLEOTIDE SEQUENCE; PLANT GENOME; PROCEDURES; ARTICLE; METHODOLOGY;

ALGORITHMS; ARABIDOPSIS; BASE SEQUENCE; DATA COMPRESSION; DATABASES, GENETIC; GENOME, HUMAN; GENOME, PLANT; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 84885611671     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt460     Document Type: Article

References (27)

1. The 1000 Genome Project Consortium. (2012) An integrated map of genetic variation from 1092 human genomes. Nature, 491, 56-65
2. Ball, M.P. et al. (2012) A public resource facilitating clinical use of genomes. Proc. Natl Acad. Sci. USA, 109, 11920-11927
3. Bonfield, J.K. and Mahoney, M.V. (2013) Compression of FASTQ and SAMformat sequencing data. PLoS One, 8, e59190
4. Cox, A.J. et al. (2012) Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform. Bioinformatics, 28, 1415-1419
5. Cao, M.D. et al. (2007) A simple statistical algorithm for biological sequence compression. In: Proceedings of the Data Compression Conference IEEE Computer Society Press. IEEE Computer Society, Washington, DC, USA, p. 4352
6. Christley, S. et al. (2009) Human genomes as email attachments. Bioinformatics, 25, 274-275
7. Claude, F. et al. (2010) Compressed q-gram indexing for highly repetitive biological sequences. In: Proceedings of the 10th IEEE Conference on Bioinformatics and Bioengineering. Philadelphia, Pennsylvania, USA, pp. 86-91
8. Danecek, P. et al. (2011) The variant call format and VCFtools. Bioinformatics, 27, 2156-2158
9. Deorowicz, S. and Grabowski, S. (2011) Robust relative compression of genomes with random access. Bioinformatics, 27, 2979-2986
10. Do, H.H. et al. (2012) Fast relative Lempel-Ziv self-index for similar sequences. In: Snoeyink, J. et al. (ed.) Proceedings of the Joint International Conference on Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (FAW-AAIM). Springer, Beijing, China, pp. 291-302
11. Gagie, T. et al. (2012)Afaster grammar-based self-index. In:Dediu, A.H. andMartín-Vide, C. (eds) Proceedings of the 6th International Conference on Language and Automata Theory and Applications. Springer, A Coruñ a, Spain, pp. 240-251
12. Gagie, T. et al. (2011) Faster approximate pattern matching in compressed repetitive texts. In: Asano, T. et al. (ed.) Proceedings of the 22nd International Symposium on Algorithms and Computation. Springer, Yokohama, Japan, pp. 653-662
13. Hach, F. et al. (2012) SCALCE: Boosting sequence compression algorithms using locally consistent encoding. Bioinformatics, 28, 3051-3057
14. Jones, D.C. et al. (2012) Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res., 40, e171
15. Kreft, S. and Navarro, G. (2013) On compressing and indexing repetitive sequences. Theor. Comput. Sci., 483, 115-133
16. Kuruppu, S. et al. (2011) Optimized relative Lempel-Ziv compression of genomes. In: Reynolds, M. (ed.) Proceedings of the ACSC Australasian Computer Science Conference. Australian Computer Society, Inc., Sydney, Australia, pp. 91-98
17. Levy, S. et al. (2007) The diploid genome sequence of an individual human. PLoS Biol., 5, e254
18. Mä kinen, V. et al. (2010) Storage and retrieval of highly repetitive sequence collections. J. Comput. Biol., 17, 281-308
19. Manzini, G. and Rastero, M. (2004) A simple and fast DNA compressor. Software Pract. Ex., 34, 1397-1411
20. Pavlichin, D. et al. (2013) The human genome contracts again. Bioinformatics, 29, 2199-2202
21. Pinho, A.J. et al. (2011) On the representability of complete genomes by multiple competing finite-context (Markov) models. PLoS One, 6, e21588
22. Pinho, A.J. et al. (2012) GReEn: A tool for efficient compression of genome resequencing data. Nucleic Acids Res., 40, e27
23. Popitsch, N. and von Haeseler, A. (2013) NGC: Lossless and lossy compression of aligned high-Throughput sequencing data. Nucleic Acids Res., 41, e27
24. Qiao, D. et al. (2012) Handling the data management needs of high-Throughput sequencing data: SpeedGene, a compression algorithm for the efficient storage of genetic data. BMC Bioinformatics, 13, 100
25. Salomon, D andMotta, G. (2010) Handbook of data compression. Springer, London
26. Storer, J.A. and Szymanski, T.G. (1982) Data compression via textual substitution. J. ACM, 29, 928-951
27. Wandelt, S. and Leser, U. (2012) Adaptive efficient compression of genomes. Algorithms Mol. Biol., 7, 30