首页> 外文期刊>International Scholarly Research Notices >Simulated Annealing with Previous Solutions Applied to DNA Sequence Alignment
【24h】

Simulated Annealing with Previous Solutions Applied to DNA Sequence Alignment

机译:模拟退火与以前的解决方案应用于DNA序列比对

获取原文
       

摘要

A new algorithm for solving sequence alignment problem is proposed, which is named SAPS (Simulated Annealing with Previous Solutions). This algorithm is based on the classical Simulated Annealing (SA). SAPS is implemented in order to obtain results of pair and multiple sequence alignment. SA is a simulation of heating and cooling of a metal to solve an optimization problem. In order to select randomly a current solution, SAPS algorithm chooses a solution from solutions that have been previously generated within the Metropolis Cycle. This simple change has led to increase the quality of the solution to the problem of aligning genomic sequences with respect to the classical Simulated Annealing algorithm. The parameters of SAPS, for certain instances, are tuned by an analytical method, and some parameters have experimentally been tuned. SAPS has generated high-quality results in comparison with the classical SA. The instances used are specific genes of the AIDS virus.
机译:提出了一种解决序列比对问题的新算法,称为SAPS(模拟退火)。该算法基于经典的模拟退火(SA)。实施SAPS是为了获得配对和多序列比对的结果。 SA是对金属加热和冷却以解决优化问题的模拟。为了随机选择当前解决方案,SAPS算法从大都会周期内先前生成的解决方案中选择一个解决方案。这种简单的变化已提高了相对于经典的模拟退火算法对齐基因组序列问题的解决方案的质量。在某些情况下,SAPS的参数通过分析方法进行调整,并且某些参数已通过实验进行了调整。与经典SA相比,SAPS产生了高质量的结果。使用的实例是艾滋病病毒的特定基因。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号