{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T07:43:11Z","timestamp":1775893391521,"version":"3.50.1"},"reference-count":16,"publisher":"Oxford University Press (OUP)","issue":"16","license":[{"start":{"date-parts":[[2021,1,21]],"date-time":"2021-01-21T00:00:00Z","timestamp":1611187200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"Sequence Read Archive","award":["SRR10971019"],"award-info":[{"award-number":["SRR10971019"]}]},{"name":"HG002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,8,25]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:sec>\n                    <jats:title>Motivation<\/jats:title>\n                    <jats:p>De Bruijn graphs can be constructed from short reads efficiently and have been used for many purposes. Traditionally, long-read sequencing technologies have had too high error rates for de Bruijn graph-based methods. Recently, HiFi reads have provided a combination of long-read length and low error rate, which enables de Bruijn graphs to be used with HiFi reads.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Results<\/jats:title>\n                    <jats:p>We have implemented MBG, a tool for building sparse de Bruijn graphs from HiFi reads. MBG outperforms existing tools for building dense de Bruijn graphs and can build a graph of 50\u00d7 coverage whole human genome HiFi reads in four hours on a single core. MBG also assembles the bacterial E.coli genome into a single contig in 8\u2009s.<\/jats:p>\n                  <\/jats:sec>\n                  <jats:sec>\n                    <jats:title>Availability and implementation<\/jats:title>\n                    <jats:p>Package manager: https:\/\/anaconda.org\/bioconda\/mbg and source code: https:\/\/github.com\/maickrau\/MBG.<\/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\/btab004","type":"journal-article","created":{"date-parts":[[2021,1,6]],"date-time":"2021-01-06T17:38:09Z","timestamp":1609954689000},"page":"2476-2478","source":"Crossref","is-referenced-by-count":78,"title":["MBG: Minimizer-based sparse de Bruijn Graph construction"],"prefix":"10.1093","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2971-267X","authenticated-orcid":false,"given":"Mikko","family":"Rautiainen","sequence":"first","affiliation":[{"name":"Center for Bioinformatics, Saarland University , 66123 Saarbr\u00fccken, Germany"},{"name":"Max Planck Institute for Informatics , 66123 Saarbr\u00fccken, Germany"},{"name":"Saarbr\u00fccken Graduate School for Computer Science , 66123 Saarbr\u00fccken, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9376-1030","authenticated-orcid":false,"given":"Tobias","family":"Marschall","sequence":"additional","affiliation":[{"name":"Heinrich Heine University D\u00fcsseldorf, Medical Faculty, Institute for Medical Biometry and Bioinformatics , 40225 D\u00fcsseldorf, Germany"}]}],"member":"286","published-online":{"date-parts":[[2021,1,21]]},"reference":[{"key":"2023051609054475400_btab004-B1","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1089\/cmb.2012.0021","article-title":"SPAdes: a new genome assembly algorithm and its applications to single-cell sequencing","volume":"19","author":"Bankevich","year":"2012","journal-title":"J. Comput. Biol"},{"key":"2023051609054475400_btab004-B2","doi-asserted-by":"crossref","first-page":"i201","DOI":"10.1093\/bioinformatics\/btw279","article-title":"Compacting de Bruijn graphs from sequencing data quickly and in low memory","volume":"32","author":"Chikhi","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051609054475400_btab004-B3","doi-asserted-by":"crossref","first-page":"3885","DOI":"10.1093\/bioinformatics\/btaa253","article-title":"ntJoin: fast and lightweight assembly-guided scaffolding using minimizer graphs","volume":"36","author":"Coombe","year":"2020","journal-title":"Bioinformatics"},{"key":"2023051609054475400_btab004-B4","doi-asserted-by":"crossref","first-page":"i105","DOI":"10.1093\/bioinformatics\/bty279","article-title":"A graph-based approach to diploid genome assembly","volume":"34","author":"Garg","year":"2018","journal-title":"Bioinformatics"},{"key":"2023051609054475400_btab004-B5","doi-asserted-by":"crossref","first-page":"2103","DOI":"10.1093\/bioinformatics\/btw152","article-title":"Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences","volume":"32","author":"Li","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051609054475400_btab004-B6","doi-asserted-by":"publisher","author":"Logsdon","year":"2020","DOI":"10.1101\/2020.09.08.285395"},{"key":"2023051609054475400_btab004-B7","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":"2023051609054475400_btab004-B8","doi-asserted-by":"crossref","first-page":"3492","DOI":"10.1093\/bioinformatics\/btw397","article-title":"ntHash: recursive nucleotide hashing","volume":"32","author":"Mohamadi","year":"2016","journal-title":"Bioinformatics"},{"key":"2023051609054475400_btab004-B9","doi-asserted-by":"crossref","first-page":"9748","DOI":"10.1073\/pnas.171285098","article-title":"An Eulerian path approach to DNA fragment assembly","volume":"98","author":"Pevzner","year":"2001","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"2023051609054475400_btab004-B10","doi-asserted-by":"publisher","first-page":"810812","DOI":"10.1186\/s13059-020-02157-2","author":"Rautiainen","year":"2019"},{"key":"2023051609054475400_btab004-B11","doi-asserted-by":"crossref","first-page":"3363","DOI":"10.1093\/bioinformatics\/bth408","article-title":"Reducing storage requirements for biological sequence comparison","volume":"20","author":"Roberts","year":"2004","journal-title":"Bioinformatics"},{"key":"2023051609054475400_btab004-B12","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":"2023051609054475400_btab004-B13","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/872757.872770","author":"Schleimer","year":"2003"},{"key":"2023051609054475400_btab004-B14","doi-asserted-by":"crossref","first-page":"1155","DOI":"10.1038\/s41587-019-0217-9","article-title":"Accurate circular consensus long-read sequencing improves variant detection and assembly of a human genome","volume":"37","author":"Wenger","year":"2019","journal-title":"Nat. Biotechnol"},{"key":"2023051609054475400_btab004-B15","doi-asserted-by":"crossref","first-page":"e1005595","DOI":"10.1371\/journal.pcbi.1005595","article-title":"Unicycler: resolving bacterial genome assemblies from short and long sequencing reads","volume":"13","author":"Wick","year":"2017","journal-title":"PLoS Comput. Biol"},{"key":"2023051609054475400_btab004-B16","author":"Ye","year":"2011"}],"container-title":["Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/bioinformatics\/advance-article-pdf\/doi\/10.1093\/bioinformatics\/btab004\/36171267\/btab004.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/37\/16\/2476\/50339270\/btab004.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article-pdf\/37\/16\/2476\/50339270\/btab004.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,16]],"date-time":"2023-05-16T05:12:19Z","timestamp":1684213939000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/bioinformatics\/article\/37\/16\/2476\/6104877"}},"subtitle":[],"editor":[{"given":"Peter","family":"Robinson","sequence":"additional","affiliation":[]}],"short-title":[],"issued":{"date-parts":[[2021,1,21]]},"references-count":16,"journal-issue":{"issue":"16","published-print":{"date-parts":[[2021,8,25]]}},"URL":"https:\/\/doi.org\/10.1093\/bioinformatics\/btab004","relation":{"has-preprint":[{"id-type":"doi","id":"10.1101\/2020.09.18.303156","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":[[2021,8,15]]},"published":{"date-parts":[[2021,1,21]]}}}