DNA Encoding Method of Weight for Chinese Postman Problem

We have devised a new DNA encoding method to represent numerical values and apply it to solve the Chinese postman problem, an instance of optimization problems on weighted graphs. For any a weighted, undirected graph G=(V,E), v_iisin V, 1lesilesn, e_jisinE, 1lesjlesm, where exists a numerical value (weight) w_j on edge e_j, we convert it into its half-dual graph G´=(V´,E´), v_i´isin V´, 1lesilesm, where v_i´ is mapped from e_i. Our DNA encoding method is based on the half-dual graph G´=( V´,E´). For any a vertex v_i, we use DNA strand s_i of length w_i to encode it. For any an edge v_i´v_j´, we use reverse complementation of the second half of s_i and the first half of s_j to encode it. Our work makes weight be easily dealt with and extends the capability of DNA computing to solve NP-hard problems.