waYne1337 / gsaca
linear time suffix array construction algorithm
☆12Updated 8 years ago
Alternatives and similar repositories for gsaca:
Users that are interested in gsaca are comparing it to the libraries listed below
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Dynamic succinct/compressed data structures☆112Updated 11 months ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 10 months ago
- External memory suffix array construction using inducing☆10Updated 4 years ago
- LZ Double factor Factorization.☆11Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- An encoder/decoder collection for a sequence of integers☆32Updated 12 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 3 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- msufsort parallel suffix array construction algorithm☆29Updated 4 years ago
- Induced Suffix Array with LCP construction (Mirror)☆23Updated 12 years ago
- A C++ library for integer array compression☆29Updated 3 years ago
- Marlin: high throughput entropy compressor☆30Updated last year
- Compact Data Structures Library☆124Updated 10 years ago
- String map implementation through Fast Succinct Trie☆21Updated 3 years ago
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 8 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- A Space-Optimal Grammar Compression☆10Updated 4 years ago
- Vectorized intersections (research code)☆15Updated 8 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- TU DOrtmund lossless COMPression framework☆17Updated 7 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 7 months ago
- Pruning elements in SIMD vectors (i.e., packing left elements)☆65Updated last year
- A collection of string sorting algorithms☆55Updated 3 years ago