rwanwork / Re-Pair
Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)
☆26Updated last year
Alternatives and similar repositories for Re-Pair:
Users that are interested in Re-Pair are comparing it to the libraries listed below
- Compact Data Structures Library☆98Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Implementation of the sacabench framework☆16Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 6 months ago
- Compact Tree Representation☆16Updated 8 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆29Updated 6 years ago
- Dynamic succinct/compressed data structures☆112Updated 10 months ago
- Compact Data Structures Library☆124Updated 10 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 10 months ago
- linear time suffix array construction algorithm☆12Updated 8 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- Paper Collection for Stringologists☆17Updated 4 months ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- Experiments with array layouts for comparison-based searching☆82Updated last year
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Succinct data structures in C/C++☆87Updated 5 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Fast compressed trie dictionary library☆68Updated 6 months ago
- A collection of succinct data structures☆202Updated last year
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- ☆49Updated 5 years ago