Alternatives and similar repositories for probminhash

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

• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 4 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆88Updated last week
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆12Updated last month
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 2 weeks ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• RUSH-LAB / RAMBO
  ☆20Updated 4 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 3 weeks ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 9 years ago
• Malfoy / PAC
  ☆10Updated last year
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• brc7 / DiversitySampling
  ☆10Updated 3 years ago
• splatlab / mantis
  Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index
  ☆81Updated last year
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆29Updated this week
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• Kingsford-Group / miniception
  ☆14Updated 5 years ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 4 years ago
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• TravisWheelerLab / AvxWindowFmIndex
  A fast, AVX2 and ARM Neon accelerated FM index library
  ☆34Updated 7 months ago
• torognes / swipe
  Smith-Waterman database searches with inter-sequence SIMD parallelisation
  ☆60Updated last year
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• alexpreynolds / sample
  Performs memory-efficient reservoir sampling on very large input files delimited by newlines
  ☆69Updated 5 years ago
• GuillaumeHolley / BlastGraph
  BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…
  ☆12Updated 12 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 8 years ago
• jean-pierreBoth / probminhash
  Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms
  ☆31Updated last month