A fast, sensitive pattern-matching approach for protein sequences
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 ofami...
Saved in:
Published in | Bioinformatics Vol. 9; no. 2; pp. 183 - 189 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Washington, DC
Oxford University Press
01.04.1993
Oxford |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ark:/67375/HXZ-SLJ5DJQK-S istex:14C9A96D05B4B0FBB985D5345B08D6D40CF8639A ArticleID:9.2.183 ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 23 |
ISSN: | 1367-4803 0266-7061 1460-2059 |
DOI: | 10.1093/bioinformatics/9.2.183 |