Alternatives and similar repositories for ips2ra

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

• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 5 years ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆19Updated last month
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆163Updated 7 months ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆38Updated 2 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆96Updated 3 weeks ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• mklarqvist / positional-popcount
  Fast C functions for the computing the positional popcount (pospopcnt).
  ☆55Updated 5 years ago
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆123Updated 7 months ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• 1ykos / patchmap
  A fast and memory efficient hashmap using sorting to resolve collisions
  ☆43Updated 4 years ago
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆47Updated 8 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated last month
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆112Updated 8 months ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated last month
• justinasvd / art_map
  std::map/std::set implementation using the adaptive radix tree
  ☆15Updated 4 years ago
• stxxl / foxxll
  FOundation of stXXl and thriLL
  ☆14Updated last year
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated last year
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• WojciechMula / simd-sort
  AVX512F and AVX2 versions of quick sort
  ☆104Updated 7 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 7 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 4 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆220Updated last week
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year