Alternatives and similar repositories for sdsl-lite:

Users that are interested in sdsl-lite are comparing it to the libraries listed below

• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 10 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆152Updated 8 months 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
• fclaude / libcds
  Compact Data Structures Library
  ☆124Updated 10 years ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆106Updated 11 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆63Updated 10 months ago
• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆84Updated last year
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆62Updated last year
• rizkg / BBHash
  Bloom-filter based minimal perfect hash function library
  ☆254Updated 2 years ago
• patflick / psac
  Parallel Suffix Array, LCP Array, and Suffix Tree Construction
  ☆49Updated 5 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆43Updated 7 months ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆98Updated 2 years ago
• nicolaprezza / Re-Pair
  A space-efficient compressor based on the Re-Pair grammar
  ☆11Updated 8 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• dynatrace-research / set-sketch-paper
  SetSketch: Filling the Gap between MinHash and HyperLogLog
  ☆49Updated 3 years ago
• jermp / sshash
  A compressed, associative, exact, and weighted dictionary for k-mers.
  ☆84Updated last week
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆31Updated 3 months ago
• splatlab / cqf
  A General-Purpose Counting Filter: Counting Quotient Filter
  ☆127Updated last year
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 4 years ago
• dominikkempa / zip-tree
  C++ Implementation of Zip Trees
  ☆14Updated 2 years ago
• vigna / sux
  Succinct data structures in C/C++
  ☆87Updated 6 months ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆16Updated 3 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆27Updated 2 months ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆15Updated 6 years ago
• ot / succinct
  A collection of succinct data structures
  ☆201Updated last year
• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated 5 months ago