pelotoncycle / bsortLinks
Extremely fast inplace radix sort
☆43Updated 5 years ago
Alternatives and similar repositories for bsort
Users that are interested in bsort are comparing it to the libraries listed below
Sorting:
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆88Updated last year
- Parallel Block GZIP☆50Updated 9 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 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
- Practical Dynamic de Bruijn Graphs☆18Updated 5 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
- Relative data structures based on the BWT☆12Updated 7 years ago
- Dynamic succinct/compressed data structures☆112Updated 2 weeks ago
- An optimal space run-length Burrows-Wheeler transform full-text index☆66Updated 2 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆65Updated last year
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- ☆20Updated 5 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
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆83Updated last year
- DartMinHash: Fast Sketching for Weighted Sets☆12Updated 3 weeks ago
- Implementation of eBWT using Prefix-free parse (PFP)☆14Updated 5 months ago
- compressed, queryable variation graphs☆11Updated 10 years ago
- A tool for merging large BWTs☆24Updated 5 years ago
- vector illustrations of BWT based searching on small strings☆16Updated 6 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- ☆24Updated 4 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- memory mapped multimap, multiset, and implicit interval tree based on an in-place parallel sort☆26Updated 4 years ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆48Updated 4 years ago
- A fast constructor of the compressed de Bruijn graph from many genomes☆42Updated last month
- deBGR: An Efficient and Near-Exact Representation of the Weighted de Bruijn Graph☆31Updated 4 years ago
- Simple and fast MinHash implementation in C with Python wrapper☆13Updated 5 months ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆43Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆156Updated last year