Abstract：In order to take full advantage of the high parallelism and huge storage capacity of DNA molecules in biological computing, this paper introduced DNA computing into hierarchical clustering to do global research on data set. For realizing the nearest neighbor hierarchical clustering, an algorithm combining sticker model with 2-armed DNA molecules was put forward. Based on the idea of MST (Minimum Spanning Tree), the first thing to do was generating complex DNA strands of all combinations of edges and then screening those containing n-1 edges. Based on the edges, it is needed to set the corresponding vertex stickers and keep those strands covering all the vertices. After that, weight strands constructed by 2-armed molecules would be appended at the end of the complex strands and the shortest ones could be detected by gel electrophoresis. Finally, by fluorescence analysis the clustering result can be got. In computer simulation, this algorithm may take different lengths of edges into account instead of varying the polynomial time complexity and the number of steps to read final results is set as a constant.
白雪 任晓玲 刘希玉. 基于粘贴和2-臂DNA模型的层次聚类算法[J]. 计算机应用, 2013, 33(02): 308-315.
BAI Xue REN Xiaoling LIU Xiyu. Hierarchical clustering algorithm based on sticker and 2-armed DNA model. Journal of Computer Applications, 2013, 33(02): 308-315.
2013, Vol. 33 
