ankushmandal / topkapiLinks
☆15Updated 6 years ago
Alternatives and similar repositories for topkapi
Users that are interested in topkapi are comparing it to the libraries listed below
Sorting:
- Paper about the estimation of cardinalities from HyperLogLog sketches☆62Updated 4 years ago
- Implementation of a Backpack Quotient Filter☆12Updated last month
- DartMinHash: Fast Sketching for Weighted Sets☆13Updated 4 years ago
- OpenMP implementation of Graph Community Detection, with a number of parallel heuristics/approximate computing techniques☆21Updated 2 years ago
- C++ Implementations of sketch data structures with SIMD Parallelism, including Python bindings☆155Updated last year
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Updated 4 years ago
- Ultra fast MSD radix sorter☆11Updated 5 years ago
- Daichi Amagata and Takahiro Hara, SIGMOD2021☆14Updated last year
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Updated 4 years ago
- ProbMinHash – A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity☆42Updated 4 years ago
- 🔶 Compressed bitvector/container supporting efficient random access and rank queries☆46Updated 11 months ago
- COBS - Compact Bit-Sliced Signature Index (for Genomic k-Mer Data or q-Grams)☆84Updated last year
- GBBS: Graph Based Benchmark Suite☆211Updated last week
- A cheatsheet for most common Stringology tasks☆15Updated 4 years ago
- ☆11Updated 2 years ago
- Cache-friendly, Parallel, and Samplesort-based Constructor for Suffix Arrays and LCP Arrays☆13Updated last month
- Parallel Wavelet Tree and Wavelet Matrix Construction☆26Updated 2 years ago
- Online construction of run-length BWT (RLBWT) and r-index. Plus, online LZ77 parsing based on RLBWT.☆15Updated 7 years ago
- Wavelet tree based on a fixed block boosting technique☆16Updated 4 years ago
- ☆15Updated 2 years ago
- Parallel Suffix Array, LCP Array, and Suffix Tree Construction☆49Updated 6 years ago
- Embedding billion-scale networks accurately in one hour (TKDE paper 2023)☆11Updated last year
- ☆14Updated 5 years ago
- In-place Parallel Super Scalar Radix Sort (IPS²Ra)☆33Updated 6 months ago
- Experimental Code for "Unleashing Graph Partitioning for Large-Scale Nearest Neighbor Search"☆23Updated 9 months ago
- SONG: Approximate Nearest Neighbor Search on GPU. SONG is a graph-based approximate nearest neighbor search toolbox.☆69Updated 3 months ago
- ☆41Updated last year
- Parallel String Graph Construction, Transitive Reduction, and Contig Generation for De Novo Genome Assembly☆17Updated last year
- Code for the paper Aligning Distant Sequences to Graphs using Long Seed Sketches.☆13Updated 2 years ago
- Dynamic succinct/compressed data structures☆113Updated last year