HyperGen: Compact and Efficient Genome Sketching using Hyperdimensional Vectors
Weihong XuiD, Po-Kai Hsu, Niema MoshiriiD, Shimeng YuiD, Tajana RosingiD
Abstract
MotivationGenomic distance estimation is a critical workload since exact computation for whole-genome similarity metrics such as Average Nucleotide Identity (ANI) incurs prohibitive runtime overhead. Genome sketching is a fast and memory-efficient solution to estimate ANI similarity by distilling representative k-mers from the original sequences. In this work, we present HyperGen that improves accuracy, runtime performance, and memory efficiency for large-scale ANI estimation. Unlike existing genome sketching algorithms that convert large genome files into discrete k-mer hashes, HyperGen leverages the emerging hyperdimensional computing (HDC) to encode genomes into quasi-orthogonal vectors (Hypervector, HV) in high-dimensional space. HV is compact and can preserve more information, allowing for accurate ANI estimation while reducing required sketch sizes. In particular, the HV sketch representation in HyperGen allows efficient ANI estimation using vector multiplication, which naturally benefits from highly optimized general matrix multiply (GEMM) routines. As a result, HyperGen enables the efficient sketching and ANI estimation for massive genome collections. ResultsWe evaluate HyperGens sketching and database search performance using several genome datasets at various scales. HyperGen is able to achieve comparable or superior ANI estimation error and linearity compared to other sketch-based counterparts. The measurement results show that HyperGen is one of the fastest tools for both genome sketching and database search. Meanwhile, HyperGen produces memory-efficient sketch files while ensuring high ANI estimation accuracy. AvailabilityA Rust implementation of HyperGen is freely available under the MIT license as an open-source software project at https://github.com/wh-xu/Hyper-Gen. The scripts to reproduce the experimental results can be accessed at https://github.com/wh-xu/experiment-hyper-gen. Contactwexu@ucsd.edu
02 /Specification & Classification
Click any tag to browse matching papers- Citations
- 12
- FWCI
- 1.64
- Field percentile
- top 16%
- Assay
- Research Focus
- Approach
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- HyperSketch: de Bruijn graph sketching for genomic similarity estimation with Hyperdimensional Computing
Fabio Cumbo, Kabir Dhillon, … Daniel J Blankenberg·bioRxiv·Sep 6, 2026
- Dashing: Fast and Accurate Genomic Distances with HyperLogLog
Daniel N. Baker, Ben Langmead·Genome biologyPeer-reviewed·Dec 1, 2019
- BinDash 2.0: New MinHash Scheme Allows Ultra-fast and Accurate Genome Search and Comparisons
Jianshu Zhao, Xiaofei Zhao, … Konstantinos T. Konstantinidis·bioRxiv·Mar 13, 2024
- Dashing 2: genomic sketching with multiplicities and locality-sensitive hashing
Daniel N. Baker, Ben Langmead·Genome ResearchPeer-reviewed·Jul 6, 2023
- GSearch: Ultra-Fast and Scalable Microbial Genome Search by combining Kmer Hashing with Hierarchical Navigable Small World Graphs
Jianshu Zhao, Jean Pierre Both, … Konstantinos T. Konstantinidis·Nucleic Acids ResearchPeer-reviewed·Jun 27, 2024
- SimdMinimizers: Computing random minimizers, fast
Ragnar Groot Koerkamp, Igor Martayan·bioRxiv·Jan 27, 2025