Bulletin of Mathematical Biology

, Volume 48, Issue 5, pp 603–616

Optimal sequence alignment using affine gap costs

Authors

  • Stephen F. Altschul
    • The Rockefeller University
    • Department of Applied MathematicsMassachusetts Institute of Technology
  • Bruce W. Erickson
    • The Rockefeller University
Article

DOI: 10.1007/BF02462326

Cite this article as:
Altschul, S.F. & Erickson, B.W. Bltn Mathcal Biology (1986) 48: 603. doi:10.1007/BF02462326

Abstract

When comparing two biological sequences, it is often desirable for a gap to be assigned a cost not directly proportional to its length. If affine gap costs are employed, in other words if opening a gap costsv and each null in the gap costsu, the algorithm of Gotoh (1982,J. molec. Biol.162, 705) finds the minimum cost of aligning two sequences in orderMN steps. Gotoh's algorithm attempts to find only one from among possibly many optimal (minimum-cost) alignments, but does not always succeed. This paper provides an example for which this part of Gotoh's algorithm fails and describes an algorithm that finds all and only the optimal alignments. This modification of Gotoh's algorithm still requires orderMN steps. A more precise form of path graph than previously used is needed to represent accurately all optimal alignments for affine gap costs.

Copyright information

© Society for Mathematical Biology 1986