| 图的顶点着色问题的一种DNA算法 |
| |
| 引用本文： | 孙川,朱翔鸥,刘文斌,许进. 图的顶点着色问题的一种DNA算法[J]. 计算机工程与应用, 2006, 42(4): 58-60,67 |
| |
| 作者姓名： | 孙川 朱翔鸥 刘文斌 许进 |
| |
| 作者单位： | 黄石理工学院机电工程系,湖北,黄石,435003;温州大学计算机科学与工程学院,浙江,温州,325027;华中科技大学系统科学研究所,武汉,430074 |
| |
| 摘 要： | 在构造了一种新型的“类发夹”式探针的基础上,给出了图的顶点着色问题的一种DNA算法。利用顶点的适当编码,该算法直接生成可满足解空间,无须在全体解空间中进行各种过滤过程,使用常规的生物操作完成可满足解空间的产生及最终解的分离。
|
| 关 键 词： | DNA算法 图顶点着色问题 探针 编码 |
| 文章编号： | 1002-8331-（2006）04-0058-03 |
| 收稿时间： | 2005-09-01 |
| 修稿时间： | 2005-09-01 |
A DNA Algorithm for the Graph Vertex Coloring Problem |
| |
| Sun Chuan,Zhu Xiangou,Liu Wenbing,Xu Jin. A DNA Algorithm for the Graph Vertex Coloring Problem[J]. Computer Engineering and Applications, 2006, 42(4): 58-60,67 |
| |
| Authors: | Sun Chuan Zhu Xiangou Liu Wenbing Xu Jin |
| |
| Affiliation: | 1.Dept.of Mechanic and Electronic Engineering, Huangshi Polytechnic College, Huangshi,Hubei 435003; 2.College of Computer Science and Engineering,Wenzhou University,Wenzhou,Zhejiang 325027; 3.System Science Research Institute,Huazhong University of Science and Technology,Wuhan 430074 |
| |
| Abstract: | A new-style pre-hairpin has type probe been constructed,and then a DNA algorithm for the graph vertex coloring problem has been presented.With the proper coding,a satisfiable solution space of the problem can be produced directly by this algorithm,so the various kinds of filtration course are not needed in the total solution space. The satisfiable solution is solved by tube operation that performs the basic core processing and extraction that makes the results visible. |
| |
| Keywords: | DNA algorithm graph vertex coloring problem probe encoding |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
