Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform

Bioinformatics

Volumn 28, Issue 11, 2012, Pages 1415-1419

  Cox, Anthony J ^a   Bauer, Markus J ^a   Jakobi, Tobias ^b   Rosone, Giovanna ^c  

^a ILLUMINA INC   (United States)

^b BIELEFELD UNIVERSITY   (Germany)

^c UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER SIMULATION; DNA SEQUENCE; ESCHERICHIA COLI; GENETICS; GENOMICS; HUMAN; HUMAN GENOME; INFORMATION PROCESSING; METHODOLOGY; NUCLEIC ACID DATABASE;

ALGORITHMS; COMPUTER SIMULATION; DATA COMPRESSION; DATABASES, NUCLEIC ACID; ESCHERICHIA COLI; GENOME, HUMAN; GENOMICS; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 84861760100     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/bts173     Document Type: Article

References (22)

1. Adjeroh, D. et al. (2008) The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. 1st edn. Springer Publishing Company Inc.
2. Bauer, M.J. et al. (2011) Lightweight BWTconstruction for very large string collections. In CPM 2011. Vol. 6661 of LNCS, Springer, pp. 219-231.
3. Bauer, M.J. Cox , A.J. Rosone ,G.(2013) Lightweight algorithms for constructing and inverting the BWT of string collections. Theoretical Computer Science,483(134-148), 10.1016/j.tcs.2012.02.002
4. Burrows, M. and Wheeler, D.J. (1994) A block sorting data compression algorithm. Technical Report 124. DIGITAL System Research Center.
5. Chen, X. et al. (2002) DNACompress: fast and effective DNA sequence compression. Bioinformatics, 18, 1696-1698.
6. Deorowicz, S. and Grabowski, S. (2011) Compression of genomic sequences in FASTQ format. Bioinformatics, 27, 860-862.
7. Dewey, F.E. et al. (2011) Phased whole-genome genetic risk in a family quartet using a major allele reference sequence. PLoS Genet., 7, e1002280.
8. Ferragina, P. and Manzini, G. (2000) Opportunistic data structures with applications. In Proceedings of the 41st Annual Symposium on Foundations of Computer Science. IEEE Computer Society, Washington, DC, USA, pp. 390-398.
9. Ferragina, P. and Manzini, G. (2005) Indexing compressed text. J. ACM, 52, 552-581.
10. Ferragina, P. et al. (2007) Compressed representations of sequences and full-text indexes. ACM Trans. Algor., 3(2), Article 20.
11. Fritz, M.H. et al. (2011) Efficient storage of high throughput DNAsequencing data using reference-based compression. Genome Res., 21, 734-740.
12. Giancarlo, R. et al. (2009) Textual data compression in computational biology: a synopsis. Bioinformatics, 25, 1575-1586.
13. Grumbach, S. and Tahi, F. (1994) A new challenge for compression algorithms: genetic sequences. Inf. Process. Manage., 30, 875-886.
14. Kozanitis, C. et al. (2010) Compressing genomic sequence fragments using SlimGene. In RECOMB. Vol. 6044 of LNCS, Springer, pp. 310-324.
15. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760.
16. Mantaci, S. et al. (2005) An extension of the Burrows Wheeler transform and applications to sequence comparison and data compression. In CPM 2005. Vol. 3537 of LNCS, Springer, pp. 178-189.
17. Milosavljevic, A. and Jurka, J. (1993) Discovering simple DNA sequences by the algorithmic significance method. Comput. Appl. Biosci. CABIOS, 9, 407-411.
18. Rivals, E. et al. (1996) Compression and genetic sequence analysis. Biochimie, 78, 315-322.
19. Simpson, J.T. and Durbin, R. (2010) Efficient construction of an assembly string graph using the FM-index. Bioinformatics, 26, i367-i373.
20. Simpson, J.T. and Durbin, R. (2012) Efficient de novo assembly of large genomes using compressed data structures. Genome Res, 22, 549-556.
21. Tembe, W. et al. (2010) G-SQZ: compact encoding of genomic sequence and quality data. Bioinformatics, 26, 2192-2194.
22. Yanovsky, V. (2011) ReCoil - an algorithm for compression of extremely large datasets of DNA data. Algor. Mol. Biol., 6, 23.