An efficient hybrid approach to correcting errors in short reads

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6820 LNAI, Issue , 2011, Pages 198-210

  Zhao, Zhiheng ^a   Yin, Jianping ^a   Li, Yong ^a   Xiong, Wei ^a   Zhan, Yubin ^a  

^a NATIONAL UNIVERSITY OF DEFENSE TECHNOLOGY   (China)

Author keywords

Error correction; High throughput sequencing; Multiple Alignments; Suffix array

Indexed keywords

CORRECT ERROR; HIGH-THROUGHPUT; HIGH-THROUGHPUT SEQUENCING; HYBRID APPROACH; MULTIPLE ALIGNMENT; MULTIPLE ALIGNMENTS; OVERLAPPING REGIONS; SEQUENCING ERRORS; SUB-STRINGS; SUFFIX ARRAYS; ALIGNMENT-FREE;

ALIGNMENT; ARTIFICIAL INTELLIGENCE; COMPUTATIONAL COMPLEXITY; INDEXING (OF INFORMATION); ERROR CORRECTION; THROUGHPUT;

ERROR CORRECTION; ERRORS;

EID: 79961159335     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22589-5_19     Document Type: Conference Paper

References (17)

1. Mardis, E.R.: The impact of next-generation sequencing technology on genetics. Trends Genet. 24, 133-141 (2008)
2. Tammi, M.T., Arner, E., Kindlund, E., Andersson, B.: Correcting errors in shotgun sequences. Nucleic Acids Res. 31, 4663-4672 (2003) (Pubitemid 37441827)
3. Pevzner, P.A., Tang, H., Waterman, M.S.: A new approach to fragment assembly in DNA sequencing. In: RECOMB 2001, pp. 256-267 (2001) (Pubitemid 32866168)
4. Chaisson, M.J., Pevzner, P.A., Tang, H.: Fragment assembly with short reads. Bioinformatics 20, 2067-2074 (2004) (Pubitemid 39236559)
5. Chaisson, M.J., Brinza, D., Pevzner, P.A.: De novo fragment assembly with short mate-paired reads: Does the read length matter? Genome Res. 19, 336-346 (2009)
6. Butler, J., MacCallum, I., Kleber, M., Shlyakhter, I.A., Belmonte, M.K., Lander, E.S., Nusbaum, C., Jaffe, D.B.: ALLPATHS: De novo assembly of whole-genome shotgun microreads. Genome Res. 18, 810-820 (2008) (Pubitemid 351645071)
7. Yang, X., Dorman, K.S., Aluru, S.: Reptile: representative tiling for short read error correction. Bioinformatics 26, 2526-2533 (2010)
8. Kelley, D., Schatz, M., Salzberg, S.: Quake: quality-aware detection and correction ofsequencing errors. Genome Biology 11(11), R116 (2010)
9. Shi, H., Schmidt, B., Liu, W., Muller-Wittig, W.: A parallel algorithm for error cor-rection in high-throughput short-read data on CUDA-enabled graphics hardware. J. Comput.Biol. 17, 603-615 (2009)
10. Schroder, J., Schroder, H., Puglisi, S.J., Sinha, R., Schmidt, B.: SHREC: a short-read error correction method. Bioinformatics 25, 2157-2163 (2009)
11. Salmela, L.: Correction of sequencing errors in a mixed set of reads. Bioinformat-ics. 26(10), 1284-1290 (2010)
12. Ilie, L., Fazayeli, F., Ilie, S.: HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics 27(3), 295-302 (2011)
13. Manber, U., Myers, G.: Suffix arrays: a new method for on-line search. SIAM J. Comput. 22(5), 935-948 (1993)
14. Simon, J., Puglisi, W.F., Smyth, A.: A taxonomy of suffix array construction al-gorithms. ACM Comput. Surv. 39(2), 1-31 (2007)
15. Mori, Y.: Short description of improved two-stage suffix sorting algorithm, http://homepage3.nifty.com/wpage/software/itssort.txt
16. Kasai, T., Lee, G.H., Arimura, H., Arikawa, S., Park, K.: Linear-time longest-common-prefix computation in suffix arrays and its applications. In: Amir, A., Landau, G.M. (eds.) CPM 2001. LNCS, vol. 2089, pp. 181-192. Springer, Heidel-berg (2001) (Pubitemid 33298873)
17. Needleman, S.B.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. Journal of Molecular Biology 48(3), 443-453 (1970)