首页> 外文会议>2011 1st 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 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号