.png){kind=icon}
返回
Multiobjective evolutionary optimization of DNA sequences for reliable DNA computing
.png){kind=icon}
OA
AI
DOI：10.1109/TEVC.2005.844166.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
DNA computing relies on biochemical reactions of DNA molecules and may result in incorrect or undesirable computations. Therefore, much work has focused on designing the DNA sequences to make the molecular computation more reliable. Sequence design involves with a number of heterogeneous and conflicting design criteria and traditional optimization methods may face difficulties. In this paper, we formulate the DNA sequence design as a multiobjective optimization problem and solve it using a constrained multiobjective evolutionary algorithm (EA). The method is implemented into the DNA sequence design system, NACST/Seq, with a suite of sequence-analysis tools to help choose the best solutions among many alternatives. The performance of NACST/Seq is compared with other sequence design methods, and analyzed on a traveling salesman problem solved by bio-lab experiments. Our experimental results show that the evolutionary sequence design by NACST/Seq outperforms in its reliability the existing sequence design techniques such as conventional EAs, simulated annealing, and specialized heuristic methods.
Keyword:
DNA computing
DNA sequence design
multiobjective evolutionary algorithm (MOEA)
nucleic acid computing simulation toolkit/sequence generator (NACST/Seq)
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏In vitro rooting of leguminous plants: Difficulties, alternatives, and strategies for improvement
PREAI
分享收藏A novel hybrid feature selection based on ReliefF and binary dragonfly for high dimensional datasets
PREAI
分享收藏分享收藏
查看更多内容