turpinandrew / shuffLinks
Static Huffman coding
☆10Updated 8 years ago
Alternatives and similar repositories for shuff
Users that are interested in shuff are comparing it to the libraries listed below
Sorting:
- Bit packed vector of integral values☆27Updated 8 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆83Updated last year
- compressed, queryable variation graphs☆11Updated 10 years ago
- Go implementation of ntHash☆20Updated 4 years ago
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Extremely fast inplace radix sort☆42Updated 5 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆64Updated last year
- Highly optimized implementation of tiered vectors, a data structure for maintaining a sequence of n elements supporting access in time O(…☆50Updated last year
- ☆20Updated 5 years ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆24Updated 3 years ago
- Low memory multithreaded hash table☆24Updated 10 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆55Updated last year
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆82Updated last year
- A fast implementation for varbyte 32bit/64bit integer compression☆119Updated 8 years ago
- Succinct Data Structures for Rust☆57Updated 3 months ago
- FM-index representation of a de Bruijn graph☆27Updated 8 years ago
- Fast and cache-efficient full-text pangenome index☆29Updated this week
- Parallel Block GZIP☆50Updated 9 years ago
- 📖 🧬 SSHash is a compressed, associative, exact, and weighted dictionary for k-mers.☆89Updated last week
- Compact Data Structures Library☆128Updated 11 years ago
- Dynamic succinct/compressed data structures☆110Updated last year
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 7 years ago
- BITS: Binary Interval Search☆25Updated 8 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 7 years ago
- Compact Data Structures Library☆101Updated 3 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Five implementations of double linked lists to demonstrate generic data structures in C☆17Updated 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