Alternatives and similar repositories for topkapi

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

• tobc / dartminhash
  DartMinHash: Fast Sketching for Weighted Sets
  ☆12Updated last month
• oertl / hyperloglog-sketch-estimation-paper
  Paper about the estimation of cardinalities from HyperLogLog sketches
  ☆64Updated 4 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 6 months ago
• oertl / probminhash
  ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity
  ☆44Updated 5 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆10Updated 5 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆158Updated last year
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆35Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆114Updated last month
• amgt-d1 / DPC
  Daichi Amagata and Takahiro Hara, SIGMOD2021
  ☆15Updated last year
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• MatteoCeregini / quad-wavelet-tree
  ☆11Updated 2 years ago
• jeffrey-xiao / probabilistic-collections-rs
  ☆16Updated 3 years ago
• ParAlg / gbbs
  GBBS: Graph Based Benchmark Suite
  ☆215Updated last month
• oertl / treeminhash
  TreeMinHash: Fast Sketching for Weighted Jaccard Similarity Estimation
  ☆17Updated 5 months ago
• puzzlef / leiden-communities-openmp
  Design of OpenMP-based Parallel Leiden algorithm for community detection.
  ☆17Updated 9 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated 2 years ago
• chhylp123 / FMtree
  FMtree: A fast locating algorithm of FM-indexes for genomic data
  ☆18Updated 8 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆25Updated 2 years ago
• RabbitBio / RabbitKSSD
  RabbitKSSD: accelerating genome distance estimation on modern multi-core architectures
  ☆12Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• PASSIONLab / ELBA
  Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly
  ☆16Updated last year
• brc7 / RACEKernels
  RACE sketches for kernel density estimation (KDE)
  ☆14Updated 6 years ago
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆17Updated 7 months ago
• brj0 / nndescent
  C++/Python implementation of Nearest Neighbor Descent for efficient approximate nearest neighbor search
  ☆23Updated last year
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆108Updated 11 years ago
• arun-sub / bwa-mem2
  Building upon BWA-MEM2, this repository includes performance improvements to the seeding and mate-rescue steps.
  ☆13Updated 4 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆67Updated 2 years ago
• brc7 / DiversitySampling
  ☆10Updated 3 years ago