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, 2836(70), 443-453.

Type

Journal article

Intellectual base

Primary research

Year

1970

DOI

10.1016/0022-2836(70)90057-4

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))

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

This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.

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