Alternatives and similar repositories for sshash

Users that are interested in sshash are comparing it to the libraries listed below

• tlemane / kmtricks
  modular k-mer count matrix and Bloom filter construction for large read collections
  ☆84Updated 7 months ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• COMBINE-lab / pufferfish
  An efficient index for the colored, compacted, de Bruijn graph
  ☆110Updated 7 months ago
• ksahlin / strobemers
  A repository for generating strobemers and evalaution
  ☆78Updated last year
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• muellan / metacache
  memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping
  ☆60Updated last week
• mlin / iitii
  Implicit Interval Tree with Interpolation Index
  ☆41Updated 2 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated last year
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 4 months ago
• seqan / raptor
  A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
  ☆52Updated this week
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆47Updated last year
• splatlab / squeakr
  Squeakr: An Exact and Approximate k -mer Counting System
  ☆85Updated 3 months ago
• dnbaker / bonsai
  Bonsai: Fast, flexible taxonomic analysis and classification
  ☆70Updated last year
• jermp / fulgor
  ⚡️ 🧬 Fulgor is a fast and space-efficient colored de Bruijn graph index.
  ☆50Updated this week
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• ddiazdom / lcg
  Efficient, parallel compression for terabyte-scale data
  ☆46Updated 3 weeks ago
• splatlab / debgr
  deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
  ☆30Updated 4 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated last week
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated 2 months ago
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 3 years ago
• COMBINE-lab / cuttlefish
  Building the compacted de Bruijn graph efficiently from references or reads.
  ☆87Updated last month
• will-rowe / hulk
  Histosketching Using Little Kmers
  ☆57Updated 2 years ago
• pmelsted / bifrost
  Bifrost: Highly parallel construction and indexing of colored and compacted de Bruijn graphs
  ☆212Updated last year
• smarco / BiWFA-paper
  Bidirectional WFA (Paper)
  ☆46Updated last year
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• Martinsos / opal
  SIMD C/C++ library for massive optimal sequence alignment (local/SW, infix, overlap, global)
  ☆38Updated last year
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆18Updated this week