sacabench / sacabenchLinks
Implementation of the sacabench framework
☆17Updated 4 years ago
Alternatives and similar repositories for sacabench
Users that are interested in sacabench are comparing it to the libraries listed below
Sorting:
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- Dynamic succinct/compressed data structures☆112Updated last year
- TU DOrtmund lossless COMPression framework☆19Updated 10 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- A lightweight suffix-sorting library☆386Updated 5 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- Bloom-filter based minimal perfect hash function library☆266Updated 2 weeks ago
- C++ Implementation of Zip Trees☆14Updated 2 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆215Updated last month
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆33Updated 6 months ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆163Updated 6 months ago
- BitMagic Library☆426Updated 3 months ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆110Updated 7 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 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
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Paper Collection for Stringologists☆17Updated last week
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated 2 years ago
- C++ Library implementing Compressed String Dictionaries☆46Updated 3 years ago
- Some near drop in stl compatible hash tables that are a lot more space efficient than any other options.☆20Updated 2 years ago
- Compact Data Structures Library☆100Updated 3 years ago
- SIMD (SSE) population count --- http://0x80.pl/articles/sse-popcount.html☆346Updated last year
- Offline Dictionary-based Compression (Re-Pair, Recursive Pairing)☆25Updated 2 years ago
- Succinct Data Structure Library☆106Updated 11 years ago