DNA computation based clustering algorithm

Abstract

Using DNA computation to solve clustering problem is a new approach in this field. In the process of problem solving, we use DNA strands to assign vertices and edges, constructing the shortest Hamilton path and cutting branches whose length is longer than the threshold we gavegetting the initial clustering result. For improving the quality, we do the iterative calculation, getting clusters for every produced cluster, we deal all of the process with DNA computation in test tubes, reducing the time complexity obviously by DNAs high parallelism. In this paper, we give the process and analysis of our algorithm, illustrating the feasibility of the method.