.png){kind=icon}
返回
An Unenumerative DNA Computing Model for Vertex Coloring Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TNB.2011.2160996.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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).
Keyword:
DNA computing
polymerase chain reaction
vertex coloring
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.4
论文数:
1.4K
被引数:
2.5K
机构
引用论文
.png){kind=icon}
Performance and limits of feedback cooling methods for levitated oscillators: A direct comparison
OAAI
OAAI分享收藏 没有更多内容
没有更多内容