Department of Computer Science and Information Engineering, National Chung Cheng University, 168 University Road, Minhsiung Township, Chiayi County 62102, Taiwan.
Proteome Sci. 2013 Nov 7;11(Suppl 1):S19. doi: 10.1186/1477-5956-11-S1-S19.
Proteins are essential biological molecules which play vital roles in nearly all biological processes. It is the tertiary structure of a protein that determines its functions. Therefore the prediction of a protein's tertiary structure based on its primary amino acid sequence has long been the most important and challenging subject in biochemistry, molecular biology and biophysics. In the past, the HP lattice model was one of the ab initio methods that many researchers used to forecast the protein structure. Although these kinds of simplified methods could not achieve high resolution, they provided a macrocosm-optimized protein structure. The model has been employed to investigate general principles of protein folding, and plays an important role in the prediction of protein structures.
In this paper, we present an improved evolutionary algorithm for the protein folding problem. We study the problem on the 3D FCC lattice HP model which has been widely used in previous research. Our focus is to develop evolutionary algorithms (EA) which are robust, easy to implement and can handle various energy functions. We propose to combine three different local search methods, including lattice rotation for crossover, K-site move for mutation, and generalized pull move; these form our key components to improve previous EA-based approaches.
We have carried out experiments over several data sets which were used in previous research. The results of the experiments show that our approach is able to find optimal conformations which were not found by previous EA-based approaches.
We have investigated the geometric properties of the 3D FCC lattice and developed several local search techniques to improve traditional EA-based approaches to the protein folding problem. It is known that EA-based approaches are robust and can handle arbitrary energy functions. Our results further show that by extensive development of local searches, EA can also be very effective for finding optimal conformations on the 3D FCC HP model. Furthermore, the local searches developed in this paper can be integrated with other approaches such as the Monte Carlo and Tabu searches to improve their performance.
蛋白质是生命活动中不可或缺的生物分子,几乎参与所有的生物过程。蛋白质的功能取决于其三级结构。因此,基于一级氨基酸序列预测蛋白质的三级结构一直是生物化学、分子生物学和生物物理学中最重要和最具挑战性的课题。过去,HP 晶格模型是许多研究人员用于预测蛋白质结构的从头计算方法之一。尽管这些简化方法无法达到高分辨率,但它们提供了一种宏观优化的蛋白质结构。该模型已被用于研究蛋白质折叠的一般原理,并在蛋白质结构预测中发挥着重要作用。
本文提出了一种用于蛋白质折叠问题的改进进化算法。我们在以前研究中广泛使用的 3D FCC 晶格 HP 模型上研究了这个问题。我们的重点是开发鲁棒、易于实现且能够处理各种能量函数的进化算法。我们提出结合三种不同的局部搜索方法,包括用于交叉的晶格旋转、用于突变的 K-位移动以及广义拉移动;这些构成了我们改进以前基于 EA 的方法的关键组成部分。
我们对几个以前研究中使用的数据进行了实验。实验结果表明,我们的方法能够找到以前基于 EA 的方法找不到的最优构象。
我们研究了 3D FCC 晶格的几何性质,并开发了几种局部搜索技术来改进传统的基于 EA 的蛋白质折叠问题的方法。众所周知,基于 EA 的方法具有鲁棒性,能够处理任意的能量函数。我们的结果进一步表明,通过广泛开发局部搜索,EA 也可以非常有效地在 3D FCC HP 模型上找到最优构象。此外,本文中开发的局部搜索可以与其他方法(如蒙特卡罗和禁忌搜索)集成,以提高它们的性能。