c0D3M / Suffix-Arrays
Algorihms about Suffix Array Construction, Suffix Tree, Longest Common Prefix, Burrows Wheeler Transform,
☆11Updated 4 years ago
Related projects: ⓘ
- Compact Tree Representation☆16Updated 7 years ago
- Optimal partitioning of Variable-Byte codes for better compression and fast decoding.☆17Updated 2 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆99Updated 9 years ago
- C++ Library implementing Compressed String Dictionaries☆45Updated 2 years ago
- A flexible implementation of enhanced suffix arrays in template based C++. Supports single and multi-position wildcard. Fast queries than…☆19Updated 3 years ago
- BagMinHash - Minwise Hashing Algorithm for Weighted Sets☆26Updated 4 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆48Updated 5 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆52Updated 8 months ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 6 years ago
- Code used for the experiments in the paper "Partitioned Elias-Fano Indexes"☆37Updated 9 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 3 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆61Updated 3 months ago
- A comparison between different integer set techniques☆14Updated 6 years ago
- This program implements the following graph reordering technique: Laxman Dhulipala, Igor Kabiljo, Brian Karrer, Giuseppe Ottaviano, Serg…☆10Updated 6 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆19Updated 4 years ago
- A Space-Optimal Grammar Compression☆10Updated 3 years ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆46Updated 2 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated last year
- 🌳 A compressed rank/select dictionary exploiting approximate linearity and repetitiveness.☆11Updated 2 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆55Updated last year
- Wavelet tree based on a fixed block boosting technique☆14Updated 3 years ago
- FOundation of stXXl and thriLL☆14Updated 7 months ago
- C++ Implementation of Zip Trees☆13Updated last year
- Compact Data Structures Library☆97Updated 2 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆28Updated last year
- Efficient Prefix-Sum data structures in C++.☆24Updated 11 months ago
- Parallel Lightweight Suffix Array Algorithm.☆17Updated 7 years ago
- C++17 Implementation of Dynamic Filter Trie☆9Updated 2 years ago
- Interleaving bits from two sources using SIMD instructions.☆14Updated 6 years ago