refresh-bio / RADULSLinks
Ultra fast MSD radix sorter
☆11Updated 5 years ago
Alternatives and similar repositories for RADULS
Users that are interested in RADULS are comparing it to the libraries listed below
Sorting:
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆34Updated 8 months ago
- Parallel Wavelet Tree and Wavelet Matrix Construction☆25Updated 2 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- 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☆110Updated last year
- A tool for merging large BWTs☆25Updated 4 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆65Updated 2 years ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 2 months ago
- A cheatsheet for most common Stringology tasks☆14Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆13Updated 2 months ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 4 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆26Updated 4 years ago
- Succinct Data Structure Library 3.0☆95Updated last month
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆50Updated 6 years ago
- FOundation of stXXl and thriLL☆14Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated last year
- Bit packed vector of integral values☆27Updated 8 months ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆154Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- Efficient construction of the BWT using string compression☆20Updated 4 months ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated last week
- std::map/std::set implementation using the adaptive radix tree☆15Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆24Updated 3 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆15Updated 3 months ago
- R-Index-F Library for Pattern Matching☆12Updated last year