Alternatives and similar repositories for Re-Pair

Users that are interested in Re-Pair are comparing it to the libraries listed below

• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 years ago
• migumar2 / libCSD
  C++ Library implementing Compressed String Dictionaries
  ☆46Updated 3 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆85Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆108Updated last year
• vnmakarov / mum-hash
  Hashing functions and PRNGs based on them
  ☆166Updated this week
• rantala / string-sorting
  A collection of string sorting algorithms
  ☆55Updated 3 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated last year
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆232Updated 2 months ago
• simongog / sdsl
  Succinct Data Structure Library
  ☆108Updated 12 years ago
• y-256 / libdivsufsort
  A lightweight suffix-sorting library
  ☆397Updated 5 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• kampersanda / xcdat
  Fast compressed trie dictionary library
  ☆71Updated last year
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆35Updated 2 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆49Updated 6 years ago
• lemire / fastrange
  A fast alternative to the modulo reduction
  ☆314Updated 4 years ago
• cruppstahl / libvbyte
  A fast implementation for varbyte 32bit/64bit integer compression
  ☆120Updated 8 years ago
• AntonioFerrandez / MergedTrie
  MergedTrie code
  ☆12Updated 5 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆18Updated 4 years ago
• WojciechMula / sse-popcount
  SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html
  ☆350Updated last year
• simdhash / clhash
  C library implementing the ridiculously fast CLHash hashing function
  ☆280Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆99Updated last week
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 2 years ago
• stgatilov / linear-vs-binary-search
  Comparing linear and binary searches
  ☆42Updated 5 years ago
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated 2 weeks ago
• minjaehwang / bitsetsort
  Bitset Sort, a faster std::sort replacement.
  ☆78Updated 3 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆107Updated 10 years ago