Alternatives and similar repositories for lzrr

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

• stringologytimes / StringologyTimes
  Paper Collection for Stringologists
  ☆17Updated last month
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 3 years ago
• kampersanda / cda-tries
  Compressed double-array tries for static string dictionaries
  ☆11Updated 6 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 3 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• gvinciguerra / la_vector
  🔶 Compressed bitvector/container supporting efficient random access and rank queries
  ☆46Updated last year
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 10 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 3 years ago
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆63Updated 6 years ago
• turpinandrew / shuff
  Static Huffman coding
  ☆10Updated 8 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 7 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆79Updated 4 years ago
• aboffa / CoCo-trie
  COllapsed and COmpressed trie: a data-aware compressed string dictionary
  ☆36Updated 11 months ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆115Updated last month
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆33Updated 7 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated 2 years ago
• kampersanda / poplar-trie
  C++17 implementation of memory-efficient dynamic tries
  ☆58Updated 3 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆19Updated last year
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• pascaldekloe / flit
  fixed-length integer trim
  ☆35Updated 2 years ago
• farruggia / bc-zip
  Bicriteria Data Compressor
  ☆14Updated 8 years ago
• tudocomp / compact_sparse_hash
  A blend of the compact and sparse hash table implementations.
  ☆15Updated 4 years ago
• sldty / kitbag
  Kitbag is a content-addressed versioned tree-structured graph-based datastore.
  ☆14Updated 4 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated 2 years ago
• clausecker / pospopcnt
  AVX-2 vectorised 8-bit positional popcount for Go
  ☆23Updated 5 years ago
• jermp / essentials
  Essential C++ utilities.
  ☆14Updated 2 months ago