By Topic

DNA Codewords Design Using Ant Colony Optimization Algorithm

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

5 Author(s)
Xinjin Wang ; Henan Key Lab. of Inf.-based Electr. Appliances, Zhengzhou Univ. of Light Ind., Zhengzhou, China ; Yongpeng Shen ; Xuncai Zhang ; Guangzhao Cui
more authors

Before performing the DNA computation, a set of specific DNA sequences are required. However, this is a burdensome task as too many constraints need to be satisfied. In this paper, ant colony algorithm is applied to solve the problem of DNA codewords design. Inspired by the traveling salesman problem, first a city matrix with T rows and S columns is designed, in which every city denotes a DNA sequence. Then the artificial ants begin to search for an optimal route based on the DNA thermodynamic and combinational constraints. At last, the shortest rout with S sequences is the desired set of DNA codewords. The simulation results of the proposed approach shows better convergency and can provide reliable and effective codewords for the controllable DNA computation.

Published in:

Artificial Intelligence and Computational Intelligence (AICI), 2010 International Conference on  (Volume:3 )

Date of Conference:

23-24 Oct. 2010