bioRxiv · 10.1101/2021.12.14.472718
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
Abstract
The de Bruijn graph is a key data structure in modern computational genomics, and construction of its compacted variant resides upstream of many genomic analyses. As the quantity of genomic data grows rapidly, this often forms a computational bottleneck. We present CO_SCPLOWUTTLEFISHC_SCPLOW 2, significantly advancing the state-of-the-art for this problem. On a commodity server, it reduces the graph construction time for 661K bacterial genomes, of size 2.58Tbp, from 4.5 days to 17-23 hours; and it constructs the graph for 1.52Tbp white spruce reads in [~]10 hours, while the closest competitor requires 54-58 hours, using considerably more memory.
Source connections
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Khan, J., Kokot, M., Deorowicz, S., Patro, R.. 2021-12-16. Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2. https://doi.org/10.1101/2021.12.14.472718
Cite the original work for its findings. Save a collection to share your selection of sources.