refresh-bio / RADULS
Ultra fast MSD radix sorter
☆11Updated 4 years ago
Alternatives and similar repositories for RADULS:
Users that are interested in RADULS are comparing it to the libraries listed below
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 6 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆30Updated last month
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated last year
- A tool for merging large BWTs☆26Updated 4 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago
- Compact Tree Representation☆16Updated 7 years ago
- Implementation of a Backpack Quotient Filter☆11Updated 7 months ago
- R-Index-F Library for Pattern Matching☆13Updated 7 months ago
- Fast in-place radix sort with STL-like API☆46Updated 8 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 6 months ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆62Updated last year
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆10Updated last week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆105Updated 10 years ago
- Dynamic succinct/compressed data structures☆112Updated 9 months ago
- FOundation of stXXl and thriLL☆14Updated last year
- A space-efficient compressor based on the Re-Pair grammar☆11Updated 7 years ago
- Bit packed vector of integral values☆27Updated last month
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 9 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- Implementation of the sacabench framework☆16Updated 3 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated last year
- Succinct Data Structure Library 3.0☆94Updated 6 months ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 6 months ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago