Many bioinformatics applications, eg, genome assembly, genome profiling, and sequence
alignment, break biological sequences into k-mers, or length-k substrings, for sub-sequent …

Obtaining overlaps between all pairs from billions of strings is a fundamental computational
challenge in de novo whole genome assembly. This paper presents a memory-efficient …