Alternatives and similar repositories for cobs

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

• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆88Updated this week
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆25Updated last year
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆65Updated 2 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 5 months ago
• medvedevgroup / TwoPaCo
  A fast constructor of the compressed de Bruijn graph from many genomes
  ☆41Updated 5 months ago
• tlemane / kmtricks
  modular k-mer count matrix and Bloom filter construction for large read collections
  ☆84Updated 8 months ago
• ocxtal / rbread
  Header-only, gzread-like reader for gzip, bz2, and xz.
  ☆12Updated 6 years ago
• mklarqvist / libflagstats
  Efficient C functions to compute the summary statistics (flagstats) for sequencing read sets.
  ☆15Updated 5 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆12Updated this week
• splatlab / squeakr
  Squeakr: An Exact and Approximate k -mer Counting System
  ☆85Updated 4 months ago
• splatlab / debgr
  deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph
  ☆30Updated 4 years ago
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆44Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 3 years ago
• ksahlin / strobemers
  A repository for generating strobemers and evalaution
  ☆78Updated last year
• vgteam / gssw
  efficient alignment of strings to partially ordered string graphs
  ☆33Updated 3 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• pmelsted / KmerStream
  Streaming algorithm for computing kmer statistics for massive genomics datasets
  ☆54Updated 5 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• muellan / metacache
  memory efficient, fast & precise taxnomomic classification system for metagenomic read mapping
  ☆59Updated last month
• jltsiren / gcsa2
  BWT-based index for graphs
  ☆71Updated 4 months ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• cosmo-team / cosmo
  Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.
  ☆52Updated last year
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated this week