jermp / sshashLinks
📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
☆89Updated this week
Alternatives and similar repositories for sshash
Users that are interested in sshash are comparing it to the libraries listed below
Sorting:
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- modular k-mer count matrix and Bloom filter construction for large read collections☆85Updated 2 weeks ago
- memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping☆64Updated 3 months ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆82Updated last year
- A repository for generating strobemers and evalaution☆78Updated last year
- Implicit Interval Tree with Interpolation Index☆41Updated 3 years ago
- Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)☆51Updated last year
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Updated last year
- A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.☆52Updated this week
- An experimental tool to find approximate max-cuts in a large graph☆10Updated 4 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated last month
- Refinements of the WFA alignment algorithm with better complexity☆26Updated 3 years ago
- A fast, AVX2 and ARM Neon accelerated FM index library☆34Updated 9 months ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated 7 months ago
- SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)☆39Updated last year
- ☆24Updated 4 years ago
- An efficient index for the colored, compacted, de Bruijn graph☆109Updated 11 months ago
- a toolset for fast DNA read set matching and assembly using a new type of reduced kmer☆37Updated 4 years ago
- Efficient, parallel compression for terabyte-scale data☆48Updated 4 months ago
- Compacted and colored de Bruijn graph construction and querying☆84Updated 2 weeks ago
- De Bruijn graph representation in low memory☆36Updated last year
- Substring index for paths in a graph☆60Updated 4 months ago
- Squeakr: An Exact and Approximate k -mer Counting System☆85Updated 6 months ago
- Efficient construction of the BWT using string compression☆18Updated 3 months ago
- Space-efficient pseudoalignment with a colored de Bruijn graph☆53Updated 6 months ago
- Reference implementations of minimizer schemes to go with the mod-minimizers paper.☆25Updated 4 months ago
- A genomic minhashing implementation in Rust☆99Updated 2 months ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆71Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago