doi.org
Hash functions in nucleotide sequence analysis
Randomness is a powerful tool in the design and analysis of algorithms and data structures for nucleotide sequence data. Nucleotide sequences are not themselves random but are often randomized using hash functions. Despite their widespread use in genomics, there is no comprehensive review of the types of hash functions used and their various applications. In this survey intended for bioinformatic methods developers, we divide hash functions into four categories: scattering hash functions, permutations, minimum perfect hash functions, and locality-sensitive hash functions. For each category, we provide examples of both general-use hash functions that have been applied in nucleotide sequence analysis and hash functions that have been designed specifically for nucleotide sequence analysis. We highlight their salient properties, commonalities, differences, and application areas.
![Comic. [Person 1 with short hair on stage behind podium reading off paper while addressing audience. People are shown sitting in chairs while Person 2 with ponytail and Person 3 waving are walking toward stage.] PERSON 1: This year’s Nobel Prize in “calibrating your equipment carefully and not embarrassing yourself by publishing spurious results” goes to Dr. Adams and Dr. Smith, who did *not* announce the discovery of microbes on Titan. PERSON 3: Thank you, thank you.](https://cdn.bsky.app/img/feed_thumbnail/plain/did:plc:cz73r7iyiqn26upot4jtjdhk/bafkreihztdrvxjeyzmz6dmz3xb4vi6wiwwtge6fwdoxjcum5aptndv3kfm)
