z-logo
open-access-imgOpen Access
MBG: Minimizer-based sparse de Bruijn Graph construction
Author(s) -
Mikko Rautiainen,
Tobias Marschall
Publication year - 2021
Publication title -
bioinformatics
Language(s) - Uncategorized
Resource type - Journals
SCImago Journal Rank - 3.599
H-Index - 390
eISSN - 1367-4811
pISSN - 1367-4803
DOI - 10.1093/bioinformatics/btab004
Subject(s) - de bruijn sequence , de bruijn graph , computer science , contig , source code , graph , genome , theoretical computer science , combinatorics , biology , mathematics , programming language , genetics , gene
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom