jermp / sshash
A compressed, associative, exact, and weighted dictionary for k-mers.
☆84Updated last month
Related projects ⓘ
Alternatives and complementary repositories for sshash
- modular k-mer count matrix and Bloom filter construction for large read collections☆76Updated last month
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- A repository for generating strobemers and evalaution☆77Updated 7 months ago
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated 5 months ago
- A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.☆52Updated this week
- An efficient index for the colored, compacted, de Bruijn graph☆108Updated last month
- A fast constructor of the compressed de Bruijn graph from many genomes☆40Updated 2 years ago
- Library for the Handle Graph abstraction☆21Updated 4 months ago
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 2 years ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆57Updated last month
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆45Updated 8 months ago
- ☆57Updated 2 weeks ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆70Updated 7 months ago
- efficient alignment of strings to partially ordered string graphs☆33Updated 2 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆80Updated 8 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 3 years ago
- An experimental tool to find approximate max-cuts in a large graph☆11Updated 3 years ago
- Building the compacted de Bruijn graph efficiently from references or reads.☆83Updated last week
- Pairwise nucleotide alignment benchmark of Rust bindings☆31Updated last year
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆51Updated 8 months ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 9 months ago
- Fulgor is a fast and space-efficient colored de Bruijn graph index.☆44Updated this week
- Space-efficient pseudoalignment with a colored de Bruijn graph☆50Updated 2 months ago
- A C++ library and utilities for manipulating the Graphical Fragment Assembly format.☆51Updated 2 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆31Updated 3 months ago
- De Bruijn graph representation in low memory☆36Updated 4 months ago
- Histosketching Using Little Kmers☆55Updated last year
- Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.☆13Updated 3 years ago