DNA Computing Technique to Solve Vertex Coloring Problem

被引:1
|
作者
Hasudungan, Rofilde [1 ]
Abu Bakar, Rohani [1 ]
机构
[1] Univ Malaysia Pahang, Fak Comp Syst & Software Engn, Gambang, Malaysia
关键词
DNA computing; Vertex Coloring Problem; Combinatorial Problem; Greedy Algorithm; DNA Encoding Schema;
D O I
10.1109/ACSAT.2013.74
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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 from greedy algorithm to generate all possible solutions to coloring a graph.
引用
下载
收藏
页码:341 / 345
页数:5
相关论文
共 50 条
  • [21] A metaheuristic approach for the vertex coloring problem
    Malaguti, Enrico
    Monaci, Michele
    Toth, Paolo
    INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 302 - 316
  • [22] The Vertex Coloring Problem and its generalizations
    Enrico Malaguti
    4OR, 2009, 7 : 101 - 104
  • [23] A DNA algorithm of graph vertex coloring problem based on multi-separation
    Wang, Li
    PROCEEDINGS OF THE 2009 WRI GLOBAL CONGRESS ON INTELLIGENT SYSTEMS, VOL I, 2009, : 547 - 550
  • [24] DNA Self-Assembly for Graph Vertex 3-Coloring Problem
    Wang, Yanfeng
    Hu, Peipei
    Shi, Xiaolong
    Cui, Guangzhao
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2012, 9 (12) : 2086 - 2092
  • [25] Multi-separation-based DNA Algorithm of Graph Vertex Coloring Problem
    Yang, Yu-xing
    Wang, Ai-min
    Ma, Ji-lan
    ICNC 2008: FOURTH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, VOL 7, PROCEEDINGS, 2008, : 547 - +
  • [26] A DNA algorithm of graph vertex coloring problem based on multi-separation
    Jun-jie, Chen
    Hai-fang, Li
    Yu-xing, Yang
    Ji-lan, Ma
    2007 THIRD INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, VOL II, PROCEEDINGS, 2007, : 350 - 353
  • [27] USING DNA COMPUTING TO SOLVE MINIMUN SPANNING TREE PROBLEM
    Li, Yan
    CIICT 2008: PROCEEDINGS OF CHINA-IRELAND INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATIONS TECHNOLOGIES 2008, 2008, : 150 - 154
  • [28] DNA Computing Algorithm to Solve the Least Maximal Matching Problem
    Zhang, Lingmin
    Huang, Dongmei
    Wang, Zhaocai
    Ji, Zuwen
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (09) : 2348 - 2351
  • [29] On the asymmetric representatives formulation for the vertex coloring problem
    Campelo, Manoel
    Campos, Victor A.
    Correa, Ricardo C.
    DISCRETE APPLIED MATHEMATICS, 2008, 156 (07) : 1097 - 1111
  • [30] Fractional programming formulation for the vertex coloring problem
    Matsui, Tomomi
    Sukegawa, Noriyoshi
    Miyauchi, Atsushi
    INFORMATION PROCESSING LETTERS, 2014, 114 (12) : 706 - 709