arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0711.4208q-bio.QM
收藏

基于接触图重叠的蛋白质结构分类

Towards Structural Classification of Proteins based on Contact Map Overlap

Rumen Andonov, Nicola Yanev, Noël Malod-Dognin

摘要:

已经提出了许多措施来量化蛋白质3-D结构之间的相似性。在这些措施中,接触图重叠(CMO)最大化值得持续关注,在过去的十年中,因为它提供了一个很好的估计蛋白质之间的天然同源性关系。尽管生物信息学和计算机科学界大量参与,但已知算法的性能仍然不高。由于问题的复杂性,它们只适用于相对较小的实例,不适用于大规模的比较。本文在这方面提供了一个明显的改进,在过去的方法。我们提出了一个新的整数规划模型的CMO和提出了一个精确的B &B算法的边界计算解决拉格朗日松弛。该方法的效率证明了一个流行的小基准(Skolnick集,40域)。在这一组我们的算法显着优于现有的最好的精确算法,但提供了更好的质量的下限和上限。一些困难的CMO实例首次在合理的时间限制内得到解决。从运行时间和相对差距(上界和下界之间的相对差异)的值,我们获得了该测试的正确分类。这些令人鼓舞的结果使我们设计了一个更难的基准,以更好地评估我们的方法的分类能力。我们构建了一个大规模的300个蛋白质结构域(ASTRAL数据库的一个子集),我们称之为Proteus 300。使用的相对差距的任何44850对夫妇作为一个相似性度量,我们得到了一个非常好的协议与SCOP的分类。因此,我们的算法提供了一个强大的分类工具,大型结构数据库。

英文摘要:

A multitude of measures have been proposed to quantify the similarity between protein 3-D structure. Among these measures, contact map overlap (CMO) maximization deserved sustained attention during past decade because it offers a fine estimation of the natural homology relation between proteins. Despite this large involvement of the bioinformatics and computer science community, the performance of known algorithms remains modest. Due to the complexity of the problem, they got stuck on relatively small instances and are not applicable for large scale comparison. This paper offers a clear improvement over past methods in this respect. We present a new integer programming model for CMO and propose an exact B &B algorithm with bounds computed by solving Lagrangian relaxation. The efficiency of the approach is demonstrated on a popular small benchmark (Skolnick set, 40 domains). On this set our algorithm significantly outperforms the best existing exact algorithms, and yet provides lower and upper bounds of better quality. Some hard CMO instances have been solved for the first time and within reasonable time limits. From the values of the running time and the relative gap (relative difference between upper and lower bounds), we obtained the right classification for this test. These encouraging result led us to design a harder benchmark to better assess the classification capability of our approach. We constructed a large scale set of 300 protein domains (a subset of ASTRAL database) that we have called Proteus 300. Using the relative gap of any of the 44850 couples as a similarity measure, we obtained a classification in very good agreement with SCOP. Our algorithm provides thus a powerful classification tool for large structure databases.

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

↑