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
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆33Updated 6 months ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- 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
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- Bit packed vector of integral values☆27Updated 6 months ago
- FOundation of stXXl and thriLL☆14Updated last year
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆45Updated 10 months ago
- Succinct Data Structure Library 3.0☆94Updated 3 months ago
- Implementation of a Backpack Quotient Filter☆12Updated 3 weeks ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 2 weeks ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 5 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆27Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated 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
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated this week
- Bloom-filter based minimal perfect hash function library☆266Updated 2 weeks ago
- Efficient construction of the BWT using string compression☆18Updated 2 months ago
- Compact Tree Representation☆16Updated 8 years ago
- RabbitKSSD: accelerating genome distance estimation on modern multi-core architectures☆11Updated last year
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year