Application of DNA computing in graph theory
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.
dna computing graph theory np-complete