A sequence similarity search algorithm based on a probabilistic interpretation of an alignment scoring system

Proc Int Conf Intell Syst Mol Biol. 1996:4:44-51.

Abstract

We present a probabilistic interpretation of local sequence alignment methods where the alignment scoring system (ASS) plays the role of a stochastic process defining a probability distribution over all sequence pairs. An explicit algorithms is given to compute the probability of two sequences given and ASS. Based on this definition, a modified version of the Smith-Waterman local similarity search algorithm has been devised, which assesses sequence relationships by log likelihood ratios. When tested on classical examples such as globins or G-protein-coupled receptors, the new method proved to be up to an order of magnitude more sensitive than the native Smith-Waterman algorithm.

Publication types

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

MeSH terms

  • Algorithms*
  • Cytochrome c Group / chemistry
  • GTP-Binding Proteins / metabolism
  • Globins / chemistry
  • Models, Molecular*
  • Receptors, Cell Surface / chemistry
  • Sequence Alignment / methods*
  • Software
  • src Homology Domains

Substances

  • Cytochrome c Group
  • Receptors, Cell Surface
  • Globins
  • GTP-Binding Proteins