BioinformaticsBioinformaticsPeer-reviewed journal article
Fast and flexible minimizer digestion with digest
Alan Zheng, Ishmeal Lee, Vikram S. ShivakumariD, Omar Y. AhmediD, Ben LangmeadiD
Abstract
Minimizer digestion is an increasingly common component of bioinformatics tools, including tools for De Bruijn-Graph assembly and sequence classification. We describe a new open source tool and library to facilitate efficient digestion of genomic sequences. It can produce digests based on the related ideas of minimizers, modimizers or syncmers. Digest uses efficient data structures, scales well to many threads, and produces digests with expected spacings between digested elements. Digest is implemented in C++17 with a Python API, and is available open-source at https://github.com/VeryAmazed/digest.
- Citations
- 1
- FWCI
- 0.30
- Field percentile
- 47th percentile
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- Minimizer-space de Bruijn graphs
Barış Ekim, Bonnie Berger, Rayan Chikhi·bioRxiv·Jun 9, 2021
- SimdMinimizers: Computing random minimizers, fast
Ragnar Groot Koerkamp, Igor Martayan·bioRxiv·Jan 27, 2025
- Improving the efficiency of de Bruijn graph construction using compact universal hitting sets
Yael Ben-Ari, Dan Flomin, … Ron Shamir A·ACM International Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB)Peer-reviewed·Jul 30, 2021
- Efficient minimizer orders for large values of k using minimum decycling sets
David Pellow, Lianrong Pu, … Yaron Orenstein·Genome ResearchPeer-reviewed·Aug 9, 2023
- Improving the performance of minimizers andwinnowing schemes
Guillaume Marçais, David Pellow, … Carl Kingsford·BioinformaticsPeer-reviewed·Apr 20, 2017
- mim: A lightweight auxiliary index to enable fast, parallel, gzipped FASTQ parsing
Rob Patro, Siddhant Bharti, … Ragnar Groot Koerkamp·bioRxiv·Nov 24, 2025