tobc / dartminhash

Related projects: ⓘ

• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 3 years ago
• RUSH-LAB / RAMBO
  ☆19Updated 4 years ago
• brc7 / DiversitySampling
  ☆9Updated 2 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆10Updated last month
• 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 11 years ago
• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• jts / dbgfm
  FM-index representation of a de Bruijn graph
  ☆27Updated 7 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆14Updated 3 years ago
• jermp / lphash
  Fast and compact locality-preserving minimal perfect hashing for k-mer sets.
  ☆42Updated 10 months ago
• Kingsford-Group / miniception
  ☆12Updated 4 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• Malfoy / Miekki
  Minhash Index Extended to Knead Kmer Intersection
  ☆11Updated 4 years ago
• lh3 / rmaxcut
  An experimental tool to find approximate max-cuts in a large graph
  ☆11Updated 3 years ago
• Kingsford-Group / splitsbt
  ☆18Updated 6 years ago
• dib-lab / MQF
  ☆12Updated 11 months ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆12Updated last month
• ekg / drawbwt
  vector illustrations of BWT based searching on small strings
  ☆16Updated 5 years ago
• csirac / dynamicDBG
  Practical Dynamic de Bruijn Graphs
  ☆18Updated 3 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆57Updated last year
• Malfoy / PAC
  ☆10Updated 6 months ago
• mohsenzakeri / Movi
  Fast and cache-efficient full-text pangenome index
  ☆25Updated last week
• nicolaprezza / lz-rlbwt
  Run-length compressed BWT with LZ77 sampled suffix array
  ☆10Updated 2 years ago
• bioinfologics / sdg
  Sequence Distance Graph framework: graph + reads + mapping + analysis
  ☆25Updated 2 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 6 years ago
• ratschlab / graph_annotation
  Code accompanying the publication for compressed graph annotation
  ☆13Updated 5 years ago
• COMBINE-lab / SkipPatch
  dynamic-updateable-index
  ☆11Updated 8 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 3 years ago
• txje / c-minhash
  Simple and fast MinHash implementation in C with Python wrapper
  ☆13Updated 4 years ago
• ekg / succinct-graph
  compressed, queryable variation graphs
  ☆11Updated 9 years ago
• felipelouza / egsa
  Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]
  ☆15Updated 3 years ago