Krause A, Vingron M
Deutsches Krebsforschungszentrum (DKFZ), Theoretische Bioinformatik, Im Neuenheimer Feld 280, D-69120 Heidelberg, Germany.
Bioinformatics. 1998 Jun;14(5):430-8. doi: 10.1093/bioinformatics/14.5.430.
In this paper, we introduce an iterative method of database searching and apply it to design a database clustering algorithm applicable to an entire protein database. The clustering procedure relies on the quality of the database searching routine and further improves its results based on a set-theoretic analysis of a highly redundant yet efficient to generate cluster system.
Overall, we achieve unambiguous assignment of 80% of SWISS-PROT sequences to non-overlapping sequence clusters in an entirely automatic fashion. Our results are compared to an expert-generated clustering for validation. The database searching method is fast and the clustering technique does not require time-consuming all-against-all comparison. This allows for fast clustering of large amounts of sequences.
The resulting clustering for the PIR1 (Release 51) and SWISS-PROT (Release 34) databases is available over the Internet from http://www.dkfz-heidelberg.de/tbi/services/modest/b rowsesysters.pl.
在本文中，我们介绍了一种数据库搜索的迭代方法，并将其应用于设计一种适用于整个蛋白质数据库的数据库聚类算法。聚类过程依赖于数据库搜索程序的质量，并基于对一个高度冗余但高效生成聚类系统的集合论分析进一步改进其结果。
总体而言，我们以完全自动的方式将80%的SWISS-PROT序列明确分配到非重叠序列聚类中。我们的结果与专家生成的聚类结果进行比较以进行验证。数据库搜索方法速度快，聚类技术不需要耗时的全对全比较。这使得能够快速对大量序列进行聚类。
