Efficient cardinality estimation for k-mers in large DNA sequencing data sets
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.
Bioinformatics↗