Alternatives and similar repositories for sucds

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

• beling / bsuccinct-rs
  Rust libraries and programs focused on succinct data structures
  ☆144Updated last week
• rossanoventurini / qwt
  A Rust implementation of the Quad Wavelet Tree
  ☆42Updated 3 months ago
• vigna / sux-rs
  Rust implementations of succinct data structures
  ☆59Updated 3 weeks ago
• 10XGenomics / rust-boomphf
  Fast and scalable minimal perfect hashing for massive key sets
  ☆141Updated last year
• ajalab / fm-index
  FM-index for Rust
  ☆22Updated 3 months ago
• Daniel-Liu-c0deb0t / triple_accel
  Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…
  ☆109Updated 2 years ago
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated 2 months ago
• lakwet / voracious_sort
  Voracious radix sort
  ☆68Updated last year
• RagnarGrootKoerkamp / PtrHash
  PtrHash minimal perfect hash function
  ☆66Updated last month
• Cydhra / vers
  Succinct data structures using very efficient rank and select
  ☆125Updated last month
• CarlKCarlK / range-set-blaze
  Integer sets as fast, sorted, integer ranges with full set operations
  ☆91Updated last week
• lerouxrgd / ngt-rs
  Rust wrappers for NGT approximate nearest neighbor search
  ☆38Updated last year
• frjnn / bhtsne
  Parallel Barnes-Hut t-SNE implementation written in Rust.
  ☆88Updated last month
• jltsiren / simple-sds
  Simple succinct data structures (in Rust)
  ☆51Updated 8 months ago
• 10XGenomics / rust-shardio
  Out-of-memory sorting of large datasets map / reduce style processing
  ☆47Updated 3 weeks ago
• sdsl-rs / sdsl-rs
  A Rust interface for the Succinct Data Structure Library.
  ☆14Updated 3 years ago
• Daniel-Liu-c0deb0t / cute-nucleotides
  Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.
  ☆129Updated 4 years ago
• sstadick / rust-lapper
  Rust implementation of a fast, easy, interval tree library nim-lapper
  ☆63Updated last month
• diffeo / kodama
  Fast hierarchical agglomerative clustering in Rust.
  ☆103Updated 4 months ago
• jonhoo / ordsearch
  A Rust data structure for efficient lower-bound lookups
  ☆92Updated last year
• domodwyer / interavl
  An optimised interval tree for efficient interval stabbing
  ☆15Updated this week
• velvia / compressed-vec
  SIMD Floating point and integer compressed vector library
  ☆81Updated last year
• vigna / epserde-rs
  An ε-copy serialization/deserialization framework for Rust
  ☆154Updated 3 weeks ago
• ayazhafiz / xorf
  Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.
  ☆144Updated last year
• grantslatton / ball-tree
  A ball-tree implementation for K-NN
  ☆17Updated 11 months ago
• sstadick / gzp
  Multi-threaded Compression
  ☆165Updated 4 months ago
• rust-math / intel-mkl-src
  Redistribute Intel MKL as a crate
  ☆90Updated last year
• brurucy / indexset
  A pure-Rust two-level dynamic b-tree. This crate implements a compact set data structure that preserves its elements' sorted order and a…
  ☆99Updated last month
• ritchie46 / lsh-rs
  Locality Sensitive Hashing in Rust with Python bindings
  ☆117Updated 2 years ago
• fulmicoton / fastdivide
  ☆28Updated 9 months ago