首页> 外文会议>IEEE International Conference on Bioinformatics and Biomedicine >Selecting near-native structures from decoys using maximal cliques
【24h】

Selecting near-native structures from decoys using maximal cliques

机译:使用最大派系从诱饵中选择近本地结构

获取原文

摘要

Protein structure prediction is one of the most important subjects in computational structural biology. In the process of protein structure prediction, many structure decoys are obtained. It has remained an unsolved and challenging problem to select the best model from the structure decoys that are closest to the native structure. One of the important methods for selecting the near-native structure is by clustering the structure decoys. The traditional methods simply use clustering methods which are usually not appropriate in the high dimensional conformation space. Here we propose a method based on maximal cliques in graph theory to solve this problem. The similarities between the decoys are first computed using TM-score, and a graph is built using the shared nearest neighbor (SNN) information among the decoys. Then the maximal cliques of the graph are found and the centroids of these maximal cliques are selected as near-native structures. The experiments show that, compared to the traditional methods, the proposed method can select better near-native structures which have higher similarities with the native structures.
机译:蛋白质结构预测是计算结构生物学中最重要的主题之一。在蛋白质结构预测过程中,获得了许多结构诱饵。从最接近天然结构的结构诱饵中选择最佳模型仍然是一个尚未解决的挑战性问题。选择近邻结构的重要方法之一是对结构诱饵进行聚类。传统方法仅使用通常在高维构象空间中不适合的聚类方法。在这里,我们提出了一种基于最大群论的图论方法来解决这个问题。首先使用TM分数计算诱饵之间的相似度,并使用诱饵之间的共享最近邻(SNN)信息构建图。然后找到图的最大集团,并选择这些最大集团的质心作为近本机结构。实验表明,与传统方法相比,该方法可以选择与本地结构具有较高相似性的近邻结构。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号