Alternatives and similar repositories for sshash:

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

• 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
• tlemane / kmtricks
  modular k-mer count matrix and Bloom filter construction for large read collections
  ☆81Updated 4 months ago
• ksahlin / strobemers
  A repository for generating strobemers and evalaution
  ☆77Updated 10 months ago
• COMBINE-lab / pufferfish
  An efficient index for the colored, compacted, de Bruijn graph
  ☆107Updated 4 months ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated 8 months ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated 11 months ago
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 2 years ago
• mlin / iitii
  Implicit Interval Tree with Interpolation Index
  ☆41Updated 2 years ago
• jermp / fulgor
  Fulgor is a fast and space-efficient colored de Bruijn graph index.
  ☆49Updated this week
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆47Updated 11 months ago
• splatlab / squeakr
  Squeakr: An Exact and Approximate k -mer Counting System
  ☆85Updated last year
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆27Updated 3 weeks ago
• muellan / metacache
  memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping
  ☆57Updated 4 months ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 3 years ago
• rchikhi / rust-alignbench
  Pairwise nucleotide alignment benchmark of Rust bindings
  ☆31Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• seqan / raptor
  A fast and space-efficient pre-filter for querying very large collections of nucleotide sequences.
  ☆52Updated this week
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆40Updated 2 weeks ago
• vgteam / libhandlegraph
  Library for the Handle Graph abstraction
  ☆23Updated 2 months ago
• edawson / gfakluge
  A C++ library and utilities for manipulating the Graphical Fragment Assembly format.
  ☆54Updated 2 years ago
• COMBINE-lab / kmers
  A bit-packed k-mer representation (and relevant utilities) for rust
  ☆48Updated 7 months ago
• dnbaker / bonsai
  Bonsai: Fast, flexible taxonomic analysis and classification
  ☆70Updated 10 months ago
• richarddurbin / modimizer
  a toolset for fast DNA read set matching and assembly using a new type of reduced kmer
  ☆37Updated 3 years ago
• jltsiren / gbwt
  Substring index for paths in a graph
  ☆59Updated 2 weeks ago
• algbio / themisto
  Space-efficient pseudoalignment with a colored de Bruijn graph
  ☆53Updated 2 months ago
• smarco / BiWFA-paper
  Bidirectional WFA (Paper)
  ☆44Updated 9 months ago
• algbio / ggcat
  Compacted and colored de Bruijn graph construction and querying
  ☆81Updated last month
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆51Updated 11 months ago
• COMBINE-lab / cuttlefish
  Building the compacted de Bruijn graph efficiently from references or reads.
  ☆86Updated last week