The mod-minimizer: a simple and efficient sampling algorithm for long k-mers

DOI10.4230/LIPICS.WABI.2024.11MaRDI QIDQ6857977zbMATH OpenFDO

Authors Ragnar Groot Koerkamp, Giulio Ermanno Pibiri

Publication date 13 February 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.WABI.2024.11

zbMATH Keywords

hashingminimizersrandomized algorithmssketching

Mathematics Subject Classification ID

Computational methods for problems pertaining to biology (92-08) Genetics and epigenetics (92D10) Protein sequences, DNA sequences (92D20)

Cites work

• A proof of Golomb's conjecture for the de Bruijn graph
• A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets
• Bidirectional String Anchors: A New String Sampling Mechanism
• Hash, Displace, and Compress
• Meta-colored compacted de Bruijn graphs

This page was built for publication: The mod-minimizer: a simple and efficient sampling algorithm for long \(k\)-mers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6857977)