DNA Algorithm Based on Incomplete Molecule Commixed Encoding for the Shortest Path Problem

DNA algorithms have solved some NP-complete problems such as Hamilton path and Chinese postman problem; however there are only some suggestions for the shortest path problem. Weight encoding is a very important and challenge aspect in DNA computing. In this paper a computing method which based on incomplete Molecule Commixed Encoding (IMCE) is proposed. In this method, the vertex of the graph is encoded as single-strand, weight is encoded as double-strands and the edge is incomplete encoded. This method is used to solve the shortest path problem.