Alternatives and similar repositories for sacabench

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

• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆113Updated 3 weeks ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated last month
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated last year
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆25Updated 2 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆67Updated 2 years ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆10Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆398Updated 5 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated 2 weeks ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 3 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆22Updated 3 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆232Updated 4 months ago
• SaschaWitt / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆165Updated last year
• TooBiased / growt
  This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…
  ☆117Updated last year
• tlk00 / BitMagic
  BitMagic Library
  ☆438Updated 4 months ago
• MatteoCeregini / quad-wavelet-tree
  ☆11Updated 2 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆48Updated 4 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆108Updated 10 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• bingmann / malloc_count
  Method to measure the amount of allocated memory of a program at run-time.
  ☆70Updated 3 years ago