How computers find hidden patterns in DNA and clinical care

Health · Published 19 October 2026 · Updated 25 October 2026 Swipe more like this →

In short: Mapping the blueprint of life requires solving a massive puzzle: how do we align sequences that have shifted, mutated, or been deleted over time? The Needleman–Wunsch algorithm provides the mathematical framework to find the most likely path between two biological strings by breaking one giant problem into thousands of tiny ones.

Developed in 1970 by Saul B. Needleman and Christian D. Wunsch, this algorithm was a pioneering application of dynamic programming to bioinformatics. It is designed for "global alignment," meaning it seeks the best possible match across the entire length of two sequences, such as proteins or nucleotides. Rather than trying to compare every possibility at once—which would be computationally overwhelming—the algorithm builds a grid where each cell represents a sub-problem. By solving these smaller segments and storing their scores, it can systematically find the optimal global alignment.

The mechanism relies on a scoring system that rewards matches and penalizes mismatches or "indels" (insertions and deletions). For example, in one common scheme, a match earns 1 point, while a mismatch or an indel costs -1. The algorithm populates a grid by looking at three neighboring cells: the top, left, and top-left diagonal. It selects the maximum score from these options to fill the current cell. To find the final result, it traces a path backward from the bottom-right corner of the grid to the top-left, where horizontal or vertical moves indicate gaps and diagonal moves represent character pairings.

While originally built for DNA, the logic has expanded into diverse fields like healthcare and smart home technology. Researchers have modified the algorithm to cluster clinical pathways in the UK's National Health Service (NHS), allowing experts to weight specific medical activities more heavily than others. It also informs "tree alignment" techniques used to select sensors in smart homes for activity recognition. By providing a way to measure similarity with nuance—such as weighting certain mutations or medical steps as more significant—the algorithm remains a cornerstone of modern computational biology and data science.

The power of the Needleman–Wunsch approach lies in its ability to handle ambiguity. When multiple paths yield the same highest score, the algorithm identifies them as equally viable branches. This allows scientists to see not just one "correct" answer, but all possible ways a sequence might have evolved or a patient's journey might have unfolded.

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

• The gold standard for finding hidden biological blueprints
• How computational biology uses probabilistic models to decode the secrets of our DNA
• How do we find distant biological relatives using computational algorithms?
• How a 1990 algorithm traces the evolutionary footprints of ancient humans
• The biological alphabet's hidden patterns are encoded in short, overlapping strings
• The invasive snail that might hold the key to human eye regeneration
• Why some data points are secretly linked to each other
• The molecular 'starter' that allows life to copy its own blueprint
• From Victorian ivory disks to digital archives: the evolution of the microscope slide
• Global preterm birth rates reached 11.1 percent of all livebirths in 2010
• The complex architecture of depression management and its many layers
• Haemorrhage and hypertensive disorders are leading causes of global maternal mortality

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