Skip to main content
Log in

A non-metric sequence alignment program

  • Published:
Bulletin of Mathematical Biology Aims and scope Submit manuscript

Abstract

An algorithm for nucleic acid and protein sequence alignment is presented. It is a non-metric local similarity minimal-difference algorithm and in the current implementation, assembles the matching regions found into a pseudo-global format. Its strengths are its speed of execution and the especially convenient presentation of its output. The algorithm is intended for use in sequence melding and local (small-region) similarity searching. It is not designed to replace a metric Needleman-Wunsch-Sellers-type similarity algorithm. The program is written in FORTRAN and is designed to be easily transportable to a variety of computer systems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Literature

  • Brutlag, D. L., J. Clayton, P. Friedland, and L. H. Kedes. 1982. “SEQ: A Nucleotide Sequence Analysis and Recombination System”.Nucl. Acids. Res. 10, 279–294.

    Google Scholar 

  • Fitch, W. M. and T. Smith. 1983. “Optimal Sequence Alignments.”Proc. natn. Acad. Sci. U.S.A. 80, 1382–1386.

    Article  Google Scholar 

  • Goad, W. B., and M. I. Kanehisa. 1982. “Pattern Recognition in Nucleic Acid Sequences.”Nucl. Acids Res. 10, 247–263.

    Google Scholar 

  • Maizel, J. V., and R. P. Lenk. 1981. “Enhanced Graphic Matrix Analysis of Nucleic Acid and Protein Sequences.”Proc. natn. Acad. Sci. U.S.A. 78, 7665–7669.

    Article  MathSciNet  Google Scholar 

  • Molgen system notes. 1980. Stanford University, U.S.A.

  • Needleman, S. B., and C. D. Wunsch. 1970. “A General Method Applicable to the Search for Similarities in the Amino Acid Sequence of Two Proteins.”J. molec. Biol.,48, 443–453.

    Article  Google Scholar 

  • Ohtsubo, H., K. Nyman, W. Doroszkiewicz and E. Ohtsubo. 1981. “Multiple Copies of Iso-Insertion Sequences of ISI inShigella Dysenteriae chromosome.”Nature, Lond. 292, 640–643.

    Article  Google Scholar 

  • Sellers, P. 1974(a). “An Algorithm for the Distance Between Two Finite Sequences.”J. Combinatorial Theory (A) 16, 253–258.

    Article  MATH  MathSciNet  Google Scholar 

  • — 1974(b). “On the Theory and Computation of Evolutionary Distances.”SIAM J. appl. Math 26, 787–793.

    Article  MATH  MathSciNet  Google Scholar 

  • — 1980. “The Theory and Computation of Evolutionary Distances: Pattern Recognition.”J. Algorithms 1, 359–373.

    Article  MATH  MathSciNet  Google Scholar 

  • Smith, T., M. S. Waterman and W. Fitch. 1981. “Comparative Biosequence Metrics.”J. molec. Evol. 18, 38–46.

    Article  Google Scholar 

  • — and—. 1981. “Identification of Common Molecular Subsequences”J. molec. Biol. 147, 195–197.

    Article  Google Scholar 

  • Wilbur, W. J. and D. J. Lippman. 1983. “Rapid Similarity Searching of Nucleic Acid and Protein Databases.”Proc. natn. Acad. Sci. U.S.A. 80, 726–730.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Davison, D., Thompson, K.H. A non-metric sequence alignment program. Bltn Mathcal Biology 46, 579–590 (1984). https://doi.org/10.1007/BF02459505

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02459505

Keywords

Navigation