sacabench / sacabenchLinks
Implementation of the sacabench framework
☆18Updated 4 years ago
Alternatives and similar repositories for sacabench
Users that are interested in sacabench are comparing it to the libraries listed below
Sorting:
- Dynamic succinct/compressed data structures☆112Updated last year
- TU DOrtmund lossless COMPression framework☆19Updated last year
- Succinct Data Structure Library 3.0☆96Updated 2 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Compact Tree Representation☆16Updated 8 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆14Updated 7 years ago
- A lightweight suffix-sorting library☆395Updated 5 years ago
- In-place Parallel Super Scalar Samplesort (IPS⁴o)☆164Updated 10 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- The libsais library provides fast linear-time construction of suffix array (SA), generalized suffix array (GSA), longest common prefix (L…☆226Updated 2 months ago
- A space-efficient compressor based on the Re-Pair grammar☆10Updated 8 years ago
- BitMagic Library☆433Updated 2 months 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.☆22Updated 3 years ago
- Collection of Suffix Array Construction Algorithms (SACAs)☆33Updated 6 years ago
- Paper Collection for Stringologists☆17Updated 2 months ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 10 months ago
- Bloom-filter based minimal perfect hash function library☆268Updated 3 months ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- ☆11Updated 2 years ago
- This is a header only library offering a variety of dynamically growing concurrent hash tables. That all work by dynamically migrating th…☆116Updated 10 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- C++ Implementation of Zip Trees☆14Updated 3 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Succinct Data Structure Library☆107Updated 12 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆51Updated 6 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
- KaTric: scalable distributed-memory triangle counting made in Karlsruhe☆14Updated 2 years ago