Application of DNA computing in graph theory

Authors:
Hossein Eghdami;Majid Darehmiraki
Affiliations:
Department of Mathematics, University of Birjand, Birjand, Iran;Department of Mathematics, Khatam alanbia University of technology, Behbahan, Khouzestan, Iran
Venue:
Artificial Intelligence Review
Year:
2012

Citing 4
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Topics in the theory of DNA computing

Theoretical Computer Science - Natural computing
Fast parallel molecular solution to the dominating-set problem on massively parallel bio-computing

Parallel Computing - Special issue: High-performance parallel bio-computing
Using sticker to solve the 3-dimensional matching problem in molecular supercomputers

International Journal of High Performance Computing and Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although DNA computing was rapidly discarded when researchers realized some of the drawbacks related to it, but by computer simulation of molecular reaction it may be implemented in silico by computer architectures offering massive parallelism. In this review, we describe sticker algorithm for several famous graph problem. Presented algorithms have polynomial time complexity.