Fast and memory-efficient "single pass" kmer counting
-
Updated
Feb 14, 2018 - C++
Fast and memory-efficient "single pass" kmer counting
Count canonical kmers with Malte Skarupke's bytell_hash_map hash table
Count canonical kmers with Google sparse_hash_map
Count canonical kmers with Emil Ernerfeldt's emilib::HashMap
Count canonical kmers with STL unordered_map
Count canonical kmers with Abseil C++ `absl::flat_hash_map`
Count canonical kmers with Boost C++ `boost::unordered_map` hash table
🧮 🔢 Generate multi-sample k-mer count matrix from WGS
DNA classifier using Natural Language Processing. Used K-mer method to convert sequence strings into fixed size words
Count kmers with a more efficient (faster) hash table
A program to read sequences from fastq file and find out the frequency of all substrings with length k across all sequences in the file.
fast and comprehensive k-mer counting package
Kmer counter is written in GO Lang v 1.16.5 To install GO on Windows, follow the instructions at https://golang.org/doc/install 4 GO implementation of N-mer counter in DNA sequences which tests for validity of input. It reads in file name (of fasta file) It reads the size length (kmer length) for which counts are desired and writes out to file, …
Counts the number of occurrences of each k-mer in a DNA string
A naive implementation of a k-mer counter in Python, takes fasta files and k-mer length requests and outputs all k-mers of length k, their reverse complement, and their frequency within their respective sequence for each sequence in the file.
Counting Bloom Filter Algorithm to count kmers
This is the Machine learning Project Repo.
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."