Loading...

Bifrost: highly parallel construction and indexing of colored and compacted de Bruijn graphs

Memory consumption of de Bruijn graphs is often prohibitive. Most de Bruijn graph-based assemblers reduce the complexity by compacting paths into single vertices, but this is challenging as it requires the uncompacted de Bruijn graph to be available in memory. We present a parallel and memory-effici...

Full description

Saved in:
Bibliographic Details
Published in:Genome Biol
Main Authors: Holley, Guillaume, Melsted, Páll
Format: Artigo
Language:Inglês
Published: BioMed Central 2020
Subjects:
Online Access:https://ncbi.nlm.nih.gov/pmc/articles/PMC7499882/
https://ncbi.nlm.nih.gov/pubmed/32943081
https://ncbi.nlm.nih.govhttp://dx.doi.org/10.1186/s13059-020-02135-8
Tags: Add Tag
No Tags, Be the first to tag this record!