The gold standard for finding hidden biological blueprints

Health · Published 19 October 2026 Swipe more like this →

In short: How do scientists determine if two proteins share a common ancestor or if a new gene has a specific function? They use the Smith–Waterman algorithm. By mathematically scanning for local regions of similarity, it identifies the functional

Proposed in 1981 by Temple F. Smith and Michael S. Waterman, the Smith–Waterman algorithm is the 'gold standard' for local sequence alignment. Unlike global alignment, which compares sequences from beginning to end, local alignment identifies specific regions of high similarity. This is crucial for identifying conserved domains, motifs, or functional similarities between sequences that may otherwise be dissimilar or only partially overlapping.

The algorithm operates on the principle of dynamic programming, a method that breaks a complex problem into smaller, independent sub-problems. It assigns scores to matches and mismatches using predefined scoring matrices, such as PAM or BLOSUM for amino acids. A key distinction from the Needleman-Wunsch algorithm is that Smith-Waterman sets any negative score in the matrix to zero. The final alignment is then traced back from the highest score in the matrix until a cell with a score of zero is reached.

While highly accurate, the algorithm's quadratic time complexity makes it computationally demanding for large-scale genome projects. To address this, researchers have developed various optimizations. For instance, the SW-actors implementation uses the actor model of concurrent computation to manage tasks across processors, achieving up to 22x speedup over serial versions on 40 cores. These advancements allow scientists to process massive datasets to better understand biological homology and functionality.

This computational approach is fundamental to bioinformatics because it allows for the prediction of structure and function in newly discovered sequences. Because sequences sharing a common ancestor tend to exhibit similar structures, the greater the sequence similarity found by the algorithm, the higher the probability that the sequences share a common biological role.

General information, not professional advice. Spotted an error? Flag the card or see corrections and complaints.

Intellect Plus is a visual educational discovery platform for exploring fascinating facts and ideas. Brain Food, Not Brain Rot. What is Intellect Plus?

Related

• How computers find hidden patterns in DNA and clinical care
• How do we find distant biological relatives using computational algorithms?
• How a 1990 algorithm traces the evolutionary footprints of ancient humans
• How computational biology uses probabilistic models to decode the secrets of our DNA
• How do scientists bridge the gap from genetic sequences to complex 3D protein structures?
• Why animals and humans groom each other to build social power
• Beyond the Blueprint: Why RNA Sequencing Reveals Secrets DNA Cannot
• The TATA box: a modular docking station for life's instructions
• Is the right to food more than just the absence of hunger?
• The global health landscape is a complex web of diverse actors
• The molecular bridge: turning RNA into a readable DNA blueprint
• How family caregivers can transform global health outcomes

More in Global health · More in Health · Latest · A–Z · All topics