FAST PARALLEL DNA SOLUTION TO ORIENTED COLORING PROBLEM

In this paper, a DNA based computing model for solving the oriented coloring problem is proposed. This model shows how to use DNA strands to construct solution space of molecules for the oriented coloring problem and how to apply the DNA algorithm to solve the oriented coloring problem using biological operations. The algorithm is highly parallel and has satisfactory fidelity. The time complexity of the algorithm is O (n2+m2), where n is the number of vertices of the graph and m is the number of edges of the graph.