By Topic

An efficient genetic algorithm based on the cultural algorithm applied to DNA codewords design

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yan-Feng Wang ; Coll. of Electr. & Electron. Eng., Zhengzhou Univ. of Light Ind., Dongfeng ; Ying Niu ; Guang-zhao Cui

DNA encoding problem, which has been proved to be an NP hard problem, is a key problem for DNA computing, and usually solved by optimization algorithms. A new efficient genetic algorithm based on cultural algorithm for the design of DNA codewords is presented in this paper. In this hybrid optimization method, to abstract and manage the information efficiently, the conventional genetic algorithm is combined with dual evolutionary frame of cultural algorithm to guide the evolution of population space with the evolutionary information. Simulation results show this method is convenient for users to design and select proper DNA codewords in silicon.

Published in:

Bio-Inspired Computing: Theories and Applications, 2008. BICTA 2008. 3rd International Conference on

Date of Conference:

Sept. 28 2008-Oct. 1 2008