GreedyMini: generating low-density DNA minimizers
Open Access
- 1 July 2025
- journal article
- Published by Oxford University Press (OUP) in Bioinformatics
- Vol. 41 (Supplement) , i275-i284
Abstract
Motivation: Minimizers are the most popular k-mer selection scheme in algorithms and data structures analyzing high-throughput sequencing (HTS) data. In a minimizer scheme, the smallest k-mer by some predefined order is selected as the representative of a sequence window containing w consecutive k-mers, which results in overlapping windows often selecting the same k-mer. Minimizers that achieve the lowest frequency of selected k-mers over a random DNA sequence, termed the expected density, are desired for improved performance of HTS analyses. Yet, no method to date exists to generate minimizers that achieve minimum expected density. Moreover, for k and w values used by common HTS algorithms and data structures, there is a gap between densities achieved by existing selection schemes and the theoretical lower bound. Results: We developed GreedyMini, a toolkit of methods to generate minimizers with low expected or particular density, to improve minimizers, to extend minimizers to larger alphabets, k, and w, and to measure the expected density of a given minimizer efficiently. We demonstrate over various combinations of k and w values, including those of popular HTS methods, that GreedyMini can generate DNA minimizers that achieve expected densities very close to the lower bound, and both expected and particular densities much lower compared to existing selection schemes. Moreover, we show that GreedyMini’s k-mer rank-retrieval time is comparable to common k-mer hash functions. We expect GreedyMini to improve the performance of many HTS algorithms and data structures and advance the research of k-mer selection schemes. Availability and implementation: The toolkit, its source code, and precomputed minimizers for a variety of (k,w) pairs are available via https://github.com/OrensteinLab/GreedyMini.Keywords
Funding Information
- Israel Science Foundation (810/21)
- Israel Data Science and AI Initiative
- ERC (683064)
- EU’s Horizon 2020 research and innovation programme
- Center for Absorption in Science of the Ministry of Aliyah and Immigration
- United States–Israel Binational Science Foundation (2020297)
- Israel Science Foundation (358/21)
This publication has 29 references indexed in Scilit:
- Asymptotically optimal minimizers schemesBioinformatics, 2018
- Minimap2: pairwise alignment for nucleotide sequencesBioinformatics, 2018
- Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencingPLOS Computational Biology, 2017
- Improving the performance of minimizers and winnowing schemesBioinformatics, 2017
- KMC 3: counting and manipulating k-mer statisticsBioinformatics, 2017
- Minimap and miniasm: fast mapping and de novo assembly for noisy long sequencesBioinformatics, 2016
- On the Representation of De Bruijn GraphsJournal of Computational Biology, 2015
- KMC 2: fast and resource-frugal k-mer countingBioinformatics, 2015
- Kraken: ultrafast metagenomic sequence classification using exact alignmentsGenome Biology, 2014
- Reducing storage requirements for biological sequence comparisonBioinformatics, 2004