Alternatives and similar repositories for dartminhash:

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

• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 4 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 4 years ago
• brc7 / DiversitySampling
  ☆10Updated 2 years ago
• bioinfologics / sdg
  Sequence Distance Graph framework: graph + reads + mapping + analysis
  ☆25Updated 2 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
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• dib-lab / MQF
  ☆12Updated last year
• Kingsford-Group / splitsbt
  ☆18Updated 6 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 4 years ago
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 5 years ago
• Kingsford-Group / miniception
  ☆13Updated 5 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆11Updated 9 months ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 4 years ago
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 6 years ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆27Updated last month
• OndrejSladky / fmsi
  FMSI is a highly memory efficient exact k-mer set index based on masked superstrings and the masked Burrows-Wheeler transform
  ☆20Updated 3 months ago
• ocxtal / dozeu
  SIMD-parallel BLAST X-drop DP on sequence graphs
  ☆24Updated 11 months ago
• medvedevgroup / UST
  ☆25Updated 4 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• jeizenga / wfalm
  Refinements of the WFA alignment algorithm with better complexity
  ☆26Updated 3 years ago
• SJTU-CGM / CDKAM
  ☆10Updated 4 years ago
• lgautier / mashing-pumpkins
  Minhash and maxhash library in Python, combining flexibility, expressivity, and performance.
  ☆21Updated 4 months ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• Daniel-Liu-c0deb0t / dlb-kmer-sampling
  Optimal distance lower bound k-mer sampling.
  ☆12Updated 10 months ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 4 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆43Updated last year
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• edawson / svaha
  Convert structural variants to sequence graphs [ VCF + FASTA ---> GFA ]
  ☆12Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆64Updated last year
• Kingsford-Group / remuval
  ☆12Updated 5 years ago