Applying DNA computation to clustering in graph

Using DNA computation to solve graph clustering problem is a new approach in this field. We use DNA strands to assign vertices and edges, constructing the minimum spanning tree and cutting branches whose length is longer than the threshold. All of the above steps are carried out in test tubes. Because of DNA computation's high parallelism, we can get the results rapidly.

I. Introduction

Clustering is the assignment of a set of data into subsets so that data in the same cluster are similar and data between clusters are different. Graph clustering can divide vertices and their connected edges into subgraph so that vertices in the same subgraph are closely connected and vertices' connection between different subgraph are not close.