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 2 years ago
Alternatives and similar repositories for triple_accel:
Users that are interested in triple_accel are comparing it to the libraries listed below
- Fast hierarchical agglomerative clustering in Rust.☆95Updated last year
- Out-of-memory sorting of large datasets map / reduce style processing☆47Updated last week
- Succinct data structures using very efficient rank and select☆106Updated last week
- Parallel iterator processing library for Rust☆102Updated last year
- Rust implementation of a fast, easy, interval tree library nim-lapper☆58Updated 11 months ago
- ☆20Updated last year
- Integer sets as fast, sorted, integer ranges with full set operations☆83Updated 2 months ago
- ☆229Updated 2 months ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆21Updated 3 weeks ago
- FM-Index for Rust☆19Updated this week
- Collection of succinct data structures in Rust☆95Updated 2 weeks ago
- Hidden Markov Models in Rust☆70Updated 11 months ago
- Fast and scalable minimal perfect hashing for massive key sets