DNA Computing Technique to Solve Vertex Coloring Problem

Hasudungan, Rofilde and Rohani, Abu Bakar (2013) DNA Computing Technique to Solve Vertex Coloring Problem. In: 2013 International Conference on Advanced Computer Science Applications and Technologies (ACSAT), 23-24 Dec. 2013 , Kuching. pp. 341-345..

[img] PDF
DNA_Computing_to_Solve_Vertex_Coloring_Problem.pdf - Published Version
Restricted to Repository staff only

Download (667kB) | Request a copy


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.

Item Type: Conference or Workshop Item (Other)
Uncontrolled Keywords: DNA computing; Vertex Coloring Problem; Combinatorial Problem; Greedy Algorithm; DNA Encoding Schema
Subjects: Q Science > QA Mathematics > QA76 Computer software
Faculty/Division: Faculty of Computer System And Software Engineering
Depositing User: Mrs. Neng Sury Sulaiman
Date Deposited: 09 Sep 2014 00:51
Last Modified: 22 May 2018 03:04
URI: http://umpir.ump.edu.my/id/eprint/6583
Download Statistic: View Download Statistics

Actions (login required)

View Item View Item