Optimization of GN algorithm based on DNA computation

DNA computation is a new computing model with high performance in storage of DNA molecules and parallelism of biochemical reactions, but it needs complex conditions of biochemical operation, likely astable and uncontrollable. The main work of this paper is optimizing GN algorithm to solve a graph clustering question on social networks, which simulated on computer using the DNA computation model to improve the computational efficiency. Simulation results of the Karate Club interpersonal relationship network indicate that the proposed algorithm has a better performance than traditional GN algorithm.