Daniel-Liu-c0deb0t / triple_accel
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
☆107Updated last year
Alternatives and similar repositories for triple_accel:
Users that are interested in triple_accel are comparing it to the libraries listed below
- Parallel iterator processing library for Rust☆102Updated last year
- Succinct data structures using very efficient rank and select☆69Updated 2 weeks ago
- Hidden Markov Models in Rust☆70Updated 10 months ago
- Fast hierarchical agglomerative clustering in Rust.☆94Updated last year
- Xor filters - efficient probabilistic hashsets. Faster and smaller than bloom and cuckoo filters.☆135Updated 10 months ago
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated this week
- Fast and scalable minimal perfect hashing for massive key sets☆139Updated 7 months ago
- ☆220Updated last month
- Rust implementations of succinct data structures☆52Updated this week
- Collection of succinct data structures in Rust☆82Updated last year
- ☆63Updated last year
- Small and fast library for k-means clustering.☆43Updated 2 months ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆20Updated 2 weeks ago
- Rust libraries and programs focused on succinct data structures☆135Updated this week
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆76Updated 4 months ago
- Multi-threaded Compression☆157Updated 10 months ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆116Updated 4 years ago
- Native Rust port of Google's HighwayHash, which makes use of SIMD instructions for a fast and strong hash function☆160Updated 2 weeks ago
- FFSVM stands for "Really Fast Support Vector Machine"☆74Updated 2 months ago
- NumPy file format (de-)serialization in Rust☆31Updated 5 years ago
- An allocator that can track and limit memory usage.☆207Updated last year
- Integer sets as fast, sorted, integer ranges with full set operations☆80Updated last month
- A Rust data structure for efficient lower-bound lookups☆89Updated 11 months ago
- A Rust port of the WebGraph framework☆45Updated this week
- Fast suffix arrays for Rust (with Unicode support).☆265Updated last year
- Counting occurrences of a given byte or UTF-8 characters in a slice of memory – fast☆226Updated 4 months ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆58Updated 10 months ago
- Read input lines as byte slices for high efficiency☆62Updated last year
- Simple and transparent support for compressed files.☆76Updated this week
- SIMD Floating point and integer compressed vector library☆79Updated last year