FAST:一种新型蛋白质结构比对算法。
FAST: a novel protein structure alignment algorithm.
作者信息
Zhu Jianhua, Weng Zhiping
机构信息
Bioinformatics Program, Boston University, Boston, Massachusetts 02215, USA.
出版信息
Proteins. 2005 Feb 15;58(3):618-27. doi: 10.1002/prot.20331.
We present a novel algorithm named FAST for aligning protein three-dimensional structures. FAST uses a directionality-based scoring scheme to compare the intra-molecular residue-residue relationships in two structures. It employs an elimination heuristic to promote sparseness in the residue-pair graph and facilitate the detection of the global optimum. In order to test the overall accuracy of FAST, we determined its sensitivity and specificity with the SCOP classification (version 1.61) as the gold standard. FAST achieved higher sensitivities than several existing methods (DaliLite, CE, and K2) at all specificity levels. We also tested FAST against 1033 manually curated alignments in the HOMSTRAD database. The overall agreement was 96%. Close inspection of examples from broad structural classes indicated the high quality of FAST alignments. Moreover, FAST is an order of magnitude faster than other algorithms that attempt to establish residue-residue correspondence. Typical pairwise alignments take FAST less than a second with a Pentium III 1.2GHz CPU. FAST software and a web server are available at http://biowulf.bu.edu/FAST/.
我们提出了一种名为FAST的用于比对蛋白质三维结构的新算法。FAST使用基于方向性的评分方案来比较两个结构中分子内残基-残基的关系。它采用一种消除启发式方法来促进残基对图的稀疏性,并便于检测全局最优解。为了测试FAST的整体准确性,我们以SCOP分类(版本1.61)作为金标准来确定其敏感性和特异性。在所有特异性水平上,FAST都比几种现有方法(DaliLite、CE和K2)具有更高的敏感性。我们还在HOMSTRAD数据库中针对1033个手动整理的比对测试了FAST。总体一致性为96%。对来自广泛结构类别的示例进行仔细检查表明FAST比对的质量很高。此外,FAST比其他试图建立残基-残基对应关系的算法快一个数量级。使用奔腾III 1.2GHz CPU时,典型的成对比对FAST耗时不到一秒。可在http://biowulf.bu.edu/FAST/获取FAST软件和网络服务器。