Alternatives and similar repositories for sequitur

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

• scotts / streamflow
  Lock-free multithreaded memory allocation
  ☆110Updated 9 years ago
• patmorin / arraylayout
  Experiments with array layouts for comparison-based searching
  ☆85Updated last year
• vigna / sux
  Succinct data structures in C/C++
  ☆92Updated last year
• fclaude / libcds
  Compact Data Structures Library
  ☆129Updated 11 years ago
• fclaude / libcds2
  Compact Data Structures Library
  ☆101Updated 3 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
• google / redgrep
  ♥ Janusz Brzozowski
  ☆162Updated last year
• fast-pack / MaskedVByte
  Fast decoder for VByte-compressed integers
  ☆125Updated last month
• google / refr
  A framework for building reranking models.
  ☆28Updated 10 years ago
• andralex / MedianOfNinthers
  ☆50Updated 5 years ago
• zvelo / cmph
  C Minimal Perfect Hashing Library
  ☆88Updated 8 years ago
• jermp / mutable_rank_select
  A SIMD-based C++ library providing rank/select queries over mutable bitmaps.
  ☆36Updated 2 years ago
• mit-pdos / perflock
  RWMutex for sharing of multicore machines.
  ☆18Updated 6 years ago
• bpowers / mstat
  fine-grained, cgroup-based tool for profiling memory usage over time of a process tree
  ☆50Updated last week
• aclements / commuter
  Automated multicore scalability testing tool
  ☆88Updated 9 years ago
• CountOnes / hamming_weight
  C library to compute the Hamming weight of arrays
  ☆51Updated 7 years ago
• HazyResearch / EmptyHeaded
  Your worst case is our best case.
  ☆143Updated 8 years ago
• jermp / interpolative_coding
  A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.
  ☆31Updated 2 years ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆65Updated last year
• jMotif / GI
  Sequitur and RePair grammar induction algorithms implementation
  ☆27Updated 2 years ago
• mackstann / hash-table-shootout
  A benchmark of some prominent C/C++ hash table implementations
  ☆105Updated 6 years ago
• fast-pack / dictionary
  High-performance dictionary coding
  ☆108Updated 8 years ago
• efficient / ffbf
  Feed-forward Bloom filters
  ☆53Updated 14 years ago
• ot / succinct
  A collection of succinct data structures
  ☆211Updated last year
• CharithYMendis / Helium
  Helium: Lifting High-Performance Stencil Kernels from Stripped x86 Binaries to Halide DSL Code
  ☆48Updated 9 years ago
• ShimProfiler / SHIM
  ☆55Updated 10 years ago
• efficient / rankselect
  Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences
  ☆55Updated last year
• lemire / fastscancount
  Fast implementations of the scancount algorithm: C++ header-only library
  ☆27Updated 6 years ago
• ot / partitioned_elias_fano
  Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"
  ☆40Updated 10 years ago
• smart-tool / smart
  String Matching Algorithms Research Tool
  ☆108Updated last year