Transformations for the compression of fastq quality scores of next-generation sequencing data

Bioinformatics

Volumn 28, Issue 5, 2012, Pages 628-635

  Wan, Raymond ^a,b   Anh, Vo Ngoc ^c   Asai, Kiyoshi ^a,b  

^a UNIVERSITY OF TOKYO   (Japan)

^b NATIONAL INSTITUTE OF ADVANCED INDUSTRIAL SCIENCE AND TECHNOLOGY AIST   (Japan)

^c UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; COMPUTER PROGRAM; DNA SEQUENCE; ECONOMICS; INFORMATION PROCESSING; METHODOLOGY;

DATA COMPRESSION; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 84857848401     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btr689     Document Type: Article

References (20)

1. Blankenberg,D. et al. (2010) Manipulation of FASTQ data with Galaxy. Bioinformatics, 26, 1783-1785.
2. Cock, P.J.A., Fields, C.J., et al. (2010). The Sanger FASTQ file format for sequences with quality scores, and the Solexa/Illumina FASTQ variants. Nucleic Acids Res., 38, 1767-1771.
3. Daily,K. et al. (2010) Data structures and compression algorithms for high-throughput sequencing technologies. BMC Bioinformatics, 11, 514.
4. Deorowicz,S. and Grabowski,S. (2011) Compression of genomic sequences in FASTQ format. Bioinformatics, 27, 860-862.
5. Ewing,B. and Green,P. (1998) Base-calling of automated sequencer traces using Phred. II. error probabilities. Genome Res., 8, 186-194.
6. Gallager,R. and van Voorhis,D. (1975) Optimal source codes for geometrically distributed integer alphabets. IEEE Trans. Informat. Theory, 21, 228-230.
7. Giancarlo,R. et al. (2009) Textual data compression in computational biology: a synopsis. Bioinformatics, 25, 1575-1586.
8. Golomb,S.W. (1966) Run-length encodings. IEEE Trans. Informat. Theory, 12, 399-401.
9. Hsi-Yang Fritz,M. et al. (2011) Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome Res., 21, 734-740.
10. Huffman,D.A. (1952) A method for the construction of minimum-redundancy codes. Proc. Inst. Radio Eng., 40, 1098-1101.
11. Kozanitis,C. et al. (2011) Compressing genomic sequence fragments using SlimGene. J. Comput. Biol., 18, 401-413.
12. Leinonen,R. et al. (2011) The Sequence Read Archive. Nucleic Acids Res., 39, D19-D21.
13. Li,H. et al. (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
14. Moffat,A. and Stuiver,L. (2000) Binary interpolative coding for effective index compression. Inform. Retr., 3, 25-47.
15. Moffat,A. and Turpin,A. (2002) Compression and Coding Algorithms. Kluwer Academic Publishers, Norwell, MA, USA.
16. Rice,R.F. (1979) Some practical universal noiseless coding techniques. Technical Report 79-22, Jet Propulsion Laboratory, Pasadena, California.
17. Tembe,W. et al. (2010) G-SQZ: compact encoding of genomic sequence and quality data. Bioinformatics, 26, 2192-2194.
18. Wan,R. and Asai,K. (2010) Sorting next generation sequencing data improves compression effectiveness. In Proceedings of the 2010 IEEE International Conference on Bioinformatics and Biomedicine (BIBM)-Workshops and Posters. Hong Kong, China, pp. 567-572.
19. Witten,I.H. et al. (1994). Semantic and generative models for lossy text compression. Comput. J., 37, 83-87.
20. Ziv,J. and Lempel,A. (1977) A universal algorithm for sequential data compression. IEEE Trans. Inform. Theory, 23, 337-343.