pelotoncycle / bsortLinks
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
Sorting:
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Parallel Block GZIP☆50Updated 9 years ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆67Updated 2 years ago
- Dynamic succinct/compressed data structures☆112Updated last year
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- An alignment-free, reference-free and incremental data structure for colored de Bruijn graph with application to pan-genome indexing.☆44Updated 3 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Practical Dynamic de Bruijn Graphs☆18Updated 4 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆11Updated 3 years ago
- FM-Index full-text index implementation using RRR Wavelet trees (libcds) and fast suffix sorting (libdivsufsort) including experimental r…☆107Updated 10 years ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- BlastGraph is a new tool for computing intensive approximate pattern matching in a sequence graph or a de-Bruijn graph. Given an oriented…☆12Updated 12 years ago
- ☆20Updated 5 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated last month
- A tool for merging large BWTs☆26Updated 4 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆88Updated last week
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆30Updated 4 years ago
- ☆25Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- ☆10Updated last year
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 7 years ago