Alternatives and similar repositories for libsais:

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

• jermp / pthash
  Fast and compact minimal perfect hash functions in C++.
  ☆214Updated this week
• jkbonfield / rans_static
  rANS coder (derived from https://github.com/rygorous/ryg_rans)
  ☆83Updated 2 years ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆29Updated 5 years ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆371Updated 4 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆254Updated last year
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 5 months ago
• samtools / htscodecs
  Custom compression for CRAM and others.
  ☆31Updated 2 months ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 7 years ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆94Updated 5 months ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• michaelmaniscalco / msufsort
  msufsort parallel suffix array construction algorithm
  ☆29Updated 4 years ago
• kurpicz / libdivsufsort
  A lightweight suffix-sorting library enhanced with LCP construction
  ☆11Updated 4 years ago
• fast-pack / streamvbyte
  Fast integer compression in C using the StreamVByte codec
  ☆388Updated last week
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆30Updated last month
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆104Updated 10 years ago
• powturbo / Turbo-Range-Coder
  TurboRC - Fastest Range Coder + Arithmetic Coding / Fastest Asymmetric Numeral Systems
  ☆80Updated last year
• voutcn / kxsort
  Fast in-place radix sort with STL-like API
  ☆46Updated 8 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 9 months ago
• zwegner / zp7
  ZP7: Zach's Peppy Parallel-Prefix-Popcountin' PEXT/PDEP Polyfill
  ☆49Updated 6 months ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• IlyaGrebnov / libbsc
  High performance block-sorting data compression library
  ☆303Updated 2 weeks ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago
• IlyaGrebnov / libcubwt
  libcubwt is a library for GPU accelerated suffix array and burrows wheeler transform construction.
  ☆35Updated 2 weeks ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆308Updated 3 years ago
• flanglet / kanzi-cpp
  Fast lossless data compression in C++
  ☆144Updated this week
• farruggia / bc-zip
  Bicriteria Data Compressor
  ☆14Updated 7 years ago
• backtrace-labs / umash
  UMASH: a fast enough hash and fingerprint with collision bounds
  ☆154Updated last month
• ips4o / ips4o
  In-place Parallel Super Scalar Samplesort (IPS⁴o)
  ☆117Updated last month
• tlk00 / BitMagic
  BitMagic Library
  ☆415Updated this week