Alternatives and similar repositories for treeminhash

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

• oertl / bagminhash
  BagMinHash - Minwise Hashing Algorithm for Weighted Sets
  ☆26Updated 4 years ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆42Updated 4 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆11Updated 2 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆13Updated 4 years ago
• dominikkempa / fsais
  External memory suffix array construction using inducing
  ☆11Updated 4 years ago
• dmllr / fast-lopq
  Fast C++ implementation of https://github.com/yahoo/lopq: Locally Optimized Product Quantization (LOPQ) model and searcher for approximat…
  ☆35Updated 5 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 3 months ago
• CMU-SAFARI / Shifted-Hamming-Distance
  Source code for the Shifted Hamming Distance (SHD) filtering mechanism for sequence alignment. Described in the Bioinformatics journal pa…
  ☆35Updated 5 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• amallia / gpu-integers-compression
  GPU-Accelerated Faster Decoding of Integer Lists
  ☆13Updated 5 years ago
• M-Flash / m-flash-cpp
  ☆15Updated 7 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• jiecchen / StreamingCC
  A C++ library for summarizing data streams
  ☆24Updated 5 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• powturbo / Turbo-Transpose
  Transpose: SIMD Integer+Floating Point Compression Filter
  ☆61Updated 5 years ago
• TU-Berlin-DIMA / OpenCL-SIMD-hashing
  This repository contains our work on efficient SIMD vectorization methods for hashing in OpenCL. It was first published at the 21th Inter…
  ☆11Updated 6 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆47Updated 6 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 9 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• 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
• darrenstrash / quick-cliques
  Quickly compute all maximal cliques of a graph
  ☆79Updated 6 years ago
• RUSH-LAB / RAMBO
  ☆20Updated 4 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago