ECHO: A reference-free short-read error correction algorithm

Genome Research

Volumn 21, Issue 7, 2011, Pages 1181-1192

  Kao, Wei Chun ^a   Chan, Andrew H ^a   Song, Yun S ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; CONTROLLED STUDY; DIPLOIDY; ECHO ALGORITHM; ERROR; GENE SEQUENCE; GENETIC MODEL; HETEROZYGOSITY; NONHUMAN; PRIORITY JOURNAL; STATISTICAL MODEL; YEAST;

ALGORITHMS; ANIMALS; BACTERIOPHAGE PHI X 174; COMPUTATIONAL BIOLOGY; DATABASES, GENETIC; DIPLOIDY; DROSOPHILA; GENOME; HAPLOIDY; HUMANS; MODELS, STATISTICAL; RESEARCH DESIGN; SACCHAROMYCES CEREVISIAE; SEQUENCE ALIGNMENT; SEQUENCE ANALYSIS, DNA; SOFTWARE; TIME FACTORS;

EID: 79959867627     PISSN: 10889051     EISSN: 15495469     Source Type: Journal    
DOI: 10.1101/gr.111351.110     Document Type: Article

References (38)

1. Batzoglou S, Jaffe DB, Stanley K, Butler J, Gnerre S, Mauceli E, Berger B, Mesirov JP, Lander ES. 2002. Arachne: a whole-genome shotgun assembler. Genome Res 12: 177-189. (Pubitemid 34070592)
2. Birol I, Jackman S, Nielsen C, Qian J, Varhol R, Stazyk G, Morin R, Zhao Y, Hirst M, Schein J, et al. 2009. De novo transcriptome assembly with ABySS. Bioinformatics 25: 2872-2877.
3. Brockman W, Alvarez P, Young S, Garber M, Giannoukos G, Lee WL, Russ C, Lander ES, Nusbaum C, Jaffe DB, et al. 2008. Quality scores and SNP detection in sequencing-by-synthesis systems. Genome Res 18: 763-770. (Pubitemid 351645066)
4. Butler J, MacCallum I, Kleber M, Shlyakhter IA, Belmonte MK, Lander ES, Nusbaum C, Jaffe DB. 2008. ALLPATHS: De novo assembly of whole-genome shotgun microreads. Genome Res 18: 810-820. (Pubitemid 351645071)
5. Chaisson M, Pevzner P, Tang H. 2004. Fragment assembly with short reads. Bioinformatics 20: 2067-2074. (Pubitemid 39236559)
6. Chaisson MJP, Brinza D, Pevzner PA. 2009. De novo fragment assembly with short mate-paired reads: Does the read length matter? Genome Res 19: 336-346.
7. Chin F, Leung H, Li W-L, Yiu S-M. 2009. Finding optimal threshold for correction error reads in DNA assembling. BMC Bioinformatics (Suppl 1) 10: S15. doi: 10.1186/1471-2105-10S1-15.
8. Erlich Y, Mitra P, Delabastide M, McCombie W, Hannon G. 2008. Alta-Cyclic: a self-optimizing base caller for next-generation sequencing. Nat Methods 5: 679-682.
9. Ewing B, Green P. 1998. Base-calling of automated sequencer traces using Phred. II. Error probabilities. Genome Res 8: 186-194.
10. Gajer P, Schatz M, Salzberg SL. 2004. Automated correction of genome sequence errors. Nucleic Acids Res 32: 562-569. (Pubitemid 38263047)
11. Gresham D, Desai MM, Tucker CM, Jenq HT, Pai DA, Ward A, DeSevo CG, Botstein D, Dunham MJ. 2008. The repertoire and dynamics of evolutionary adaptations to controlled nutrient-limited environments in yeast. PLoS Genet 4: e1000303. doi: 10.1371/journal.pgen.1000303.
12. Hellmann I, Mang Y, Gu Z, Li P, Vega FMDL, Clark AG, Nielsen R. 2008. Population genetic analysis of shotgun assemblies of genomic sequences from multiple individuals. Genome Res 18: 1020-1029. (Pubitemid 351931153)
13. Jiang R, Tavare S, Marjoram P. 2009. Population genetic inference from resequencing data. Genetics 181: 187-197.
14. Jokinen P, Ukkonen E. 1991. Two algorithms for approximate string matching in static texts. In Proceedings of Mathematical Foundations of Computer Science. Lect Notes Comput Sci 520: 240-248.
15. Kao W-C, Song Y. 2010. naive BayesCall: An efficient model-based base-calling algorithm for high-throughput sequencing. In Proceedings of the 14th Annual International Conference on Research in Computational Molecular Biology (RECOMB). Lect Notes Comput Sci 6044: 233-247.
16. Kao W-C, Stevens K, Song YS. 2009. BayesCall: A model-based basecalling algorithm for high-throughput short-read sequencing. Genome Res 19: 1884-1895.
17. Kircher M, Stenzel U, Kelso J. 2009. Improved base calling for the Illumina Genome Analyzer using machine learning strategies. Genome Biol 10: R83. doi: 10.1186/gb-2009-10-8-r83.
18. Langmead B, Trapnell C, Pop M, Salzberg S. 2009. Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol 10: R25. doi: 10.1186/gb-2009-1-3-r25.
19. Li H, Durbin R. 2010. Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics 26: 589-595.
20. Li H, Ruan J, Durbin R. 2008. Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res 18: 1851-1858.
21. Martin J, Han C, Gordon LA, Terry A, Prabhakar S, She X, Xie G, Hellsten U, Chan YM, Altherr M, et al. 2004. The sequence and anslysis of duplication-rich chromosome 16. Nature 432: 988-994.
22. Medvedev P, Brudno M. 2008. Ab initio whole genome shotgun assembly with mated short reads. In Proceedings of the 12th Annual International Conference on Research in Computational Molecular Biology (RECOMB). Lect Notes Comput Sci 4751: 50-64.
23. Metzker M. 2010. Sequencing technologies-the next generation. Nat Rev Genet 11: 31-46.
24. Peng Y, Leung H, Yiu S, Chin F. 2010. IDBA - A practical iterative de Bruijn graph de novo assembler. In Proceedings of the 14th Annual International Conference on Research in Computational Molecular Biology (RECOMB). Lect Notes Comput Sci 6044: 426-440.
25. Pevzner PA, Tang H, Waterman MS. 2001. An Eulerian path approach to DNA fragment assembly. Proc Natl Acad Sci 98: 9748-9753. (Pubitemid 32769375)
26. Qu W, Hashimoto S-i, Morishita S. 2009. Efficient frequency-based de novo short-read clustering for error trimming in next-generation sequencing. Genome Res 19: 1309-1315.
27. Rasmussen KR, Stoye J, Myers EW. 2005. Efficient q-gram filters for finding all epsilon-matches over a given length. In Proceedings of the 9th Annual International Conference on Research in Computational Molecular Biology (RECOMB). Lect Notes Comput Sci 3678: 189-203. (Pubitemid 41420664)
28. Rougemont J, Amzallag A, Iseli C, Farinelli L, Xenarios I, Naef F. 2008. Probabilistic base calling of Solexa sequencing data. BMC Bioinformatics 9: 431. doi: 10.1186/1471-2105-9-431.
29. Salmela L. 2010. Correction of sequencing errors in a mixed set of reads. Bioinformatics 26: 1284-1290.
30. Sanger F, Nicklen S, Coulson A. 1977. DNA sequencing with chain-terminating inhibitors. Proc Natl Acad Sci 74: 5463-5467.
31. Schröder J, Schröder H, Puglisi SJ, Sinha R, Schmidt B. 2009. SHREC: a short-read error correction method. Bioinformatics 25: 2157-2163.
32. Shi H, Schmidt B, Liu W, Muller-Wittig W. 2009. Accelerating error correction in high-throughput short-read DNA sequencing data with CUDA. In Proceedings of the IEEE International Parallel & Distributed Processing Symposium, pp. 1-8. Nanyang Technical University, Singapore.
33. Simpson JT, Wong K, Jackman SD, Schein JE, Jones SJ, Birol I. 2009. ABySS: a parallel assembler for short read sequence data. Genome Res 19: 1117-1123.
34. Sundquist A, Ronaghi M, Tang H, Pevzner P, Batzoglou S. 2007. Whole-genome sequencing and assembly with high-throughput, short-read technologies. PLoS ONE 2: e484. doi: 10.1371/journal.pone.0000484.
35. Whiteford N, Skelly T, Curtis C, Ritchie M, Lohr A, Zaranek A, Abnizova I, Brown C. 2009. Swift: Primary data analysis for the Illumina Solexa sequencing platform. Bioinformatics 25: 2194-2199.
36. Wijaya E, Frith MC, Suzuki Y, Horton P. 2009. Recount: expectation maximization based error correction tool for next generation sequencing data. Genome Inform 23: 189-201.
37. Yang X, Dorman KS, Aluru S. 2010. Reptile: representative tiling for short read error correction. Bioinformatics 26: 2526-2533.
38. Zerbino DR, Birney E. 2008. Velvet: Algorithms for de novo short read assembly using de Bruijn graphs. Genome Res 18: 821-829. (Pubitemid 351645072)