首页> 外文会议>Middle East Conference on Biomedical Engineering >Finding protein active sites using approximate sub-graph isomorphism
【24h】

Finding protein active sites using approximate sub-graph isomorphism

机译:使用近似子图同构术发现蛋白质活性位点

获取原文

摘要

Prediction of the amino acids that have a catalytic effect on the enzymes is a major stage in appointing the activity of the enzymes and classification. The biological activity of a protein usually depends on the existence of a small number of amino acids. Recently, many algorithms have been proposed in the literature for finding these amino acids which are complex and time consuming. In this paper, we will introduce a new method for predicting the active sites that will use the spatial coordinates and the type of amino acids that contain the active sites. In order to increase the speed we use an approximate graph isomorphism algorithm. Furthermore, this algorithm allows us to find several active sites for a protein and order them according to a RMSD (Root Mean Square Deviation) number which has several applications in biology.
机译:对酶催化作用的氨基酸预测是指定酶和分类的活性的主要阶段。蛋白质的生物活性通常取决于存在少量氨基酸。最近,在文献中提出了许多算法,用于找到复杂且耗时的这些氨基酸。在本文中,我们将引入一种预测将使用空间坐标和含有活性位点的氨基酸的活性位点的新方法。为了提高速度,我们使用近似图形同构算法。此外,该算法允许我们找到蛋白质的几个有源站点,并根据具有若干生物学应用的RMSD(均方均方偏差)数量来命令。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号