Alternatives and similar repositories for lzrr

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

• 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
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• jermp / s_indexes
  Universe-sliced indexes in C++.
  ☆18Updated 2 years ago
• simongog / surf
  SUccinct Retrieval Framework
  ☆21Updated 9 years ago
• richox / zmolly
  PPM compressor with high compression ratio.
  ☆33Updated 7 years ago
• kampersanda / tongrams-rs
  Rust library providing fast language model queries in compressed space
  ☆25Updated 3 years ago
• jermp / tongrams
  A C++ library providing fast language model queries in compressed space.
  ☆132Updated 2 years ago
• farruggia / bc-zip
  Bicriteria Data Compressor
  ☆14Updated 7 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• korpling / graphANNIS
  This is a new backend implementation of the ANNIS linguistic search and visualization system.
  ☆18Updated last month
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 2 years ago
• ot / path_decomposed_tries
  Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".
  ☆57Updated 2 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• unicode-org / unilex
  Lexical data at Unicode
  ☆70Updated last year
• skeeto / xf8
  8-bit Xor Filter in C99
  ☆62Updated 5 years ago
• splatlab / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆15Updated 7 years ago
• gvinciguerra / BlockEpsilonTree
  🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.
  ☆15Updated 3 years ago
• MitI-7 / WaveletMatrix
  implementation of dynamic wavelet matrix(tree) and static wavelet matrix
  ☆23Updated 6 years ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• kapenga / LittleBit
  LittleBit is a pure Huffman coding compression algorithm with the option of random access reading while offering competitive compression …
  ☆14Updated 4 years ago
• rwanwork / Re-Pair
  Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)
  ☆26Updated 2 years ago
• ByteHamster / LeMonHash
  Learned Monotone Minimal Perfect Hashing
  ☆31Updated 8 months ago
• vigna / sux
  Succinct data structures in C/C++
  ☆91Updated last year
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• tov / succinct-rs
  Succinct Data Structures for Rust
  ☆58Updated 5 months ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 9 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago