A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins.

Needleman, S. B., & Wunsch, C. D. (1970). A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins. Journal of Molecular Biology, 48(3), 443-453.

Type

Journal article

Intellectual base

Primary research

Year

1970

Volume

48

Issue

3

Pages

443-453

ISSN

0022-2836

DOI

10.1016/0022-2836(70)90057-4

DOI registrant

Elsevier

Link

https://doi.org/10.1016/0022-2836(70)90057-4

Cited from

operations_research

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Primes

• Dynamic Programming
  • Bellman's principle of optimality and the Needleman-Wunsch algorithm for DNA sequence alignment (1970). Saul Needleman and Christian Wunsch, working on problems in molecular biology, articulated what is now the canonical example of dynamic programming applied to computational biology: given two biological sequences (amino acids or nucleotides), find the optimal global alignment — the pairing of positions (including gaps) that maximizes a similarity score defined by a substitution matrix and a gap penalty.

    This sourceCanonical DP recurrence for global biological sequence alignment (the F(i,j)=max{...} table filled in O(nm)); NOTE: the 1970 paper does not itself cite Bellman or use the term 'dynamic programming'; the DP characterization was recognized by later authors. See prose flag on the 'explicitly invokes/recognized by its authors' overreach.

Domain-specific

• Gap Penalty
  • Without a gap cost, an optimizer can insert gaps too freely and manufacture superficial correspondence; with an excessive cost, it can suppress biologically plausible indels.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:9dd9efae8d34 · see in the full table