turpinandrew / shuff
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
- Bit packed vector of integral values☆27Updated 2 months ago
- BWT Text Indexing Library: a set of tools to work with BWT-based text indexes☆25Updated 3 years ago
- A fast and memory efficient hashmap using sorting to resolve collisions☆43Updated 4 years ago
- Relative data structures based on the BWT☆12Updated 6 years ago
- Universe-sliced indexes in C++.☆18Updated 2 years ago
- Run-length compressed BWT with LZ77 sampled suffix array☆10Updated 3 years ago
- Prefix Free Parsing☆8Updated last year
- Minhash Index Extended to Knead Kmer Intersection☆11Updated 5 years ago
- Hail: extract lines from a file, a la `head -n x | tail -n y`☆9Updated 4 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆54Updated last year
- Low memory multithreaded hash table☆24Updated 10 years ago
- Suite of universal indexes for Highly Repetitive Document Collections☆20Updated 4 years ago
- compressed, queryable variation graphs☆11Updated 9 years ago
- Space-Efficient, High-Performance Rank & Select Structures on Uncompressed Bit Sequences☆15Updated 6 years ago
- FM-index representation of a de Bruijn graph☆27Updated 7 years ago
- A flexible and efficient C++ implementation of the Binary Interpolative Coding algorithm.☆29Updated 2 years ago
- succinct labeled graphs with collections and paths☆15Updated 6 years ago
- ☆12Updated last year
- Fast and cache-efficient full-text pangenome index☆27Updated last month
- Header-only, gzread-like reader for gzip, bz2, and xz.☆12Updated 6 years ago
- An efficient external-memory algorithm for the construction of minimal perfect hash functions☆63Updated 10 months ago
- The dream accurate approximate set cardinality estimator based on 3-bit HyperLogLog. More accurate than Redis HyperLogLog.☆55Updated 4 years ago
- Compact Data Structures Library☆98Updated 2 years ago
- Implementation of the data structures described in the paper "Fast Compressed Tries using Path Decomposition".☆56Updated 2 years ago
- Mantis: A Fast, Small, and Exact Large-Scale Sequence-Search Index☆81Updated last year
- Compact Tree Representation☆16Updated 8 years ago
- A SIMD-based C++ library providing rank/select queries over mutable bitmaps.☆35Updated 2 years ago
- Burrows-Wheeler Transform and FM-index in golang☆20Updated 2 years ago
- BWT, FM-index and bits vector for analyzing DNA sequence data.☆17Updated 7 years ago
- Succinct Data Structures for Rust☆57Updated last year