pelotoncycle / bsort
Extremely fast inplace radix sort
☆42Updated 5 years ago
Alternatives and similar repositories for bsort:
Users that are interested in bsort are comparing it to the libraries listed below
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 10 months ago
- Compact Data Structures Library☆98Updated 2 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆108Updated 10 years ago
- Dynamic succinct/compressed data structures☆112Updated 10 months ago
- Parallel Block GZIP☆50Updated 8 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 2 years ago
- Succinct Data Structure Library 3.0☆94Updated this week
- Compact Data Structures Library☆124Updated 10 years ago
- A tool for merging large BWTs☆26Updated 4 years ago
- Succinct Data Structure Library☆106Updated 11 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Parallel Lightweight Suffix Array Algorithm.☆18Updated 8 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆43Updated 3 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆62Updated last year
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 5 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆31Updated 2 months ago
- A General-Purpose Counting Filter: Counting Quotient Filter☆127Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- C library to compute the Hamming weight of arrays☆45Updated 6 years ago
- Compact Tree Representation☆16Updated 8 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago