nicolaprezza / Re-Pair

Related projects ⓘ

Alternatives and complementary repositories for Re-Pair

• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 3 years ago
• itomomoti / OnlineRlbwt
  Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.
  ☆14Updated 6 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆15Updated 3 years ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆13Updated 3 months ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆15Updated 3 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 2 years ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆111Updated 5 months ago
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆26Updated last year
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆86Updated 2 months ago
• kg86 / lzd
  LZ Double factor Factorization.
  ☆11Updated 7 years ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆28Updated 5 years ago
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆24Updated last year
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆26Updated 3 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆58Updated last year
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆11Updated 4 years ago
• jltsiren / relative-fm
  Relative data structures based on the BWT
  ☆12Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 7 years ago
• waYne1337 / gsaca
  linear time suffix array construction algorithm
  ☆12Updated 8 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆30Updated 7 months ago
• ot / emphf
  An efficient external-memory algorithm for the construction of minimal perfect hash functions
  ☆61Updated 5 months ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆10Updated 3 months ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆12Updated 2 months ago
• kurpicz / libdivsufsort
  A lightweight suffix-sorting library enhanced with LCP construction
  ☆11Updated 4 years ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆83Updated 9 months ago
• tudocomp / tudocomp
  TU DOrtmund lossless COMPression framework
  ☆17Updated 2 months ago
• TooBiased / DySECT
  Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.
  ☆20Updated 2 years ago
• IlyaGrebnov / libsais
  libsais is a library for linear time suffix array, longest common prefix array and burrows wheeler transform construction based on induce…
  ☆184Updated 3 months ago
• ByteHamster / SicHash
  A (Minimal) Perfect Hash Function based on irregular cuckoo hashing, retrieval, and overloading.
  ☆14Updated last month
• kurpicz / sais-lite-lcp
  Induced Suffix Array and LCP construction based on the SAIS algorithm.
  ☆11Updated 4 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆103Updated 9 years ago