modular k-mer count matrix and Bloom filter construction for large read collections
-
Updated
May 31, 2024 - C++
modular k-mer count matrix and Bloom filter construction for large read collections
Fast and space-efficient taxonomic classification of long reads
Count kmers with a more efficient (faster) hash table
Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.
fast and comprehensive k-mer counting package
SuperSampler, an efficient scaled size sketching and sketch comparison tool
HyperLogLog en C++ y OpenMP para cálculo de similitud de genomas mediante índice de Jaccard
An efficient kmer data structure for genomic applications.
Context aware Move To Front Transform based compressor
Count canonical kmers with Abseil C++ `absl::flat_hash_map`
A Streaming Algorithm for Estimating k-mer Counts with Optimal Space Usage in Parallel
Count canonical kmers with Emil Ernerfeldt's emilib::HashMap
Count canonical kmers with Google sparse_hash_map
Count canonical kmers with STL unordered_map
Count canonical kmers with Malte Skarupke's bytell_hash_map hash table
Counts k-kmers and sorts top "k" kmer by occurrence.
Add a description, image, and links to the kmer topic page so that developers can more easily learn about it.
To associate your repository with the kmer topic, visit your repo's landing page and select "manage topics."