A Molecular Computing Model for Maximum Independent Set Based on Origami   and Greedy Algorithm

doi:10.1166/jctn.2014.3565

CORC > 北京大学 > 信息科学技术学院

	A Molecular Computing Model for Maximum Independent Set Based on Origami and Greedy Algorithm
	Wang Xixu ; Li Jing ; Song Zhichao ; Jing Yang ; Cheng Zhang ; Jin Xu
刊名	journal of computational and theoretical nanoscience
	2014
关键词	DNA Computing Maximum Independent Set Problem Greedy Algorithm Magnetic Bead DNA SOLUTION COMPUTATION
DOI	10.1166/jctn.2014.3565
英文摘要	Maximum independent set problem has been solved based on a specially designed origami structure. In this model, greedy algorithm is applied to solve the problem. It only needs to generate initial graph but not the solution space. Every time we delete a vertex which has the most adjacent vertexes until a maximum independent set appears. Thanks to the special origami structure represented a vertex, it becomes very easy to determine a vertex connected most adjacent vertexes and to clear it up. This method will help to find the maximum independent set more quickly compared with traditional method (generate solution space). For a n-vertex graph, the time complexity is O(n(2)) at most. And its space complexity is O(2n) at most. This model demonstrates a great advantage to deal with similar problems.; Chemistry, Multidisciplinary; Nanoscience & Nanotechnology; Materials Science, Multidisciplinary; Physics, Applied; Physics, Condensed Matter; SCI(E); EI; 1; ARTICLE; 8; 1773-1778; 11
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/389048]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Wang Xixu,Li Jing,Song Zhichao,et al. A Molecular Computing Model for Maximum Independent Set Based on Origami and Greedy Algorithm[J]. journal of computational and theoretical nanoscience,2014.
APA	Wang Xixu,Li Jing,Song Zhichao,Jing Yang,Cheng Zhang,&Jin Xu.(2014).A Molecular Computing Model for Maximum Independent Set Based on Origami and Greedy Algorithm.journal of computational and theoretical nanoscience.
MLA	Wang Xixu,et al."A Molecular Computing Model for Maximum Independent Set Based on Origami and Greedy Algorithm".journal of computational and theoretical nanoscience (2014).