Please wait a minute...
Submit  |   Chinese  | 
Advanced Search
   Home  |  Online Now  |  Current Issue  |  Focus  |  Archive  |  For Authors  |  Journal Information   Open Access  
Submit  |   Chinese  | 
Engineering    2018, Vol. 4 Issue (1) : 61 -77
Research |
A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph
Jin Xu1(),Xiaoli Qiang2,Kai Zhang3,Cheng Zhang1,Jing Yang4
1. Key Laboratory of High Confidence Software Technologies of Ministry of Education, Institute of Software, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
2. Institute of Novel Computer Science and Intelligent Software, Guangzhou University, Guangzhou 510006, China
3. School of Computer Science, Wuhan University of Science and Technology, Wuhan 430081, China
4. School of Control and Computer Engineering, North China Electric Power University, Beijing 102206, China

The biggest bottleneck in DNA computing is exponential explosion, in which the DNA molecules used as data in information processing grow exponentially with an increase of problem size. To overcome this bottleneck and improve the processing speed, we propose a DNA computing model to solve the graph vertex coloring problem. The main points of the model are as follows:①The exponential explosion problem is solved by dividing subgraphs, reducing the vertex colors without losing the solutions, and ordering the vertices in subgraphs; and②the bio-operation times are reduced considerably by a designed parallel polymerase chain reaction (PCR) technology that dramatically improves the processing speed. In this article, a 3-colorable graph with 61 vertices is used to illustrate the capability of the DNA computing model. The experiment showed that not only are all the solutions of the graph found, but also more than 99% of false solutions are deleted when the initial solution space is constructed. The powerful computational capability of the model was based on specific reactions among the large number of nanoscale oligonucleotide strands. All these tiny strands are operated by DNA self-assembly and parallel PCR. After thousands of accurate PCR operations, the solutions were found by recognizing, splicing, and assembling. We also prove that the searching capability of this model is up to O(359). By means of an exhaustive search, it would take more than 896 000 years for an electronic computer (5 1014 s1) to achieve this enormous task. This searching capability is the largest among both the electronic and non-electronic computers that have been developed since the DNA computing model was proposed by Adleman’s research group in 2002 (with a searching capability of O(220)).

Keywords DNA computing      Graph vertex coloring problem      Polymerase chain reaction     
Corresponding Authors: Jin Xu   
Just Accepted Date: 05 March 2018   Issue Date: 10 April 2018
E-mail this article
E-mail Alert
Articles by authors
Jin Xu
Xiaoli Qiang
Kai Zhang
Cheng Zhang
Jing Yang
Cite this article:   
Jin Xu,Xiaoli Qiang,Kai Zhang, et al. A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph[J]. Engineering, 2018, 4(1): 61 -77 .
URL:     OR
No related articles found!
Copyright © 2015 Higher Education Press & Engineering Sciences Press, All Rights Reserved.