By Topic

Multi-Separation-Based DNA Algorithm of Graph Vertex Coloring Problem

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)
Yu-xing Yang ; Sch. of Comput. & Inf. Eng., Anyang Normal Univ., Anyang ; Ai-min Wang ; Ji-lan Ma

Separation operation in the experiment of DNA computing can separate DNA strands according to only one bit. It always need repeat the separation operation many times when solving actual problems; so it is very inefficient and time-exhausted. In order to solve this problem, Multi-separation techniques were proposed, and a multi-separation equipment model was designed, too. A DNA algorithm of The graph vertex coloring (GVC) Problem was proposed by using the idea of converting the problem into a satisfy-ability (SAT) problem. The multi-separation techniques were implied to solve GVC problem. The experiment steps were given through an instance; and the final correct coloring schemes were obtained, too. Comparing to other DNA algorithms of GVC problem, the multi-separation-based algorithm need less experiment steps and less DNA codes. At last, both the feasibility of the algorithm and the validity of multi-separation techniques were proved by the instance.

Published in:

Natural Computation, 2008. ICNC '08. Fourth International Conference on  (Volume:7 )

Date of Conference:

18-20 Oct. 2008