The improvement on algorithm of DNA computing on 0-1 planning problem

被引：0

作者：

Zhou, Kang ^{[1
,2
]}

Tong, Xiao-Jun ^{[1
,2
]}

Xu, Jin ^{[2
]}

机构：

[1] Wuhan Polytech Univ, Dept Math & Phys, Wuhan 430023, Peoples R China

[2] Huazhong Univ Sci & Technol, Dept Control Sci & Engn, Wuhan 430023, Peoples R China

来源：

PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7 | 2006年

基金：

中国博士后科学基金;

关键词：

DNA chip; DNA computing; 0-1 planning problem; technique of electrophoresis; fluorescence labeling technique;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The old algorithm to solve 0-1 planning problem using DNA computing only searches the feasible solution set from all solution set, then we give an algorithm which can search optimization solution of 0-1 planning. problem from all solution set by encoding specially solution set, using technique of electrophoresis and fluorescence labeling technique, and then we give an example to explain the algorithm validity and correctness. We also give a kind of strategy to deal with the negative real number of value coefficient and the complexity of our algorithm is O(m).

引用

页码：4282 / +

页数：2

共 8 条

[1] MOLECULAR COMPUTATION OF SOLUTIONS TO COMBINATORIAL PROBLEMS [J].

ADLEMAN, LM .

SCIENCE, 1994, 266 (5187) :1021-1024

[2]

Bondy J.A., 2008, GRAD TEXTS MATH

[3]

DIAO ZJ, 1990, OPERATIONS RES

[4]

Pan LQ, 2002, CHINESE J ELECTRON, V11, P469

[5]

Wang JY, 2002, BIOCHEMISTRY

[6]

YIN ZX, 2003, J ELECT INFORM, V15

[7] DNA computation model to solve 0-1 programming problem [J].

Zhang, FY ;

Yin, ZX ;

Liu, B ;

Xu, J .

BIOSYSTEMS, 2004, 74 (1-3) :9-14

[8]

Zhao FQ, 2003, ACTA CHIM SINICA, V61, P22

← 1 →