可扩展性
水准点(测量)
聚类分析
计算机科学
数据挖掘
最近邻搜索
成对比较
搜索算法
数据结构
蛋白质结构数据库
蛋白质数据库
蛋白质结构预测
数据库搜索引擎
数据库
情报检索
搜索引擎
蛋白质结构
算法
机器学习
人工智能
生物
序列数据库
生物化学
大地测量学
基因
地理
程序设计语言
作者
Zi Liu,Chengxin Zhang,Qidi Zhang,Yang Zhang,Dong‐Jun Yu
标识
DOI:10.1021/acs.jcim.3c01455
摘要
The quickly increasing size of the Protein Data Bank is challenging biologists to develop a more scalable protein structure alignment tool for fast structure database search. Although many protein structure search algorithms and programs have been designed and implemented for this purpose, most require a large amount of computational time. We propose a novel protein structure search approach, TM-search, which is based on the pairwise structure alignment program TM-align and a new iterative clustering algorithm. Benchmark tests demonstrate that TM-search is 27 times faster than a TM-align full database search while still being able to identify ∼90% of all high TM-score hits, which is 2-10 times more than other existing programs such as Foldseek, Dali, and PSI-BLAST.
科研通智能强力驱动
Strongly Powered by AbleSci AI