LogLog space version of MinHash by combining ideas from HyperLogLog and b-bit MinHash
☆57Feb 19, 2020Updated 6 years ago
Alternatives and similar repositories for hyperminhash
Users that are interested in hyperminhash are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- ☆18Nov 15, 2026Updated last week
- How many distinct k-mers are there in a sequence?☆11Oct 26, 2026Updated 3 weeks ago
- Minimum plain text representation of kmer sets☆20Jan 30, 2025Updated last year
- Implementation of the u-index☆12Jul 19, 2025Updated last year
- Dynamic, concurrent, and cache-efficient hash table for streaming k-mer operations☆16Updated this week
- Managed hosting for WordPress and PHP on Cloudways • AdManaged hosting for WordPress, Magento, Laravel, or PHP apps, on multiple cloud providers. Deploy in minutes on Cloudways by DigitalOcean.
- SIMD-parallel BLAST X-drop DP on sequence graphs☆24Sep 3, 2026Updated 2 months ago
- Iterate over minimizers of a DNA sequence☆34Jul 12, 2024Updated 2 years ago
- Bonsai: Fast, flexible taxonomic analysis and classification☆69Oct 23, 2026Updated 3 weeks ago
- Compressed, associative, and exact hash table for k-mers☆11Updated this week
- A database for signatures of public genomic sources☆18Jul 18, 2026Updated 4 months ago
- Fast and Memory Efficient Genome Sketching via HyperLogLog, HyperMinHash, UltraLogLog and ExaLogLog☆23Updated this week
- A genomic minhashing implementation in Rust☆100Jul 8, 2026Updated 4 months ago
- Generate kmers/minimizers/hashes/MinHash signatures, including with multiple kmer sizes.☆24Jan 9, 2021Updated 5 years ago
- A Python wrapper for the bbhash library for Minimal Perfect Hashing☆18Oct 26, 2025Updated last year
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- ☆18Jul 9, 2018Updated 8 years ago
- Day 2 of ACAD's 2018 Advanced Bioinformatics Workshop☆12Nov 27, 2018Updated 7 years ago
- The Dagstuhl Format for Assembly☆13Oct 16, 2017Updated 9 years ago
- Rust implementation of probminhash, superminhash and hyperloglog sketching algorithms☆31Jan 22, 2026Updated 9 months ago
- Fast approximation of similarity for sets of very different sizes☆20Mar 8, 2022Updated 4 years ago
- Optimal distance lower bound k-mer sampling.☆12Jun 19, 2024Updated 2 years ago
- Streaming sequence classification with web services ✓📌☆19Dec 8, 2022Updated 3 years ago
- Bloom filter implementation in Nimrod☆16May 26, 2023Updated 3 years ago
- ntHash implementation in Rust☆36Jul 12, 2024Updated 2 years ago
- AI Agents on DigitalOcean Gradient AI Platform • AdBuild production-ready AI agents using customizable tools or access multiple LLMs through a single endpoint. Create custom knowledge bases or connect external data.
- Sequence Bloom Trees with All/Some split☆11Oct 30, 2018Updated 8 years ago
- ☆10Sep 28, 2026Updated last month
- ☆14Jul 30, 2026Updated 3 months ago
- Classify sequencing reads using MinHash.☆47Apr 6, 2020Updated 6 years ago
- Johns Hopkins University student-led genomics paper discussion group☆13Apr 19, 2020Updated 6 years ago
- Cosmo is a fast, low-memory DNA assembler using a Succinct (variable order) de Bruijn Graph.☆53Mar 12, 2024Updated 2 years ago
- Compute bottom-s sketches and s-buckets sketches, using simd-minimizers crate.☆21Aug 26, 2026Updated 2 months ago
- Benchmark data structures for kmer sets.☆13Aug 29, 2026Updated 2 months ago
- dynamic-updateable-index☆11Nov 10, 2015Updated 11 years ago
- Simple, predictable pricing with DigitalOcean hosting • AdAlways know what you'll pay with monthly caps and flat pricing. Enterprise-grade infrastructure trusted by 600k+ customers.
- A fast constructor of the compressed de Bruijn graph from many genomes☆41Nov 27, 2025Updated 11 months ago
- Minhash Index Extended to Knead Kmer Intersection☆11Mar 18, 2020Updated 6 years ago
- Library of sketching functions used by PopPUNK☆29Jun 8, 2026Updated 5 months ago
- A graph-inspired data structure for determining likely chains of sequences from breadcrumbs of evidence☆17Jun 29, 2021Updated 5 years ago
- compacted de Bruijn graph construction in low memory☆102Nov 4, 2025Updated last year
- Refinements of the WFA alignment algorithm with better complexity☆27Mar 31, 2022Updated 4 years ago
- Fast and compact locality-preserving minimal perfect hashing for k-mer sets.☆44Nov 18, 2023Updated 3 years ago
Are these results useful?