Alternatives and similar repositories for gsaca

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

• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last week
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• lemire / SIMDIntersections
  Vectorized intersections (research code)
  ☆16Updated 8 years ago
• michaelmaniscalco / msufsort
  msufsort parallel suffix array construction algorithm
  ☆30Updated 5 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• simongog / sdsl
  Succinct Data Structure Library
  ☆109Updated 12 years ago
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆270Updated 5 months ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆24Updated 5 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆121Updated 8 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆398Updated 5 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• fanf2 / qp
  qp tries and crit-bit tries
  ☆122Updated 3 years ago
• mettienne / tiered-vector
  Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…
  ☆50Updated last year
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• lemire / rollinghashcpp
  Rolling Hash C++ Library
  ☆189Updated last year
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆51Updated 6 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆100Updated last week
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• kampersanda / fast_succinct_trie
  String map implementation through Fast Succinct Trie
  ☆21Updated 4 years ago
• jermp / opt_vbyte
  Optimal partitioning of Variable-Byte codes for better compression and fast decoding.
  ☆17Updated 4 years ago
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year