【24h】

Improved Genetic Algorithm for Designing DNA Sequences

机译:设计DNA序列的改进遗传算法

获取原文

摘要

Designing DNA sequences is one of the most practical and important research topics in DNA computing. An improved genetic algorithm for designing of the equal-length single-stranded DNA sequences is proposed, especially for the short DNA sequences needed in the DNA computing experiment. This algorithm can satisfy certain combinatorial and thermodynamic constraints such as GC content constraint, Hamming distance constraint and similarity constraint. It can generate the good short DNA sequences quickly by giving up the bad sequences in every generation. Finally, through analyzing the experiment data, two formulas are given to estimate the number of the DNA sequences satisfied GC content constraint and Hamming distance constraint.
机译:设计DNA序列是DNA计算中最实用,最重要的研究主题之一。提出了一种用于设计等长单链DNA序列的改进遗传算法,特别是针对DNA计算实验中所需的短DNA序列。该算法可以满足一定的组合和热力学约束,例如GC含量约束,汉明距离约束和相似性约束。通过放弃每一代中的不良序列,它可以快速生成良好的短DNA序列。最后,通过分析实验数据,给出了两个公式来估计满足GC含量约束和汉明距离约束的DNA序列的数目。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号