Jabba: Hybrid error correction for long sequencing reads

Algorithms for Molecular Biology

Volumn 11, Issue 1, 2016, Pages

  Miclotte, Giles ^a,c   Heydari, Mahdi ^a,c   Demeester, Piet ^a,c   Rombauts, Stephane ^a,b,c   Van de Peer, Yves ^a,b,c,d   Audenaert, Pieter ^a,c   Fostier, Jan ^a,c  

^a GHENT UNIVERSITY   (Belgium)

^b DEPARTMENT OF PLANT SYSTEMS BIOLOGY   (Belgium)

^c Bioinformatics Institute Ghent   (Belgium)

^d UNIVERSITY OF PRETORIA   (South Africa)

Author keywords

De Bruijn graph; Error correction; Maximal exact matches; Sequence analysis

Indexed keywords

EID: 84964786387     PISSN: None     EISSN: 17487188     Source Type: Journal    
DOI: 10.1186/s13015-016-0075-7     Document Type: Article

References (30)

1. Myers EW. Efficient local alignment discovery amongst noisy long reads. Algorithms Bioinform. 2014;8701:52-67. doi: 10.1007/978-3-662-44753-6_5.
2. Berling K, Koren S, Chin C-S, Drake J, Jane M. Assembling large genomes with single-molecule sequencing and locality sensitive hashing. Nat Biotech. 2015;33:623-30. doi: 10.1038/nbt.3238.
3. Salzberg SL, Phillippy AM, Zimin A, Puiu D, Magoc T, Koren S, Treangen TJ, Schatz MC, Delcher AL, Roberts M, Marcxais G, Pop M, Yorke JA. GAGE: A critical evaluation of genome assemblies and assembly algorithms. Genome Res. 2012;22(3):557-67. doi: 10.1101/gr.131383.111.
4. Yang X, Chockalingam SP, Aluru S. A survey of error-correction methods for next-generation sequencing. Brief. Bioinform. 2013;14(1):56-66. doi: 10.1093/bib/bbs015.
5. Kelley DR, Schatz MC, Salzberg SL. Quake: quality-aware detection and correction of sequencing errors. Genome Biol. 2010;11(11):116. doi: 10.1186/gb-2010-11-11-r116.
6. Greenfield P, Duesing K, Papanicolaou A, Bauer DC. Blue: correcting sequencing errors using consensus and context. Bioinformatics. 2014;30(19):2723-32. doi: 10.1093/bioinformatics/btu368.
7. Schröder J, Schröder H, Puglisi SJ, Sinha R, Schmidt B. SHREC: A short-read error correction method. Bioinformatics. 2009;25(17):2157-63. doi: 10.1093/bioinformatics/btp379.
8. Ilie L, Fazayeli F, Ilie S. HiTEC: accurate error correction in high-throughput sequencing data. Bioinformatics. 2011;27(3):295-302. doi: 10.1093/bioinformatics/btq653.
9. Salmela L, Schroder J. Correcting errors in short reads by multiple alignments. Bioinformatics. 2011;27(11):1455-61. doi: 10.1093/bioinformatics/btr170.
10. Au KF, Underwood JG, Lee L, Wong WH. Improving PacBio long read accuracy by short read alignment. PLoS One. 2012;7(10):46679. doi: 10.1371/journal.pone.0046679.
11. Koren S, Schatz MC, Walenz BP, Martin J, Howard JT, Ganapathy G, Wang Z, Rasko DA, Mccombie WR, Jarvis ED, Phillippy AM. Hybrid error correction and de novo assembly of single-molecule sequencing reads. Nat Biotechnol. 2012;30(7):693-700. doi: 10.1038/nbt.2280.
12. Hackl T, Hedrich R, Schultz J, Forster F. Proovread: large-scale high-accuracy PacBio correction through iterative short read consensus. Bioinformatics. 2014;30(21):3004-11. doi: 10.1093/bioinformatics/btu392.
13. Salmela L, Rivals E. LoRDEC: accurate and efficient long read error correction. Bioinformatics. 2014;30(24):3506-14. doi: 10.1093/bioinformatics/btu538.
14. Compeau PEC, Pevzner PA, Tesler G. How to apply de Bruijn graphs to genome assembly. Nat Biotechnol. 2011;29(11):987-91. doi: 10.1038/nbt.2023.
15. Abouelhoda MI, Kurtz S, Ohlebusch E. Replacing suffix trees with enhanced suffix arrays. J Discret Algorithms. 2004;2(1):53-86. doi: 10.1016/S1570-8667(03)00065-0.
16. Allam A, Kalnis P, Soloyev V. Karect: accurate correction of substitution, insertion and deletion errors for next-generation sequencing data. Bioinformatics. 2015;31(21):3421-8. doi: 10.1093/bioinformatics/btv415.
17. Zerbino DR, Birney E. Velvet: algorithms for de novo short read assembly using de Bruijn graphs. Genome Res. 2008;18(5):821-9. doi: 10.1101/gr.074492.107.
18. Liu Y, Schmidt B. Long read alignment based on maximal exact match seeds. Bioinformatics. 2012;28(18):318-24. doi: 10.1093/bioinformatics/bts414.
19. Vyverman M, Baets BD, Fack V, Dawyndt P. A long fragment aligner called ALFALFA. BMC Bioinformatics. 2015;16(1):159. doi: 10.1186/s12859-015-0533-0.
20. Li H. Aligning sequence reads, clone sequences and assembly contigs with BWA-MEM. http://arxiv.org/abs/1303.3997v2arXiv:1303.3997v2 [q-bio.GN]. 2013.
21. Li H, Durbin R. Fast and accurate long-read alignment with Burrows-Wheeler transform. Bioinformatics. 2010;26(5):589-95. doi: 10.1093/bioinformatics/btp698.
22. Langmead B, Salzberg SL. Fast gapped-read alignment with Bowtie 2. Nat Methods. 2012;9(4):357-9. doi: 10.1038/nmeth.1923.
23. Vyverman M, De Baets B, Fack V, Dawyndt P. EssaMEM: finding maximal exact matches using enhanced sparse suffix arrays. Bioinformatics. 2013;29(6):802-4. doi: 10.1093/bioinformatics/btt042.
24. Arratia R, Gordon L, Waterman MS. An extreme value theory for sequence matching. Ann Stat. 1986;14(3):971-93.
25. Gordon L, Schilling MF, Waterman MS. An extreme value theory for longest head runs. Probab Theory Relat Fields. 1986;72:279-87.
26. Schilling MF. The surprising predictability of long runs. Math Mag. 2012;85(2):141-9. doi: 10.4169/math.mag.85.2.141.
27. Huang W, Li L, Myers JR, Marth GT. ART: a next-generation sequencing read simulator. Bioinformatics. 2012;28(4):593-4. doi: 10.1093/bioinformatics/btr708.
28. Ono Y, Asai K, Hamada M. PBSIM: PacBio reads simulator-toward accurate genome assembly. Bioinformatics. 2013;29(1):119-21. doi: 10.1093/bioinformatics/bts649.
29. Chaisson MJ, Tesler G. Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory. BMC Bioinform. 2012;13(238):1-18. doi: 10.1186/1471-2105-13-238.
30. Blanc-Mathieu R, Verhelst B, Derelle E, Rombauts S, Bouget F-Y, Carré I, Château A, Eyre-Walker A, Grimsley N, Moreau H, Piégu B, Rivals E, Schackwitz W, Van de Peer Y, Piganeau G. An improved genome of the model marine alga Ostreococcus tauri unfolds by assessing Illumina de novo assemblies. BMC Genome. 2014;15(1):1103. doi: 10.1186/1471-2164-15-1103.