Skip Navigation

This Article
Right arrow Full Text (Print PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Rohde, K.
Right arrow Articles by Bork, P.
Right arrow Search for Related Content
PubMed
Right arrow Articles by Rohde, K.
Right arrow Articles by Bork, P.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© Oxford University Press

A fast, sensitive pattern-matching approach for protein sequences

K. Rohde 1 and P. Bork 1,2

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

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
J. Biol. Chem.Home page
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]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.