The improvement of DNA algorithm to the Directed Shortest Hamilton Path Problem

Abstract

DNA computing has a relatively strong computing power. The principle of complementary bases and double-stranded structure of DNA provide a guarantee for varieties of encoding and computing. In this paper, based on the DNA algorithm to the Directed Shortest Hamilton Path Problem by Gao Lin, plasmid screening technology will be applied to solving the SHPP, and a special separation device will be used to separate the solutions to the greatest degree, eliminate unfeasible ones to avoid them further enlarging. According to the experimental methods of molecular biology, we illustrate that the proposed algorithm are very effective and feasible.