A DNA Computing Model for the Graph Vertex Coloring Problem Based on a Probe Graph. (February 2018)

• Record Type: Journal Article
• Authors: Xu, Jin; Qiang, Xiaoli; Zhang, Kai; Zhang, Cheng; Yang, Jing
• Is Part Of: Engineering. Volume 4:Number 1(2018)
• Page Start: 61
• Page End: 77
• Publication Date: 2018-02
• Subjects: DNA computing -- Graph vertex coloring problem -- Polymerase chain reaction; Engineering -- Periodicals; Engineering -- China -- Periodicals; 620.005
• DOI: 10.1016/j.eng.2018.02.011
• Languages: English
• ISSNs: 2095-8099

Abstract

Abstract: 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 (3 59 ). By means of an exhaustive search, it would take more than 896 000 years for an electronic computer (5 × 10 14 s −1 ) 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 (2 20 )).