Adaptive reference-free compression of sequence quality scores

Bioinformatics

Volumn 30, Issue 1, 2014, Pages 24-30

  Janin, Lilian ^a   Rosone, Giovanna ^a,b   Cox, Anthony J ^a  

^a ILLUMINA INC   (United States)

^b UNIVERSITY OF PALERMO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ANIMAL; ARTICLE; CAENORHABDITIS ELEGANS; DNA SEQUENCE; GENOME; GENOMICS; HIGH THROUGHPUT SEQUENCING; HUMAN; INFORMATION PROCESSING; METAGENOMICS; METHODOLOGY; PROCEDURES;

ALGORITHMS; ANIMALS; CAENORHABDITIS ELEGANS; DATA COMPRESSION; GENOME; GENOMICS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; METAGENOMICS; SEQUENCE ANALYSIS, DNA;

EID: 84891350227     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btt257     Document Type: Article

References (30)

1. Adjeroh, D. et al. (2008) The Burrows-Wheeler Transform: Data Compression, Suffix Arrays, and Pattern Matching. 1st edn. Springer Publishing Company.
2. Ander, C. et al. (2013) metaBEETL: high-throughput analysis of heterogeneous microbial populations from shotgun DNA sequences. BMC Bioinformatics, 14 (Suppl. 5), S2.
3. Bauer, M.J. et al. (2011) Lightweight BWT construction for very large string collections. In: CPM 2011, volume 6661 of LNCS. Springer, Berlin, Heidelberg, pp. 219-231.
4. Bauer, M.J. et al. (2012) Lightweight LCP construction for next-generation sequencing datasets. In: WABI 2012, volume 7534 LNBI of LNCS. Springer, Berlin, Heidelberg, pp. 326-337.
5. Bauer, M.J. et al. (2013) Lightweight algorithms for constructing and inverting the BWT of string collections. Theor. Comput. Sci., 483, 134-148.
6. Bonfield, J.K. and Mahoney, M.V. (2013) Compression of FASTQ and SAMformat sequencing data. PLoS One, 8, e59190.
7. Bonfield, J.K. and Staden, R. (1995) The application of numerical estimates of base calling accuracy to DNA sequencing projects. Nucleic Acids Res., 23, 1406-1410.
8. Burrows, M. and Wheeler, D.J. (1994) A block sorting data compression algorithm. Technical report. DIGITAL System Research Center.
9. Cock, P.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.
10. Cox, A. et al. (2012a) Large-scale compression of genomic sequence databases with the Burrows-Wheeler transform. Bioinformatics, 28, 1415-1419.
11. Cox, A.J. et al. (2012b) Comparing DNA sequence collections by direct comparison of compressed text indexes. In: WABI 2012.volume 7534 of LNBI. Springer, Berlin, Heidelberg, pp. 214-224.
12. DePristo, M.A. et al. (2011) A framework for variation discovery and genotyping using next-generation DNA sequencing data. Nat. Genet., 43, 491-498.
13. Epifanio, C. et al. (2011) Novel Combinatorial and Information-Theoretic Alignment-Free Distances for Biological Data Mining. John Wiley & Sons, Inc., pp. 321-359.
14. Ewing, B. and Green, P. (1998) Base-calling of automated sequencer traces using Phred. II. error probabilities. Genome Res., 8, 186-194.
15. Fritz, M.H. et al. (2011) Efficient storage of high throughput DNA sequencing data using reference-based compression. Genome Res., 21, 734-740.
16. Hach, F. et al. (2012) SCALCE: boosting sequence compression algorithms using locally consistent encoding. Bioinformatics, 28, 3051-3057.
17. Ilie, L. et al. (2011) HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics, 27, 295-302.
18. Jones, D.C. et al. (2012) Compression of next-generation sequencing reads aided by highly efficient de novo assembly. Nucleic Acids Res., 40, e171.
19. Kozanitis, C. et al. (2010) Compressing genomic sequence fragments using SlimGene. In: RECOMB.volume 6044 of LNCS. Springer, Berlin, Heidelberg, pp. 310-324.
20. Li, H. (2012) Exploring single-sample SNP and INDEL calling with whole-genome de novo assembly. Bioinformatics, 28, 1838-1844.
21. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760.
22. Li, H. et al. (2008) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
23. Manzini, G. (2001) An analysis of the Burrows-Wheeler transform. J. ACM, 48, 407-430.
24. Marth, G.T. et al. (1999) A general approach to single-nucleotide polymorphism discovery. Nat. Genet., 23, 452-456.
25. Restivo, A. and Rosone, G. (2011) Balancing and clustering of words in the Burrows-Wheeler transform. Theor. Comput. Sci., 412, 3019-3032.
26. Shannon, C.E. (1948) A mathematical theory of communication. Bell Syst. Tech.ical J., 27, 379-423, 623-656.
27. Simpson, J.T. and Durbin, R. (2012) Efficient de novo assembly of large genomes using compressed data structures. Genome Res., 22, 549-556.
28. Smith, A. et al. (2008) Using quality scores and longer reads improves accuracy of Solexa read mapping. BMC Bioinformatics, 9, 128.
29. Wan, R. et al. (2012) Transformations for the compression of FASTQ quality scores of next-generation sequencing data. Bioinformatics, 28, 628-635.
30. Yang, X. et al. (2013) A survey of error-correction methods for next-generation sequencing. Brief. Bioinform., 14, 56-66.