HiTEC: Accurate error correction in high-throughput sequencing data

Bioinformatics

Volumn 27, Issue 3, 2011, Pages 295-302

  Ilie, Lucian ^a   Fazayeli, Farideh ^a   Ilie, Silvana ^b  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b RYERSON UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; COMPUTER PROGRAM; DNA SEQUENCE; GENOME; METHODOLOGY; REPRODUCIBILITY;

ALGORITHMS; GENOME; MODELS, GENETIC; REPRODUCIBILITY OF RESULTS; SEQUENCE ANALYSIS, DNA; SOFTWARE;

EID: 79551589417     PISSN: 13674803     EISSN: 14602059     Source Type: Journal    
DOI: 10.1093/bioinformatics/btq653     Document Type: Article

References (36)

1. Butler,J. et al. (2008) ALLPATHS: De novo assembly of whole-genome shotgun microreads. Genome Res., 18, 810-820.
2. Campagna,D. et al. (2009) PASS: a program to align short sequences. Bioinformatics, 25, 967-968.
3. Chaisson,M.J. et al. (2009) De novo fragment assembly with short mate-paired reads: Does the read length matter?. Genome Res., 19, 336-346.
4. Chen,J. and Skiena,S. (2007) Assembly for double-ended short-read sequencing technologies. In Mardis,E. et al. (eds) Advances in Genome Sequencing Technology and Algorithms, Artech House Publishers, New York, pp. 123-141.
5. Chen,Y. (2009) PerM: efficient mapping of short sequencing reads with periodic full sensitive spaced seeds. Bioinformatics, 25, 2514-2521.
6. Dohm,J.C. et al. (2007) SHARCGS, a fast and highly accurate short-read assembly algorithm for de novo genomic sequencing. Genome Res., 17, 1697-1706.
7. Eaves,L.H. and Gao,Y. (2009) MOM: maximum oligonucleotide mapping. Bioinformatics, 25, 969-970.
8. Hernandez,D. et al. (2008) De novo bacterial genome sequencing: millions of very short reads assembled on a desktop computer. Genome Res., 18, 802-809.
9. Jeck,W.R. et al. (2007) Extending assembly of short DNA sequences to handle error. Bioinformatics, 23, 2942-2944.
10. Jiang,H. andWong,W.H (2008) SeqMap: mapping massive amount of oligonucleotides to the genome. Bioinformatics, 24, 2395-2396.
11. Jung Kim,Y. et al. (2009) ProbeMatch: a tool for aligning oligonucleotide sequences. Bioinformatics, 25, 1424-1425.
12. Kärkkäinen,J. and Sanders,P. (2003) Simple linear work suffix array construction. In Proceedings of ICALP'03, Vol. of 2719. Lecture Notes in Computer Science, Springer, Berlin, Heidelberg, pp. 943-955.
13. Kasai,T. et al. (2001) Linear-time longest-common-prefix computation in suffix arrays and its applications. In Proceedings of CPM'01, Vol. 2089 of Lecture Notes in Computer Science, Springer, Berlin, pp. 181-192.
14. Kim,D.K. et al. (2005) Constructing suffix arrays in linear time. J. Discrete Algorithms, 3, 126-142.
15. Ko,P. and Aluru,S. (2005) Space efficient linear time construction of suffix arrays. J. Discrete Algorithms, 3, 143-156.
16. Langmead,B. et al. (2009) Ultrafast and memory-efficient alignment of short DNA sequences to the human genome. Genome Biol., 10, R25.
17. Li,H. et al. (2008a) Mapping short DNA sequencing reads and calling variants using mapping quality scores. Genome Res., 18, 1851-1858.
18. Li,R. et al. (2008b) SOAP: short oligonucleotide alignment program. Bioinformatics, 24, 713-714.
19. Li,H. and Durbin,R. (2009) Fast and accurate short read alignment with Burrows-Wheeler transform. Bioinformatics, 25, 1754-1760.
20. Lin,H. et al. (2008) ZOOM! Zillions of oligos mapped. Bioinformatics, 24, 2431-2437.
21. Malhis,N. et al. (2009) Slider-maximum use of probability information for alignment of short sequence reads and SNP detection. Bioinformatics, 25, 6-13.
22. Manber,U. and Myers,G. (1993) Suffix arrays: a new method for on-line search. SIAM J. Comput., 22, 935-948.
23. Mardis,E.R. (2008) The impact of next-generation sequencing technology on genetics. Trends Genet., 24, 133-141.
24. Myers,G. (2005) Building fragment assembly string graphs. Bioinformatics, 21, ii79-ii85.
25. Rumble,S.M. et al. (2009) SHRiMP: accurate mapping of short color-space reads. PLoS Comput. Biol., 5, e1000386.
26. Salmela,L. (2010) Correction of sequencing errors in a mixed set of reads. Bioinformatics, 26, 1284-1290.
27. Sanger,F. et al. (1977) DNA sequencing with chain-terminating inhibitors. Proc. Natl Acad. Sci. USA, 74, 5463-5467.
28. Schatz,M. (2009) Cloudburst: highly sensitive read mapping with mapreduce. Bioinformatics, 25, 1363-1369.
29. Schroder,J. et al. (2009) SHREC: a short-read error correction method. Bioinformatics, 25, 2157-2163.
30. Shi,H. et al. (2010) A parallel algorithm for error correction in high-throughput shortread data on CUDA-enabled graphics hardware. J. Comput. Biol., 17, 603-615.
31. Simpson,J.T. et al. (2009) ABySS: a parallel assembler for short read sequence data. Genome Res., 19, 1117-1123.
32. Smith,A.D. et al. (2008) Using quality scores and longer reads improves accuracy of Solexa read mapping. BMC Bioinformatics 9, 128.
33. Warren,R.Rl. et al. (2007)Assembling millions of short DNAsequences using SSAKE. Bioinformatics, 23, 500-501.
34. Yang,X. et al. (2010) Reptile: representative tiling for short read error correction. Bioinformatics, 26, 2526-2533.
35. Zerbino,D. and Birney,E. (2008) Velvet: algorithms for de novo short read assembly using De Bruijn graphs. Genome Res., 18, 821-829.
36. Zhou,X. et al. (2010) The next-generation sequencing technology: a technology review and future perspective. Sci. China, 53, 44-57.