DocumentCode :
690561
Title :
DNA Computing to Solve Vertex Coloring Problem
Author :
Hasudungan, Rofilde ; Abu Bakar, Raudah
Author_Institution :
Fakulty of Comput. Syst. & Software Eng., Univ. Malaysia Pahang, Gambang, Malaysia
fYear :
2013
fDate :
23-24 Dec. 2013
Firstpage :
341
Lastpage :
345
Abstract :
DNA computing or well known as molecular computing is computing technique using DNA molecule to store information and using biochemistry operation as computational tool to manipulate string in DNA strand to produce the result. Lipton point out massive parallelism and storage capacity make this convenient to solve combinatorial problems. In this paper we proposed DNA based computer to solve vertex coloring problem where in this paper we proposed DNA encoding and computational procedure inspired by greedy algorithm to generate all possible solutions to coloring a graph.
Keywords :
biocomputing; graph colouring; greedy algorithms; mathematics computing; DNA computing technique; DNA encoding; biochemistry operation; graph coloring; greedy algorithm; molecular computing; vertex coloring problem; Color; Computers; DNA; DNA computing; Encoding; Greedy algorithms; Molecular computing; Combinatorial Problem; DNA Encoding Schema; DNA computing; Greedy Algorithm; Vertex Coloring Problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Advanced Computer Science Applications and Technologies (ACSAT), 2013 International Conference on
Conference_Location :
Kuching
Type :
conf
DOI :
10.1109/ACSAT.2013.74
Filename :
6836603
Link To Document :
بازگشت