PROSET - A FAST PROCEDURE TO CREATE NONREDUNDANT SETS OF PROTEIN SEQUENCES

被引：29

作者：

BRENDEL, V

机构：

[1] Department of Mathematics Stanford University, Stanford

来源：

MATHEMATICAL AND COMPUTER MODELLING | 1992年 / 16卷 / 6-7期

关键词：

D O I：

10.1016/0895-7177(92)90150-J

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

The PROSET computer program described efficiently eliminates redundant entries from a set of proteins. It finds repeats between all the proteins of the original set, derives a block identity score between any two sequences that share at least one sufficiently long exact repeat, and discards the shorter of the two sequences if the score exceeds a user-defined threshold. The program finds application in generating control sets for statistical evaluation of sequence patterns. It may also serve to reduce the amount of redundancy in available databases.

引用

页码：37 / 43

页数：7

共 13 条

[11] THE LEUCINE ZIPPER - A HYPOTHETICAL STRUCTURE COMMON TO A NEW CLASS OF DNA-BINDING PROTEINS [J].