Identification of Common Molecular Subsequences.

Smith, T. F., & Waterman, M. S. (1981). Identification of Common Molecular Subsequences. Journal of Molecular Biology, 2836(81), 195-197.

Type

Journal article

Intellectual base

Primary research

Year

1981

DOI

10.1016/0022-2836(81)90087-5

Link

https://doi.org/10.1016/0022-2836(81)90087-5

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
  • This single DP algorithm — along with its Smith-Waterman local-alignment variant (1981) and affine-gap extensions — underlies much of modern bioinformatics: BLAST-style similarity searches, protein-structure prediction, comparative genomics pipelines, phylogenetic-tree construction, and the entire computational infrastructure for interpreting the human genome and comparing genomes across species.

    This sourceLocal-alignment DP variant of Needleman–Wunsch

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:ed32c4b1ab7b · see in the full table