{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T23:45:56Z","timestamp":1773272756088,"version":"3.50.1"},"reference-count":24,"publisher":"Oxford University Press (OUP)","issue":"24","license":[{"start":{"date-parts":[[2018,6,28]],"date-time":"2018-06-28T00:00:00Z","timestamp":1530144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"name":"D\u00e9fi MASTODONS C3G"},{"DOI":"10.13039\/501100004794","name":"CNRS","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004794","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,12,15]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Motivation<\/jats:title>\n                    <jats:p>The recent rise of long read sequencing technologies such as Pacific Biosciences and Oxford Nanopore allows to solve assembly problems for larger and more complex genomes than what allowed short reads technologies. However, these long reads are very noisy, reaching an error rate of around 10\u201315% for Pacific Biosciences, and up to 30% for Oxford Nanopore. The error correction problem has been tackled by either self-correcting the long reads, or using complementary short reads in a hybrid approach. However, even though sequencing technologies promise to lower the error rate of the long reads below 10%, it is still higher in practice, and correcting such noisy long reads remains an issue.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>We present HG-CoLoR, a hybrid error correction method that focuses on a seed-and-extend approach based on the alignment of the short reads to the long reads, followed by the traversal of a variable-order de Bruijn graph, built from the short reads. Our experiments show that HG-CoLoR manages to efficiently correct highly noisy long reads that display an error rate as high as 44%. When compared to other state-of-the-art long read error correction methods, our experiments also show that HG-CoLoR provides the best trade-off between runtime and quality of the results, and is the only method able to efficiently scale to eukaryotic genomes.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Availability and implementation<\/jats:title>\n                    <jats:p>HG-CoLoR is implemented is C++, supported on Linux platforms and freely available at https:\/\/github.com\/morispi\/HG-CoLoR.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Supplementary information<\/jats:title>\n                    <jats:p>Supplementary data are available at Bioinformatics online.<\/jats:p>\n                  <\/jats:sec>","DOI":"10.1093\/bioinformatics\/bty521","type":"journal-article","created":{"date-parts":[[2018,6,27]],"date-time":"2018-06-27T15:37:29Z","timestamp":1530113849000},"page":"4213-4222","source":"Crossref","is-referenced-by-count":31,"title":["Hybrid correction of highly noisy long reads using a variable-order de Bruijn graph"],"prefix":"10.1093","volume":"34","author":[{"given":"Pierre","family":"Morisse","sequence":"first","affiliation":[{"name":"Normandie Univ, UNIROUEN, LITIS, Rouen, France"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[{"name":"Normandie Univ, UNIROUEN, LITIS, Rouen, France"}]},{"given":"Arnaud","family":"Lefebvre","sequence":"additional","affiliation":[{"name":"Normandie Univ, UNIROUEN, LITIS, Rouen, France"}]}],"member":"286","published-online":{"date-parts":[[2018,6,28]]},"reference":[{"key":"2023012712255368300_bty521-B1","doi-asserted-by":"crossref","first-page":"3421","DOI":"10.1093\/bioinformatics\/btv415","article-title":"Karect: accurate correction of substitution, insertion and deletion errors for next-generation sequencing data","volume":"31","author":"Allam","year":"2015","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B2","doi-asserted-by":"crossref","first-page":"204.","DOI":"10.1186\/s12859-017-1610-3","article-title":"HALC: high throughput algorithm for long read error correction","volume":"18","author":"Bao","year":"2017","journal-title":"BMC Bioinformatics"},{"key":"2023012712255368300_bty521-B3","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1038\/nbt.3238","article-title":"Assembling large genomes with single-molecule sequencing and locality-sensitive hashing","volume":"33","author":"Berlin","year":"2015","journal-title":"Nat. Biotechnol"},{"key":"2023012712255368300_bty521-B4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1109\/DCC.2015.70","volume-title":"Proceedings of the 2015 Data Compression Conference","author":"Boucher","year":"2015"},{"key":"2023012712255368300_bty521-B5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-33122-0_18","volume-title":"Succinct de Bruijn Graphs","author":"Bowe","year":"2012"},{"key":"2023012712255368300_bty521-B6","doi-asserted-by":"crossref","first-page":"238.","DOI":"10.1186\/1471-2105-13-238","article-title":"Mapping single molecule sequencing reads using basic local alignment with successive refinement (BLASR): application and theory","volume":"13","author":"Chaisson","year":"2012","journal-title":"BMC Bioinformatics"},{"key":"2023012712255368300_bty521-B7","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1038\/nmeth.2474","article-title":"Nonhybrid, finished microbial genome assemblies from long-read SMRT sequencing data","volume":"10","author":"Chin","year":"2013","journal-title":"Nat. Methods"},{"key":"2023012712255368300_bty521-B8","doi-asserted-by":"crossref","first-page":"1750","DOI":"10.1101\/gr.191395.115","article-title":"Oxford Nanopore sequencing, hybrid error correction, and de novo assembly of a eukaryotic genome","volume":"25","author":"Goodwin","year":"2015","journal-title":"Genome Res"},{"key":"2023012712255368300_bty521-B9","doi-asserted-by":"crossref","first-page":"i545","DOI":"10.1093\/bioinformatics\/btw463","article-title":"CoLoRMap: correcting long reads by mapping short reads","volume":"32","author":"Haghshenas","year":"2016","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B10","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1093\/bioinformatics\/btr708","article-title":"ART: a next-generation sequencing read simulator","volume":"28","author":"Huang","year":"2012","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1101\/gr.113985.110","article-title":"Adaptive seeds tame genomic sequence comparison","volume":"21","author":"Kielbasa","year":"2011","journal-title":"Genome Res"},{"key":"2023012712255368300_bty521-B12","doi-asserted-by":"crossref","first-page":"2759","DOI":"10.1093\/bioinformatics\/btx304","article-title":"KMC3: counting and manipulating k-mer statistics","volume":"33","author":"Kokot","year":"2017","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B13","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1101\/gr.215087.116","article-title":"Canu: scalable and accurate long-read assembly via adaptive k-mer weighting and repeat separation","volume":"27","author":"Koren","year":"2017","journal-title":"Genome Res"},{"key":"2023012712255368300_bty521-B14","doi-asserted-by":"crossref","first-page":"e0133198","DOI":"10.1371\/journal.pone.0133198","article-title":"Indexing arbitrary-length k-mers in sequencing reads","volume":"10","author":"Kowalski","year":"2015","journal-title":"PLoS One"},{"key":"2023012712255368300_bty521-B15","doi-asserted-by":"crossref","first-page":"R12.","DOI":"10.1186\/gb-2004-5-2-r12","article-title":"Versatile and open software for comparing large genomes","volume":"5","author":"Kurtz","year":"2004","journal-title":"Genome Biol"},{"key":"2023012712255368300_bty521-B16","doi-asserted-by":"crossref","first-page":"3652","DOI":"10.1093\/bioinformatics\/btx489","article-title":"LRCstats, a tool for evaluating long reads correction methods","volume":"33","author":"La","year":"2017","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B17","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1093\/bioinformatics\/btp698","article-title":"Fast and accurate long-read alignment with Burrows-Wheeler transform","volume":"26","author":"Li","year":"2010","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B18","first-page":"296","volume-title":"Manifold de Bruijn Graphs","author":"Lin","year":"2014"},{"key":"2023012712255368300_bty521-B19","doi-asserted-by":"crossref","first-page":"327.","DOI":"10.1186\/s12864-015-1519-z","article-title":"Genome assembly using Nanopore-guided long and error-free DNA reads","volume":"16","author":"Madoui","year":"2015","journal-title":"BMC Genomics"},{"key":"2023012712255368300_bty521-B20","doi-asserted-by":"crossref","first-page":"e0130821.","DOI":"10.1371\/journal.pone.0130821","article-title":"QuorUM: an error corrector for illumina reads","volume":"10","author":"Mar\u00e7ais","year":"2015","journal-title":"PLoS One"},{"key":"2023012712255368300_bty521-B21","doi-asserted-by":"crossref","first-page":"10.","DOI":"10.1186\/s13015-016-0075-7","article-title":"Jabba: hybrid error correction for long sequencing reads","volume":"11","author":"Miclotte","year":"2016","journal-title":"Algorithms Mol. Biol"},{"key":"2023012712255368300_bty521-B22","doi-asserted-by":"crossref","first-page":"3506","DOI":"10.1093\/bioinformatics\/btu538","article-title":"LoRDEC: accurate and efficient long read error correction","volume":"30","author":"Salmela","year":"2014","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B23","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1093\/bioinformatics\/btw321","article-title":"Accurate selfcorrection of errors in long reads using de Bruijn graphs","volume":"33","author":"Salmela","year":"2017","journal-title":"Bioinformatics"},{"key":"2023012712255368300_bty521-B24","doi-asserted-by":"crossref","first-page":"2704","DOI":"10.1093\/bioinformatics\/btw286","article-title":"SimLoRD: simulation of long read data","volume":"32","author":"St\u00f6cker","year":"2016","journal-title":"Bioinformatics"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/24\/4213\/48921022\/bioinformatics_34_24_4213.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/34\/24\/4213\/48921022\/bioinformatics_34_24_4213.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,3]],"date-time":"2023-09-03T07:17:20Z","timestamp":1693725440000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/34\/24\/4213\/5046256"}},"subtitle":[],"editor":[{"given":"Bonnie","family":"Berger","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2018,6,28]]},"references-count":24,"journal-issue":{"issue":"24","published-print":{"date-parts":[[2018,12,15]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/bty521","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/238808","asserted-by":"object"}]},"ISSN":["1367-4803","1367-4811"],"issn-type":[{"value":"1367-4803","type":"print"},{"value":"1367-4811","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2018,12,15]]},"published":{"date-parts":[[2018,6,28]]}}}