The Optimization of DNA Encoding Sequences Based on Improved AFS Algorithms
The quality of DNA encoding sequences will not only directly affect the efficiency of DNA computing but also determine the reliability of the biology process. So the ideal encoding sequence design in DNA computing is one of the core issues. Because the design is a complex nonlinear constrained optimization problem, so a new Artificial Fish Swarm Algorithm (AFSA) can be applied to the optimization of the DNA encoding sequences. A constraint handling strategy suit for AFSA is proposed and an improved AFSA is presented by adjusting the parameter automatically in basic AFSA to enhance the search capability of the algorithm in the local area for the encoding sequence design. The simulation results show that the algorithm can improve the quality of encoding sequences while reducing search time.
Artificial Fish Swarm Algorithm DNA encoding sequences hamming distance similarity continuity
Guangzhao Cui Xianghong Cao Junhe Zhou Yanfeng Wang
College of Electrical Information Engineering Zhengzhou University of Light Industry HeNan, Zhengzhou China
国际会议
2007 IEEE International Conference on Automation and Lofistics
山东济南
英文
2007-08-18(万方平台首次上网日期,不代表论文的发表时间)