BLESS: Bloom filter-based error correction solution for high-throughput sequencing reads

Bioinformatics

Volumn 30, Issue 10, 2014, Pages 1354-1362

  Heo, Yun ^a   Wu, Xiao Long ^a   Chen, Deming ^a   Ma, Jian ^a,b   Hwu, Wen Mei ^a  

^a University of Illinois at Urbana Champaign   (United States)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; DNA SEQUENCE; HIGH THROUGHPUT SEQUENCING; HUMAN; LABORATORY AUTOMATION; LABORATORY DIAGNOSIS; METHODOLOGY;

ALGORITHMS; AUTOMATION, LABORATORY; FALSE POSITIVE REACTIONS; HIGH-THROUGHPUT NUCLEOTIDE SEQUENCING; HUMANS; SEQUENCE ANALYSIS, DNA;

EID: 84900802154     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btu030     Document Type: Article

References (51)

1. Beerenwinkel, N. and Zagordi, O. (2011) Ultra-deep sequencing for the analysis of viral populations. Curr. Opin. Virol., 1, 413-418
2. Bloom, B. (1970) Space/time trade-offs in hash coding with allowable errors. Commun. ACM, 13, 422-426
3. Chaisson, M. et al. (2009) De novo fragment assembly with short mate-paired reads: Does the read length matter?. Genome Res., 19, 336-346
4. Chikhi, R. and Medvedev, P. (2014) Informed and automated k-mer size selection for genome assembly. Bioinformatics, 30, 31-37
5. Deorowicz, S. et al. (2013) Disk-based k-mer counting on a PC. BMC Bioinformatics, 14, 160
6. Dohm, J. et al. (2008) Substantial biases in ultra-short read data sets from highthroughput DNA sequencing. Nucleic Acids Res., 36, e105
7. Durbin, R. et al. (2010) A map of human genome variation from population-scale sequencing. Nature, 467, 1061-1073
8. Earl, D. et al. (2011) Assemblathon 1: A competitive assessment of De novo short read assembly methods. Genome Res., 21, 2224-2241
9. Fan, L. et al. (2000) Summary cache: A scalable wide-Area web cache sharing protocol. IEEE/ACM Trans. Netw., 8, 281-293
10. Frazer, K. (2012) Decoding the human genome. Genome Res., 22, 1599-1601
11. Haussler, D. et al. (2009) Genome 10K: A proposal to obtain whole-genome sequence for 10 000 vertebrate species. J. Hered., 100, 659-674
12. Ilie, L. et al. (2011) HiTEC: Accurate error correction in high-Throughput sequencing data. Bioinformatics, 27, 295-302
13. Jiang, R. et al. (2009) Population genetic inference from resequencing data. Genetics, 181, 187-197
14. Kao, W.-C. et al. (2011) ECHO: A reference-free short-read error correction algorithm. Genome Res., 21, 1181-1192
15. Kelley, D. et al. (2010) Quake: Quality-Aware detection and correction of sequencing errors. Genome Biol., 11, R116
16. Langmead, B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25-R10
17. Le, H.-S.et al. 2013 Probabilistic error correction for RNA sequencing Nucleic Acids Res. 41 e109
18. Li, H. and Durbin, R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760
19. Li, R. et al. (2010) De novo assembly of human genomes with massively parallel short read sequencing. Genome Res., 20, 265-272
20. Liu, Y. et al. (2011) DecGPU: Distributed error correction on massively parallel graphics processing units using CUDA and MPI. BMC Bioinformatics, 12, 85
21. Liu, Y. et al. (2013) Musket: A multistage k-mer spectrum-based error corrector for Illumina sequence data. Bioinformatics, 29, 308-315
22. Loman, N. et al. (2012) Performance comparison of benchtop high-Throughput sequencing platforms. Nat. Biotechnol., 30, 434-439
23. Marçais, G. and Kingsford, C. (2011) A fast, lock-free approach for efficient parallel counting of occurrences of k-mers. Bioinformatics, 27, 764-770
24. Medvedev, P. et al. (2011) Error correction of high-Throughput sequencing datasets with non-uniform coverage. Bioinformatics, 27, i137-i141
25. Melsted, P. and Pritchard, J. (2011) Efficient counting of k-mers in DNA sequences using a bloom filter. BMC Bioinformatics, 12, 333
26. Metzker, M. (2009) Sequencing technologies-The next generation. Nat. Rev. Genet., 11, 31-46
27. Pevzner, P. et al. (2001) An Eulerian path approach to DNA fragment assembly. Proc. Natl Acad. Sci. USA, 98, 9748-9753
28. Prosperi, M. et al. (2013) Empirical validation of viral quasispecies assembly algorithms: State-of-The-Art and challenges. Sci. Rep., 3, http://www.nature.com/srep/ 2013/131003/srep02837/full/srep02837.html. (8 February 2014, date last accessed
29. Qu, W. et al. (2009) Efficient frequency-based De novo short-read clustering for error trimming in next-generation sequencing. Genome Res., 19, 1309-1315
30. Rizk, G. et al. (2013) DSK: K-mer counting with very low memory usage. Bioinformatics, 29, 652-653
31. Roy, R et al. (2013) Turtle: Identifying frequent k-mers with cache-efficient algorithms, [arXiv:1305.1861v1, 2013].
32. Salmela, L. (2010) Correction of sequencing errors in a mixed set of reads. Bioinformatics, 26, 1284-1290
33. Salmela, L. and Schröder, J. (2011) Correcting errors in short reads by multiple alignments. Bioinformatics, 27, 1455-1461
34. Salzberg, S. et al. (2012) GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Res., 22, 557-567
35. Schirmer, M. et al. (2012) Benchmarking of viral haplotype reconstruction programmes: An overview of the capacities and limitations of currently available programmes. Brief. Bioinform [Epub ahead of print, Dec 19, 2013].
36. Schröder, J. et al. (2009) SHREC: A short-read error correction method. Bioinformatics, 25, 2157-2163
37. Shah, A.R. et al. (2012) A parallel algorithm for spectrum-based short read error correction. In: Parallel & Distributed Processing Symposium (IPDPS), 2012 IEEE 26th International. pp. 60-70
38. Shi, H. et al. (2009) Accelerating error correction in high-Throughput short-read DNA sequencing data with CUDA. In: Parallel & Distributed Processing, 2009. IPDPS 2009. IEEE International Symposium on. IEEE, pp. 1-8
39. Shi, H. et al. (2010a) A parallel algorithm for error correction in high-Throughput shortread data on CUDA-enabled graphics hardware. J. Comput. Biol., 17, 603-615
40. Shi, H. et al. (2010b) Quality-score guided error correction for short-read sequencing data using CUDA. Procedia Comput. Sci., 1, 1129-1138
41. Simpson, J. and Durbin, R. (2012) Efficient De novo assembly of large genomes using compressed data structures. Genome Res., 22, 549-556
42. Wang, X. et al. (2012) Estimation of sequencing error rates in short reads. BMC Bioinformatics, 13, 185
43. Wijaya, E. et al. (2009) Recount: Expectation maximization based error correction tool for next generation sequencing data. Genome Inform., 23, 189-201
44. Yang, X. (2011) Error correction and clustering algorithms for next generation sequencing. In: Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW), 2011 IEEE International Symposium on. pp. 2101-2104
45. Yang, X. et al. (2011) Repeat-Aware modeling and correction of short read errors. BMC Bioinformatics, 12, 1-10
46. Yang, X. et al. (2012) A survey of error-correction methods for next-generation sequencing. Brief. Bioinform [Epub ahead of print].
47. Yang, X. et al. (2010) Reptile: Representative tiling for short read error correction. Bioinformatics, 26, 2526-2533
48. Yin, X. et al. (2013) PREMIER-PRobabilistic Error-correction using Markov Inference in Errored Reads. arXiv, 2013, 1302.0212
49. Zerbino, D. and Birney, E. (2008) Velvet: Algorithms for De novo short read assembly using De Bruijn graphs. Genome Res., 18, 821-829
50. Zhao, Z. et al. (2011a) An efficient hybrid approach to correcting errors in short reads. In: Torra, V. et al. (ed.) Modeling Decision for Artificial Intelligence. Springer, Berlin Heidelberg, pp. 198-210
51. Zhao, Z. et al. (2011b) PSAEC: An Improved Algorithm for Short Read Error Correction Using Partial Suffix Arrays. In: Proceedings of the 5th Joint International Frontiers in Algorithmics, and 7th International Conference on Algorithmic Aspects in Information and Management. Springer-Verlag, Jinhua, China, pp. 220-232.