会议专题

A DNA ALGORITHM FOR SOLVING 0-1 PROGRAMMING

In this paper, DNA probes tagged with fluorescent label and a surface-based DNA algorithm are proposed to solve the 0-1 programming problem which inequalities coefficients expand to arbitrary integers. The algorithm works in O(m) steps for 0-1 programming problem with m constraint inequalities.

DNA computation model surface model 0-1 programming problem Bioinformatics

PING GUO LI-LI LIU

School of Computer Science, Chongqing University, 400044, Chongqing, China

国际会议

2008 International Conference on Machine Learning and Cybernetics(2008机器学习与控制论国际会议)

昆明

英文

1059-1063

2008-07-12(万方平台首次上网日期,不代表论文的发表时间)