Count kmers with a more efficient (faster) hash table
-
Updated
Jun 8, 2024 - C++
Count kmers with a more efficient (faster) hash table
fast and comprehensive k-mer counting package
Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly
Represents sequences files in fasta format in terms of their kmer counts.
Count canonical kmers with Abseil C++ `absl::flat_hash_map`
Count canonical kmers with Malte Skarupke's bytell_hash_map hash table
Count canonical kmers with Google sparse_hash_map
Fast and memory-efficient "single pass" kmer counting
Count canonical kmers with Boost C++ `boost::unordered_map` hash table
Count canonical kmers with STL unordered_map
Count canonical kmers with Emil Ernerfeldt's emilib::HashMap
Add a description, image, and links to the kmer-counting topic page so that developers can more easily learn about it.
To associate your repository with the kmer-counting topic, visit your repo's landing page and select "manage topics."