首页> 外文期刊>Network Modeling Analysis in Health Informatics and Bioinformatics >A hybrid harmony search algorithm for ab initio protein tertiary structure prediction
【24h】

A hybrid harmony search algorithm for ab initio protein tertiary structure prediction

机译:从头算蛋白质三级结构预测的混合和声搜索算法

获取原文
获取原文并翻译 | 示例
           

摘要

Predicting the tertiary structure of proteins from their linear sequence is a big challenge in biology. The existing computational methods are not powerful enough to search for the precise structure in a huge conformational space. This inadequate capability of the computational methods, however, is a major obstacle when trying to tackle this problem. The observations of some previous studies have revealed much interest in hybridizing a local search-based metahuristic algorithm within the population-based metahuristic algorithm. This study introduces a hybrid harmony search algorithm (HHSA) as a means to solve ab initio protein tertiary structure prediction problem. In HHSA, the iterated local search (ILS) is incorporated with the harmony search algorithm (HSA) to empower it so as to find the local optimal solution within the search space of the new harmony. Furthermore, the global-best concept of particle swarm optimization (PSO) is incorporated in memory consideration as a selection scheme to accelerate the convergence speed. The HHSA predicts the tertiary structure of a protein giving its sequence alone (i.e., from scratch). Our algorithm converges faster than the classical harmony search algorithm. We evaluate our algorithm using two protein sequences. The results show that our algorithm can find more precise solutions than other previous studies.
机译:从其线性序列预测蛋白质的三级结构是生物学中的一大挑战。现有的计算方法还不足以在巨大的构象空间中搜索精确的结构。然而,计算方法的这种能力不足是试图解决该问题的主要障碍。先前一些研究的观察结果显示,在基于人口的元变数算法中混合了基于本地搜索的元变数算法的兴趣很大。这项研究引入了一种混合和声搜索算法(HHSA)作为解决从头算蛋白质三级结构预测问题的方法。在HHSA中,迭代局部搜索(ILS)与和声搜索算法(HSA)结合使用以使其具有能力,以便在新和声的搜索空间内找到局部最优解。此外,粒子群优化(PSO)的全球最佳概念已纳入内存考虑中,作为加快收敛速度​​的选择方案。 HHSA预测蛋白质的三级结构,使其单独给出序列(即从头开始)。我们的算法收敛速度比经典和声搜索算法快。我们使用两个蛋白质序列评估我们的算法。结果表明,与以前的研究相比,我们的算法可以找到更精确的解决方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号