Fig. 2From: Scalable, ultra-fast, and low-memory construction of compacted de Bruijn graphs with Cuttlefish 2Parallel-scaling metrics for CUTTLEFISH 2 across 1–32 processor threads, using k=27 on the (downsampled) human read set NIST HG004, with the frequency threshold f 0=4Back to article page