henhaobio
Sign in

Bioinformatics AdvancesBioinformaticsPeer-reviewed journal article

aaHash: recursive amino acid sequence hashing

Johnathan WongiD, Parham KazemiiD, Lauren CoombeiD, René L. WarreniD, İnanç BiroliD

PDFDOIPreprintCode

Abstract

MotivationK-mer hashing is a common operation in many foundational bioinformatics problems. However, generic string hashing algorithms are not optimized for this application. Strings in bioinformatics use specific alphabets, a trait leveraged for nucleic acid sequences in earlier work. We note that amino acid sequences, with complexities and context that cannot be captured by generic hashing algorithms, can also benefit from a domain-specific hashing algorithm. Such a hashing algorithm can accelerate and improve the sensitivity of bioinformatics applications developed for protein sequences. ResultsHere, we present aaHash, a recursive hashing algorithm tailored for amino acid sequences. This algorithm utilizes multiple hash levels to represent biochemical similarities between amino acids. aaHash performs [~]10X faster than generic string hashing algorithms in hashing adjacent k-mers. Availability and implementationaaHash is available online at https://github.com/bcgsc/btllib and is free for academic use.

Citations
1
FWCI
0.09
Field percentile
42th percentile

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.

Similarity Map
SelectedSame fieldCross-field
THISWong '26Pibiri '26Pibiri '22Anderson '21Kunzmann '24Khan '26
67% semantic matchBioinformatics
Johnathan Wong, İnanç Birol·bioRxiv·Oct 24, 2026