CORC  > 遥感与数字地球研究所  > SCI/EI期刊论文  > 期刊论文
A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem
Zhao, Kai1; Wang, Zhaocai1; Lu, Yunzhao1; Qin, Jiangfeng1; Tan, Jian1
刊名JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE
2015
卷号12期号:3页码:1307-1315
关键词DNA Computation The k-Vertex Cover Problem Adleman-Lipton Model NP-Complete Problem
通讯作者Wang, ZC (reprint author), Shanghai Ocean Univ, Coll Informat, Shanghai 201306, Peoples R China.
英文摘要The k-vertex cover problem aims to find a vertex cover set with k vertices in a given undirected graph. Based on biological molecular computation, the paper describes a new DNA procedure to solve K-vertex cover problem in O(n(2)) time complexity, which greatly simplifies the complexity of the computation.
研究领域[WOS]Chemistry, Multidisciplinary ; Nanoscience & Nanotechnology ; Materials Science, Multidisciplinary ; Physics, Applied ; Physics, Condensed Matter
收录类别SCI ; EI
语种英语
WOS记录号WOS:000352288500028
内容类型期刊论文
源URL[http://ir.ceode.ac.cn/handle/183411/38471]  
专题遥感与数字地球研究所_SCI/EI期刊论文_期刊论文
作者单位1.[Zhao, Kai] Pingdingshan Univ, Acad Affair Off, Pingdingshan 467000, Peoples R China
2.[Wang, Zhaocai] Shanghai Ocean Univ, Coll Informat, Shanghai 201306, Peoples R China
3.[Lu, Yunzhao] Univ Int Business & Econ, Sch Int Trade & Econ, Beijing 100029, Peoples R China
4.[Qin, Jiangfeng] Guangxi Inst Water Resources Res, Nanning 530023, Peoples R China
5.[Tan, Jian] Chinese Acad Sci, Key Lab Digital Earth, Ctr Earth Observat & Digital Earth, Beijing 100094, Peoples R China
推荐引用方式
GB/T 7714
Zhao, Kai,Wang, Zhaocai,Lu, Yunzhao,et al. A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem[J]. JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE,2015,12(3):1307-1315.
APA Zhao, Kai,Wang, Zhaocai,Lu, Yunzhao,Qin, Jiangfeng,&Tan, Jian.(2015).A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem.JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE,12(3),1307-1315.
MLA Zhao, Kai,et al."A New Biologically DNA Computational Algorithm to Solve the k-Vertex Cover Problem".JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE 12.3(2015):1307-1315.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace