tudocomp / tudocompLinks
TU DOrtmund lossless COMPression framework
☆19Updated last year
Alternatives and similar repositories for tudocomp
Users that are interested in tudocomp are comparing it to the libraries listed below
Sorting:
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Implementation of the sacabench framework☆18Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Paper Collection for Stringologists☆17Updated 2 months ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Compact Data Structures Library☆101Updated 3 years ago
- Succinct Data Structure Library☆107Updated 12 years ago
- Succinct Data Structure Library 3.0☆96Updated 2 months ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆86Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 years ago
- Space efficient (graph) algorithms☆18Updated 5 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- Ultra fast MSD radix sorter☆10Updated 5 years ago
- Compact Data Structures Library☆128Updated 11 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 3 months ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Bloom-filter based minimal perfect hash function library☆267Updated 3 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- C++17 implementation of memory-efficient dynamic tries☆58Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 9 months ago