Abstract

A wealth of protein and DNA sequence data is being generated by genome projects and other sequencing efforts. A crucial barrier to deciphering these sequences and understanding the relations among them is the difficulty of detecting subtle local residue patterns common to multiple sequences. Such patterns frequently reflect similar molecular structures and biological properties. A mathematical definition of this "local multiple alignment" problem suitable for full computer automation has been used to develop a new and sensitive algorithm, based on the statistical method of iterative sampling. This algorithm finds an optimized local alignment model for N sequences in N -linear time, requiring only seconds on current workstations, and allows the simultaneous detection and optimization of multiple patterns and pattern repeats. The method is illustrated as applied to helix-turn-helix proteins, lipocalins, and prenyltransferases.

Keywords

Computer scienceSequence (biology)Gibbs samplingSampling (signal processing)WorkstationComputational biologyAlgorithmSequence alignmentPattern recognition (psychology)Artificial intelligenceData miningBiologyGeneticsPeptide sequenceComputer vision

Affiliated Institutions

Related Publications

Publication Info

Year
1993
Type
article
Volume
262
Issue
5131
Pages
208-214
Citations
1816
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

1816
OpenAlex

Cite This

Charles E. Lawrence, Stephen F. Altschul, Mark S. Boguski et al. (1993). Detecting Subtle Sequence Signals: a Gibbs Sampling Strategy for Multiple Alignment. Science , 262 (5131) , 208-214. https://doi.org/10.1126/science.8211139

Identifiers

DOI
10.1126/science.8211139