A Nearest-neighbor Clustering Algorithm Based on 3-armed DNA Molecule Structures

• 作 者: RenXiaoling;LiuXiyu;
• 机 构: School of Management Science and Engineering,Shandong Normal University,J in an,China,250014
• 出 处: 管理科学与工程学会2012年年会暨第十届中国管理科学与工程论坛
• 发表日期: 2012年期

　　In this paper,the 3-dimentional DNA structures model is used to solve the nearest-neighbor clustering.Based on the fact that it can be transformed to MST problem,3-armed DNA molecules serve as the limb structures of a binary tree.And when combine all the specially designed 3-armed structures,all the tree structures are abtained.Then separate those containing all the vertices.Next find the lightest tree structures,which correspond to the MST.Read the color of vertices and threshold fragments to get the final result of clustering.Theoretically,the algorithm designed here has the exponential space complexity and the operation complexity is O(n).