DNA computing model of graph isomorphism based on three dimensional DNA graph structures

Authors:
Zhixiang Yin;Jianzhong Cui;Jing Yang;Guangwu Liu
Affiliations:
Department of Mathematics and Physics, AnHui University of Science and Technology, Huainan City, China;Department of Mathematics and Physics, AnHui University of Science and Technology, Huainan City, China;Department of Mathematics and Physics, AnHui University of Science and Technology, Huainan City, China;Department of Mathematics, Wuhan University of Technology, Wuhan City, China
Venue:
ICIC'05 Proceedings of the 2005 international conference on Advances in Intelligent Computing - Volume Part II
Year:
2005

Citing 3
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Using DNA to solve the bounded Post correspondence problem

Theoretical Computer Science - Special issue on universal machines and computations
Graph Theory With Applications

Graph Theory With Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

An DNA computing model of solving the graph isomorphism problem with 3-D DNA structures is proposed in this paper. The k-armed branched junction molecules are used to encode k-degree vertices. Double stranded molecules are used to encode edges. These molecules are to be mixed in a test tube to be ligated. The reaction product can be detected by gel electrophoresis. The time complexity of the algorithm is o(n2) , where n is the number of vertices of the graph.