A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2
[article]
2021
bioRxiv
pre-print
The de Bruijn graph has become a key data structure in modern computational genomics, and of keen interest is its compacted variant. The compacted de Bruijn graph provides a lossless representation of the graph, and it is often considerably more efficient to store and process than its non-compacted counterpart. Construction of the compacted de Bruijn graph resides upstream of many genomic analyses. As the quantity of sequencing data and the number of reference genomes on which to perform these
doi:10.1101/2021.12.14.472718
fatcat:z2mqu7kfzvhzne5nacgroe745y