A fast, sensitive pattern-matching approach for protein sequences
1Max-Delbrueck-Centre for Molecular Medicine Robert-Roessle-Strasse 10, 0-1115 Berlin-Buch
2European Molecular Biology Laboratory, Biocomputing Group Meyerhofstrasse I, W-6900 Heidelberg, Germany
Pattern-matching algorithms are a powerful tool for finding similarities and relationships among the steadily growing amount of known protein sequences. We present a fast, sensitive pattern-matching algorithm that describes a pattern by its physico-chemical properties rather than by occurrence ofamino acids, using a fast, dynamic programming algorithm. Selected examples will demonstrate applications and advantages of our approach.
Received on April 14, 1992; accepted on July 31, 1992
This article has been cited by other articles:
![]() |
M. Sudol, P. Bork, A. Einbond, K. Kastury, T. Druck, M. Negrini, K. Huebner, and D. Lehman Characterization of the Mammalian YAP (Yes-associated Protein) Gene and Its Role in Defining a Novel Protein Module, the WW Domain J. Biol. Chem., June 16, 1995; 270(24): 14733 - 14741. [Abstract] [Full Text] [PDF] |
||||
