pelotoncycle / bsort
Extremely fast inplace radix sort
☆42Updated 4 years ago
Related projects ⓘ
Alternatives and complementary repositories for bsort
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆62Updated 5 months ago
- Parallel Lightweight Suffix Array Algorithm.☆17Updated 7 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated 9 months ago
- Static Huffman coding☆10Updated 7 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆58Updated last year
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆103Updated 9 years ago
- A cheatsheet for most common Stringology tasks☆15Updated 3 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 3 years ago
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 3 years ago
- TU DOrtmund lossless COMPression framework☆17Updated 2 months ago
- Parallel Block GZIP☆49Updated 8 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 5 years ago
- A tool for merging large BWTs☆26Updated 3 years ago
- Compact Tree Representation☆16Updated 7 years ago
- ☆19Updated 4 years ago
- Succinct Data Structure Library☆105Updated 11 years ago
- Fast and cache-efficient full-text pangenome index☆25Updated last week
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 3 years ago
- ☆12Updated last year
- Succinct Data Structure Library 3.0☆86Updated 2 months ago
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- ☆25Updated 3 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Fast C functions for the computing the positional popcount (pospopcnt).☆53Updated 4 years ago
- Compact Data Structures Library☆124Updated 10 years ago
- Dynamic succinct/compressed data structures☆111Updated 6 months ago