Afrasiabi Fatemeh, Dehghanpoor Ramin, Haspel Nurit
Department of Computer Science, University of Massachusetts Boston, Boston, MA 02125, USA.
Molecules. 2021 Apr 16;26(8):2329. doi: 10.3390/molecules26082329.
To understand how proteins function on a cellular level, it is of paramount importance to understand their structures and dynamics, including the conformational changes they undergo to carry out their function. For the aforementioned reasons, the study of large conformational changes in proteins has been an interest to researchers for years. However, since some proteins experience rapid and transient conformational changes, it is hard to experimentally capture the intermediate structures. Additionally, computational brute force methods are computationally intractable, which makes it impossible to find these pathways which require a search in a high-dimensional, complex space. In our previous work, we implemented a hybrid algorithm that combines Monte-Carlo (MC) sampling and RRT*, a version of the Rapidly Exploring Random Trees (RRT) robotics-based method, to make the conformational exploration more accurate and efficient, and produce smooth conformational pathways. In this work, we integrated the rigidity analysis of proteins into our algorithm to guide the search to explore flexible regions. We demonstrate that rigidity analysis dramatically reduces the run time and accelerates convergence.
为了在细胞水平上理解蛋白质的功能,了解其结构和动力学至关重要,包括它们为执行功能而经历的构象变化。由于上述原因,蛋白质中大的构象变化的研究多年来一直是研究人员感兴趣的课题。然而,由于一些蛋白质会经历快速且短暂的构象变化,很难通过实验捕捉中间结构。此外,计算蛮力方法在计算上难以处理,这使得无法找到这些需要在高维复杂空间中进行搜索的途径。在我们之前的工作中,我们实现了一种混合算法,该算法结合了蒙特卡罗(MC)采样和RRT*(基于机器人技术的快速探索随机树(RRT)方法的一个版本),以使构象探索更加准确和高效,并产生平滑的构象途径。在这项工作中,我们将蛋白质的刚性分析集成到我们的算法中,以指导搜索来探索柔性区域。我们证明刚性分析显著减少了运行时间并加速了收敛。