版权说明 操作指南
首页 > 成果 > 详情

Spanning tree problem based on sticker model

认领
导出
Link by DOI
反馈
分享
QQ微信 微博
成果类型:
期刊论文
作者:
Zhou, Kang;Ying, Liu;Tong, Xiaojun;Cheng, Zhen
通讯作者:
Zhou, K.(zhoukang_wh@yahoo.com.cn)
作者机构:
[Zhou, Kang; Tong, Xiaojun] School of Math and Computer, Wuhan Polytechnic University, Wuhan 430023, China
[Cheng, Zhen] College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou 310023, China
[Ying, Liu] School of Information Technology and Management Egineering, University of International Business and Economics, Beijing 100029, China
语种:
英文
期刊:
Proceedings of 4th International Workshop on Advanced Computational Intelligence, IWACI 2011
年:
2011
页码:
54-58
机构署名:
本校为第一机构
院系归属:
数学与计算机学院
摘要:
Composition and biochemistry experiments of sticker model and the realization process of fundamental biochemical experiments are discussed. Based on separation technology and electrophoresis experiment, a new detection experiment is put forward, which can be used to detect experimental results containing various kinds of memory complex. DNA algorithm of making all spanning tree problem and its biochemical realization process are put forward, first the initial solution space of spanning subgraph is created, then all spanning trees are selected from the initial solution space. During the creatin...

反馈

验证码:
看不清楚,换一个
确定
取消

成果认领

标题:
用户 作者 通讯作者
请选择
请选择
确定
取消

提示

该栏目需要登录且有访问权限才可以访问

如果您有访问权限,请直接 登录访问

如果您没有访问权限,请联系管理员申请开通

管理员联系邮箱:yun@hnwdkj.com