Temple F. Smith & Michael S. Waterman
Inventors of the Smith-Waterman Algorithm; created the dynamic programming algorithm for Optimal Local Sequence Alignment.
Finding the most conserved motifs between divergent biological sequences is like searching for gold veins in rock: local alignment reveals the functional jewel without being distracted by non-conserved flanking noise.
Curiosity & Historical Discovery Anecdote
The serendipity, obstacles, and fascinating human journey behind the discovery.
When Temple Smith and Michael Waterman formulated their algorithm at Northern Michigan University and Los Alamos in 1981, they published it in the Journal of Molecular Biology. The paper had almost no citations for its first few years because computer power in biological labs was virtually non-existent! However, as GenBank expanded in the late 1980s, the Smith-Waterman algorithm became one of the most cited computational papers in the history of science.
High-Yield Exam Focus (CSIR-NET, GATE, USMLE)
Core mechanisms, experimental controls, and recurring competitive exam questions.
Global vs Local Alignment: (1) Needleman-Wunsch Algorithm (1970): Optimal Global Alignment aligning sequences across their entire length from end to end; dynamic programming matrix initialization contains negative gap penalties along first row and column; traceback starts strictly from bottom-right corner; (2) Smith-Waterman Algorithm (1981): Optimal Local Alignment finding regions of highest local similarity (motifs/domains); negative values in the dynamic programming matrix are set to ZERO (H(i,j) = max{0, match/mismatch, deletion, insertion}); traceback starts at the maximum value anywhere in the entire matrix and terminates when encountering zero.
Landmark Scientific Breakthroughs & Molecular Mechanisms
Step-by-step scientific explanations of the discoveries that defined modern biology.
Invention of the Smith-Waterman Local Sequence Alignment Algorithm
Experimental Logic & Mechanism:
Formulated a dynamic programming recurrence relation where each matrix cell H(i,j) is calculated as the maximum of zero, the diagonal cell plus substitution score, or adjacent cells plus gap penalty. By setting negative score values to zero, the algorithm discards poorly aligned flanking regions and identifies the optimal local alignment substring with mathematical proof.
Establishment of Mathematical Foundations of Computational Biology (Waterman)
Experimental Logic & Mechanism:
Developed the Lander-Waterman model for physical mapping and shotgun sequencing coverage, de Bruijn graphs for genome assembly, and statistical significance theory of sequence alignments.
Biographical Journey & Intellectual Legacy
Chronological chronicle of early education, mentorship, research trials, and achievements.
Temple F. Smith was born in 1939. He completed his PhD in physics at the University of Colorado Boulder in 1969, transitioning to biophysics at UC San Diego with Walter Fitch.
Michael S. Waterman was born in Coquille, Oregon, completing his PhD in statistics and mathematics at Michigan State University in 1969.
In the late 1970s, Smith and Waterman met at Northern Michigan University and later worked together in the Theoretical Division at Los Alamos National Laboratory, surrounded by the birth of GenBank and high-performance computing.
In 1981, they published their epochal paper on local sequence alignment in the Journal of Molecular Biology.
Smith subsequently directed the Biomolecular Engineering Research Center at Boston University, discovering the WD40 protein repeat. Waterman joined the University of Southern California (USC), training a generation of bioinformaticians and receiving the Dan David Prize and electing to the National Academy of Sciences and National Academy of Engineering.
Landmark Publications & Primary Literature
Original monographs and communications that announced the breakthroughs to the world.
Smith, T. F., & Waterman, M. S. (1981). Identification of common molecular subsequences. Journal of Molecular Biology, 147(1), 195-197.
Significance: The historic paper introducing the Smith-Waterman dynamic programming algorithm for local sequence alignment.
Explore Related Lecture Notes on B10logy
Direct access to comprehensive textbook notes where these discoveries are analyzed in depth.