期刊
IEEE ACCESS
卷 7, 期 -, 页码 88811-88821出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2924708
关键词
BPSON algorithm; DNA computing; DNA codes design; fast nondominated sort
资金
- National Natural Science Foundation of China [61425002, 61751203, 61772100, 61702070, 61672121, 61572093, 61802040]
- Program for Changjiang Scholars and Innovative Research Team in University [IRT_15R07]
- Program for Liaoning Innovative Research Team in University [LT2017012]
- Natural Science Foundation of Liaoning Province [20180551241]
- High-level Talent Innovation Support Program of Dalian City [2017RQ060]
DNA computing proposed by Adelman is new biotechnology which provides a new way to solve NP-hard problem. It has a promising future and successful results of various applications. DNA codes design is a significant step in DNA computing. Therefore, reliable DNA codes design not only can avoid non-specific hybridization between a code and its Watson-Crick complement but also can improve the efficiency of DNA computing. In this paper, a new algorithm is proposed to design reliable DNA codes. This algorithm combines the Bat algorithm and PSO algorithm. Fast nondominated sorting is used to assign a rank for codes. Thus, it is called BPSON for short. A bat algorithm is used to overcome PSO fall into the local optimal solution and enhance global search ability. In addition, for the purpose of verifying the effectiveness of our algorithm, the performance of BPSON is compared with the previous works. The experimental results show that codes obtained by our algorithm can avoid the appearance of secondary structure, which is beneficial to the specific hybridization among codes and has better thermodynamic properties. The results show that our algorithm can provide optimal codes for DNA computing.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据