Efficient algorithms for molecular sequence analysis

Proc Natl Acad Sci U S A. 1988 Feb;85(3):841-5. doi: 10.1073/pnas.85.3.841.

Abstract

Efficient (linear time) algorithms are described for identifying global molecular sequence features allowing for errors including repeats, matches between sequences, dyad symmetry pairings, and other sequence patterns. A multiple sequence alignment algorithm is also described. Specific applications are given to hepatitis B viruses and the J5-C (J, joining; C, constant) region of the immunoglobulin kappa gene.

Publication types

  • Research Support, U.S. Gov't, Non-P.H.S.
  • Research Support, U.S. Gov't, P.H.S.

MeSH terms

  • Algorithms*
  • Amino Acid Sequence*
  • Animals
  • Base Sequence*
  • Genes, Immunoglobulin
  • Genes, Viral
  • Hepatitis Viruses / genetics
  • Humans
  • Immunoglobulin kappa-Chains / genetics
  • Mice
  • Rabbits
  • Sequence Homology, Nucleic Acid

Substances

  • Immunoglobulin kappa-Chains