Alternatives and similar repositories for saca-bench

Users that are interested in saca-bench are comparing it to the libraries listed below

• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 7 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆17Updated 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…
  ☆107Updated 10 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated this week
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆216Updated last week
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated 11 months ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated 11 months ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• felipelouza / egsa
  Generalized enhanced suffix array construction in external memory [CPM'13, AMB 2017]
  ☆16Updated 4 years ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆388Updated 5 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆266Updated last month
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆64Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 4 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated 2 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated 2 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 4 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 6 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• fclaude / libcds
  Compact Data Structures Library
  ☆128Updated 10 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆155Updated last year
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated last month
• jlabeit / parallel-divsufsort
  Parallel Lightweight Suffix Array Algorithm.
  ☆18Updated 8 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 7 years ago
• ot / succinct
  A collection of succinct data structures
  ☆207Updated last year
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 8 years ago