Alternatives and similar repositories for Re-Pair

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

• dominikkempa / faster-minuter
  Wavelet tree based on a fixed block boosting technique
  ☆16Updated 4 years ago
• koeppl / stringsheet
  A cheatsheet for most common Stringology tasks
  ☆14Updated 4 years ago
• davidecenzato / PFP-eBWT
  Implementation of eBWT using Prefix-free parse (PFP)
  ☆14Updated 5 months ago
• jltsiren / bwt-merge
  A tool for merging large BWTs
  ☆24Updated 5 years ago
• nicolaprezza / BWTIL
  BWT Text Indexing Library: a set of tools to work with BWT-based text indexes
  ☆25Updated 3 years ago
• nicolaprezza / r-index
  An optimal space run-length Burrows-Wheeler transform full-text index
  ☆66Updated 2 years ago
• xxsds / sdsl-lite
  Succinct Data Structure Library 3.0
  ☆101Updated 3 weeks ago
• xxsds / DYNAMIC
  Dynamic succinct/compressed data structures
  ☆112Updated 3 weeks ago
• drnatebrown / r-index-f
  R-Index-F Library for Pattern Matching
  ☆12Updated last year
• felipelouza / gsa-is
  Inducing enhanced suffix arrays for string collections [DCC'16, TCS 2017]
  ☆26Updated last month
• jamshed / CaPS-SA
  Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays
  ☆17Updated 6 months ago
• kurpicz / libdivsufsort
  A lightweight suffix-sorting library enhanced with LCP construction
  ☆12Updated 5 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
• ddiazdom / grlBWT
  Efficient construction of the BWT using string compression
  ☆20Updated 7 months ago
• felipelouza / gsufsort
  gsufsort: building suffix arrays, LCP-arrays and BWTs for string collections [AMB 2020]
  ☆27Updated 10 months ago
• IlyaGrebnov / libsais
  The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…
  ☆232Updated 4 months ago
• cartoonist / kseqpp
  Fast FASTA/Q parser and writer (C++ re-implementation of kseq library)
  ☆56Updated last year
• refresh-bio / RADULS
  Ultra fast MSD radix sorter
  ☆10Updated 5 years ago
• kurpicz / saca-bench
  Collection of Suffix Array Construction Algorithms (SACAs)
  ☆33Updated 6 years ago
• sacabench / sacabench
  Implementation of the sacabench framework
  ☆18Updated 4 years ago
• gmarcais / compact_vector
  Bit packed vector of integral values
  ☆28Updated 11 months ago
• dnbaker / sketch
  C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings
  ☆157Updated last year
• kurpicz / pwm
  Parallel Wavelet Tree and Wavelet Matrix Construction
  ☆25Updated 2 years ago
• ips4o / ips2ra
  In-place Parallel Super Scalar Radix Sort (IPS²Ra)
  ☆34Updated 11 months ago
• bingmann / cobs
  COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)
  ☆88Updated last year
• GuillaumeHolley / BloomFilterTrie
  An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.
  ☆44Updated 3 years ago
• mpetri / FM-Index
  FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…
  ☆108Updated 10 years ago
• vicLeva / bqf
  Implementation of a Backpack Quotient Filter
  ☆13Updated 6 months ago
• shubhamchandak94 / HARC
  Fastq compression
  ☆18Updated 6 years ago
• Poyias / mBonsai
  Compact Tree Representation
  ☆16Updated 8 years ago