arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0711.1012q-bio.BM
收藏

基于数据库管理系统的蛋白质原子级局部结构相似性搜索

Similarity search for local protein structures at atomic resolution by exploiting a database management system

Akira R. Kinjo, Haruki Nakamura

摘要:

提出了一种在原子分辨率下搜索蛋白质局部结构相似性的方法。它表明,大量的结构数据可以在一个合理的CPU时间内处理,通过使用传统的关系数据库管理系统与适当的几何数据索引。这种方法,我们称之为几何索引,可以在普通台式计算机上几个小时的CPU时间内,在超过160,000个可能的候选者中枚举结构上与查询蛋白质的子结构相似的配体结合位点。在通过几何索引搜索检测到一组高得分配体结合位点之后,通过迭代地应用匈牙利算法来构建原子分辨率的结构比对,并且根据基于伽马分布的经验模型来估计最终得分的统计显著性。这种方法的几个蛋白质结构的应用清楚地表明,显着的相似性,可以检测到非同源以及同源蛋白质的局部结构之间。

英文摘要:

A method to search for local structural similarities in proteins at atomic resolution is presented. It is demonstrated that a huge amount of structural data can be handled within a reasonable CPU time by using a conventional relational database management system with appropriate indexing of geometric data. This method, which we call geometric indexing, can enumerate ligand binding sites that are structurally similar to sub-structures of a query protein among more than 160,000 possible candidates within a few hours of CPU time on an ordinary desktop computer. After detecting a set of high scoring ligand binding sites by the geometric indexing search, structural alignments at atomic resolution are constructed by iteratively applying the Hungarian algorithm, and the statistical significance of the final score is estimated from an empirical model based on a gamma distribution. Applications of this method to several protein structures clearly shows that significant similarities can be detected between local structures of non-homologous as well as homologous proteins.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑