Alternatives and similar repositories for RAMBO_MSMT

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

• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆35Updated 5 months ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 3 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆12Updated 3 weeks ago
• lorenzhs / BuRR
  Bumped Ribbon Retrieval and Approximate Membership Query
  ☆45Updated last month
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆37Updated 2 years ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• harald-lang / tree-encoded-bitmaps
  ☆38Updated 5 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• jbapple / libfilter
  High-speed Bloom filters and taffy filters for C, C++, and Java
  ☆35Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• cuckoo-trie / cuckoo-trie-code
  ☆54Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆45Updated 10 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• jermp / sshash
  📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.
  ☆88Updated 3 weeks ago
• llersch / cpp_random_distributions
  Additional C++11 Random Distributions
  ☆19Updated last year
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated 2 weeks ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• speedskater / hot
  HOT - Height Optimized Trie
  ☆156Updated 7 years ago
• dynatrace-research / ShuffleBench
  A benchmark for generic, large-scale shuffle operations on continuous stream of data, implemented with state-of-the-art stream processing…
  ☆13Updated 2 months ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆33Updated 6 months ago
• jeffrey-xiao / probabilistic-collections-rs
  ☆15Updated 2 years ago
• wuwuz / Vacuum-Filter
  ☆52Updated 8 months ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 2 weeks ago