jean-pierreBoth / annembedLinks
data embedding based on approximate nearest neighbour
☆37Updated last week
Alternatives and similar repositories for annembed
Users that are interested in annembed are comparing it to the libraries listed below
Sorting:
- Parallel Barnes-Hut t-SNE implementation written in Rust.☆87Updated 2 months ago
- Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance cal…☆108Updated 2 years ago
- A graph data science library for Rust☆64Updated 3 weeks ago
- Rust implementation of a fast, easy, interval tree library nim-lapper☆62Updated 2 months ago
- Locality Sensitive Hashing in Rust with Python bindings☆118Updated 2 years ago
- Calculation of euclidean distance between vectors, with SIMD☆11Updated last year
- Exon is an OLAP query engine specifically for biology and life science applications.☆71Updated 5 months ago
- An Approximate Nearest Neighbors library in Rust, based on random projections and LMDB and optimized for memory usage☆285Updated last month
- Rust implementation of the HNSW algorithm (Malkov-Yashunin)☆206Updated last week
- PtrHash minimal perfect hash function☆69Updated 2 weeks ago
- Rust libraries and programs focused on succinct data structures☆149Updated last week
- Out-of-memory sorting of large datasets map / reduce style processing☆46Updated this week
- A library for easy, fast, and efficient reading & writing of PLINK Bed files☆81Updated 5 months ago
- Cute tricks for SIMD vectorized binary encoding and decoding of nucleotides, in Rust.☆128Updated 4 years ago
- FM-index for Rust☆23Updated 4 months ago
- Hardware go brrr bounded context suffix array construction algorithm☆18Updated last year
- Fast hierarchical agglomerative clustering in Rust.☆102Updated 5 months ago
- Integer sets as fast, sorted, integer ranges with full set operations☆94Updated last month
- protein utilities in Rust☆31Updated 3 months ago
- A very fast interval tree data structure☆125Updated 7 months ago
- Collection of succinct data structures in Rust☆99Updated last month
- ☆14Updated last year
- Rust implementation of Needleman-Wunsch & Smith-Waterman sequence alignment☆21Updated 2 months ago
- Succinct data structures using very efficient rank and select☆126Updated 2 months ago
- Matrix decomposition algorithms including PCA (principal component analysis) and ICA (independent component analysis)☆20Updated 5 months ago
- Fast and scalable minimal perfect hashing for massive key sets☆142Updated last year
- UMAP (Uniform Manifold Approximation and Projection) in Rust☆17Updated last week
- A Rust implementation of the Quad Wavelet Tree☆42Updated 2 weeks ago
- Rust implementations of succinct data structures☆59Updated this week
- k-Medoids clustering in Rust with the FasterPAM algorithm☆26Updated this week