QQ客服 官方微博 反馈留言

	An Unenumerative DNA Computing Model for Vertex Coloring Problem
	Xu, Jin ; Qiang, Xiaoli ; Yang, Yan ; Wang, Baoju ; Yang, Dongliang ; Luo, Liang ; Pan, Linqiang ; Wang, Shudong
	2011
关键词	DNA computing polymerase chain reaction vertex coloring MOLECULAR COMPUTATION
DOI	10.1109/TNB.2011.2160996
英文摘要	The solution space exponential explosion caused by the enumeration of the candidate solutions maybe is the biggest obstacle in DNA computing. In the paper, a new unenumerative DNA computing model for graph vertex coloring problem is presented based on two techniques: 1) ordering the vertex sequence for a given graph in such a way that any two consecutive labeled vertices i and i + 1 should be adjacent in the graph as much as possible; 2) reducing the number of encodings representing colors according to the construture of the given graph. A graph with 12 vertices without triangles is solved and its initial solution space includes only 283 DNA strands, which is 0.0532 of 3(12) (the worst complexity).; Biochemical Research Methods; Nanoscience & Nanotechnology; SCI(E); PubMed; 5; ARTICLE; 2; 94-98; 10
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/151834]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Xu, Jin,Qiang, Xiaoli,Yang, Yan,et al. An Unenumerative DNA Computing Model for Vertex Coloring Problem[J],2011.
APA	Xu, Jin.,Qiang, Xiaoli.,Yang, Yan.,Wang, Baoju.,Yang, Dongliang.,...&Wang, Shudong.(2011).An Unenumerative DNA Computing Model for Vertex Coloring Problem..
MLA	Xu, Jin,et al."An Unenumerative DNA Computing Model for Vertex Coloring Problem".(2011).

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

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