Alternatives and similar repositories for psac:

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

• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆104Updated 9 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 4 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆62Updated 7 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 7 months ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆152Updated 5 months ago
• mpetri / recursive_graph_bisection
  This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…
  ☆10Updated 6 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆92Updated 4 months ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 2 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆105Updated 11 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆57Updated 8 months ago
• amplab / succinct-cpp
  Succinct C++
  ☆25Updated 4 years ago
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• migumar2 / uiHRDC
  Suite of universal indexes for Highly Repetitive Document Collections
  ☆20Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆54Updated last year
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated 11 months ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆61Updated last year
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆33Updated last year
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆25Updated last month
• ot / ds2i
  A library of inverted index data structures
  ☆148Updated 2 years ago
• TomerEven / Prefix-Filter
  Prefix Filter: Practically and Theoretically Better Than Bloom.
  ☆48Updated 2 years ago
• roberto-trani / mphf_benchmark
  A Benchmark of Minimal Perfect Hash Function Algorithms.
  ☆35Updated 2 years ago