DNA Computing Model for the Minimum Spanning Tree Problem

Abstract

We have devised a DNA encoding method and a corresponding DNA algorithm for the minimum spanning tree problem, an instance of optimization problems on weighted graphs. In order to find out the minimum spanning trees of a weighted graph G= (V, E, W) by means of molecular biology techniques, we encode each vertex viisinV using one recognition code of length l, l=max{[log4n], 6}; we encode each edge eijisinE using two DNA strands of length 2p=2max{wij, l}; for any two adjacent edges eije jk we add one DNA strand saijk of length wij +Wjk as an additional code. We also presented a DNA algorithm for the minimum spanning tree problem based on the proposed DNA encoding method, in which we firstly obtain the Euler cycle corresponding to the minimum spanning tree by means of the molecular biology techniques, and then the Euler cycle is converted to the minimum spanning tree. Our work provides further evidence for the ability of DNA computing to solve numerical optimization problems