bioRxivBioinformaticsPreprint
Efficient cardinality estimation for k-mers in large DNA sequencing data sets
Abstract
We present an open implementation of the HyperLogLog cardinality estimation sketch for counting fixed-length substrings of DNA strings (\"k-mers\").\n\nThe HyperLogLog sketch implementation is in C++ with a Python interface, and is distributed as part of the khmer software package. khmer is freely available from https://github.com/dib-lab/khmerunder a BSD License. The features presented here are included in version 1.4 and later.
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
- KmerStream: Streaming algorithms for k-mer abundance estimation
Páll Melsted, Bjarni V. Halldórsson·bioRxiv·Apr 7, 2014
- DynamicDemiLog: A Single Sketch for Ultrafast Similarity, Frequency, and Cardinality Estimation
Brian Bushnell·bioRxiv·Jun 16, 2026
- Hyper-k-mers: efficient streaming k-mers representation
Igor Martayan, Lucas Robidou, … Antoine Limasset·bioRxiv·Nov 6, 2024
- Set-Min sketch: a probabilistic map for power-law distributions with application to k-mer annotation
Yoshihiro Shibuya, Djamal Belazzougui, Grégory Kucherov·Journal of Computational BiologyPeer-reviewed·Jan 20, 2022
- CMash: fast, multi-resolution estimation of k-mer-based Jaccard and containment indices
Shaopeng Liu, David Koslicki·BioinformaticsPeer-reviewed·Apr 14, 2022
- Sparse and Skew Hashing of K-Mers
Giulio Ermanno Pibiri·BioinformaticsPeer-reviewed·Apr 14, 2022