Improved DNA algorithm of Chinese postman problem

DNA computing is a novel method for solving a class of intractable computational problems, in which the computing can grow exponentially with the problem size. Till now, many accomplishments have been achieved to improve its performance and increase its reliability. A Chinese Postman Problem of real number edge weighed has been solved by means of new DNA encoding methods. Seven vertices simple weighed graph was encoded in molecules of DNA, and the "operations" of the computation were performed with ligation, annealing and melting, separate sequencing. This work represents further evidence for the ability of DNA computing to solve graph theory and combinatorial optimization problems.