rossanoventurini / qwt
A Rust implementation of the Quad Wavelet Tree
☆41Updated this week
Alternatives and similar repositories for qwt:
Users that are interested in qwt are comparing it to the libraries listed below
- Rust implementations of succinct data structures☆58Updated 3 weeks ago
- Collection of succinct data structures in Rust☆96Updated 2 months ago
- Simple succinct data structures (in Rust)☆50Updated 5 months ago
- PtrHash minimal perfect hash function, based of PTHash☆54Updated last week
- A Rust interface for the Succinct Data Structure Library.☆14Updated 3 years ago
- FM-index for Rust☆22Updated last week
- Succinct Data Structures for Rust☆57Updated last year
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated last month
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆30Updated last month
- Fast and scalable minimal perfect hashing for massive key sets☆140Updated 10 months ago
- Rust libraries and programs focused on succinct data structures☆138Updated this week
- Voracious radix sort☆67Updated last year
- Succinct data structures using very efficient rank and select☆117Updated last month
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆122Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆43Updated 8 months ago
- SIMD Floating point and integer compressed vector library☆80Updated last year
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆107Updated 2 years ago
- Integer sets as fast, sorted, integer ranges with full set operations☆84Updated this week
- Radix sort implementation for sorting by scalar keys (integers, floats, chars, bools)☆22Updated 8 months ago
- Prefix Filter: Practically and Theoretically Better Than Bloom.☆48Updated 2 years ago
- Fast and highly tuned bit vector implementation including space efficient rank and select support having only 3.51% space overhead.☆30Updated last month
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆21Updated last month
- Wavelet Matrix implementation written in Rust☆14Updated 2 years ago
- A bit vector with the Rust standard library's portable SIMD API.☆40Updated 2 years ago
- Fast stochastic simulator for chemical reaction networks☆46Updated last month
- ☆26Updated 6 months ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆60Updated last year
- Parallel Construction of Suffix Arrays in Rust☆23Updated this week
- Paper Collection for Stringologists☆17Updated last week