MBG: Minimizer-based sparse de Bruijn Graph construction.
Where this comes from
- Record sourced from PubMed, PMID 33475133.
- Also identified by DOI 10.1093/bioinformatics/btab004 and PMC identifier 8521641.
- No licence information is recorded for this record.
- Because redistribution is not established, this page shows the abstract only. Follow the links below for the full text.
Abstract
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. 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× 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 s. Package manager: https://anaconda.org/bioconda/mbg and source code: https://github.com/maickrau/MBG. Supplementary data are available at Bioinformatics online.