Sign in
BioinformaticsBioinformatics
Peer-reviewed journal article

MBG: Minimizer-based Sparse de Bruijn Graph Construction

Mikko RautiaineniD, Tobias MarschalliD

Abstract

MotivationDe 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. ResultsWe 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 50x 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 seconds. AvailabilityPackage manager: https://anaconda.org/bioconda/mbg and source code: https://github.com/maickrau/MBG

02 /Specification & Classification

Click any tag to browse matching papers

Reproducibility ledger

Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.

Sign in to file a reproducibility report.

Similarity Map
SelectedSame fieldCross-field
THISGuo '19Diaz-Domíng '22Khan '22Holley '20Hannoush '24Ekim '21
72% semantic matchBioinformatics
Hongzhe Guo, Yilei Fu, Yan Ping Gao+3 more·IEEE Transactions on Computational Biology and Bioinformatics·Apr 30, 2019· 18 citations