• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Mathematics and computers in simulation >An Improved Non-dominated Sorting Genetic Algorithm-Ⅱ (INSGA-Ⅱ) applied to the design of DNA codewords
【24h】

An Improved Non-dominated Sorting Genetic Algorithm-Ⅱ (INSGA-Ⅱ) applied to the design of DNA codewords

机译：改进的非支配排序遗传算法Ⅱ（INSGA-Ⅱ）在DNA码字设计中的应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

DNA codewords design is critical for many research fields, from DNA computing, to DNA hybridization arrays, to DNA nanotechnology. Results in the literature rely on a wide variety of design criteria adapted to the particular requirements of each application. Since DNA codewords design can be regarded as a multi-objective optimization problem, and nondominated sorting genetic algorithm II (NSGA-II) has been demonstrated as one of the most efficient algorithms for multi-objective optimization problems, in this paper, we proposed an improved nondominated sorting genetic algorithm II (INSGA-II) for the design of DNA codewords. The novelty of our method is that introduced the constraints to the non-dominated sorting process. The performance of our method is compared with other DNA codewords design methods, and the experiment results in silico showed that the INSGA-II has a higher convergence speed and better population diversity than those of other algorithms, and can provide reliable and effective codewords for the controllable DNA computing.
机译：DNA代码字设计对于从DNA计算到DNA杂交阵列再到DNA纳米技术的许多研究领域都至关重要。文献中的结果依赖于各种设计标准，这些标准适用于每种应用的特定要求。由于DNA码字设计可以被视为多目标优化问题，并且非支配排序遗传算法II（NSGA-II）已被证明是解决多目标优化问题的最有效算法之一，因此，我们提出了一种改进的非支配排序遗传算法II（INSGA-II），用于设计DNA码字。我们方法的新颖之处在于将约束引入了非支配排序过程。将我们的方法的性能与其他DNA码字设计方法进行了比较，计算机模拟实验结果表明INSGA-II具有比其他算法更高的收敛速度和更好的种群多样性，并且可以为算法提供可靠有效的码字。可控制的DNA计算。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号