10XGenomics / rust-boomphfLinks
Fast and scalable minimal perfect hashing for massive key sets
☆142Updated last year
Alternatives and similar repositories for rust-boomphf
Users that are interested in rust-boomphf are comparing it to the libraries listed below
Sorting:
- Succinct Data Structures for Rust☆57Updated 3 months ago
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated this week
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 5 months ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆128Updated 4 years ago
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆108Updated 2 years ago
- PtrHash minimal perfect hash function☆70Updated 2 weeks ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆62Updated 2 months ago
- Collection of succinct data structures in Rust☆99Updated last month
- Rust libraries and programs focused on succinct data structures☆148Updated this week
- FM-index for Rust☆23Updated 4 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆94Updated last month
- Rust implementations of succinct data structures☆59Updated last week
- ☆21Updated last year
- Simple and transparent support for compressed files.☆80Updated 7 months ago
- Simple succinct data structures (in Rust)☆50Updated 9 months ago
- A Rust data structure for efficient lower-bound lookups☆92Updated last year
- Parallelized zip archive reading☆37Updated 8 months ago
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- Succinct data structures using very efficient rank and select☆126Updated 2 months ago
- Rust bindings to parasail, a SIMD-accelerated pairwise sequence alignment library.☆21Updated 9 years ago
- Multi-threaded Compression☆164Updated 4 months ago
- A BK-tree implementation in Rust.☆40Updated last year
- Fast suffix arrays for Rust (with Unicode support).☆275Updated last year
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆87Updated 2 months ago
- A Rust implementation of the Quad Wavelet Tree☆42Updated last week
- C library for finding nearest (most similar) element in a set☆32Updated 3 years ago
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆145Updated 2 weeks ago
- SIMD algorithms for integer compression via bitpacking. This crate is a port of a C library called simdcomp.☆312Updated last year
- A very fast interval tree data structure☆125Updated 7 months ago
- Histograms with a configurable number of buckets, and a terminal-friendly Display.☆31Updated last year