A DNA Computer Model to Solve Integer Programming Problem

Chung-Wei Yeh, Chih‐Ping Chu, Kee-Rong Wu

Xiaoli Qiang, Bo Zeng, Zicheng Wang +1 more

Wang Lei

Zhixiang Yin

Since triple-stranded DNA can be formed readily at any location in double-standed DNA with a homologous deoxyoligonucleotide in the presence of RecA-protein,it can be explored the possibility and feasibility to compute by this unique structure.In this paper the author shows that triple-stranded DNA structure mediated by RecA protein can be used for solving 0-1 integer programming problem.It can be solved the integer programming problem and satisfiability problem by this model.It can be transformed from integer programming problem and satisfiability problem to 0-1 integer programming problem.

Lin-Bo Jiang

By using the method of 22 kinds of fluorescence labeling in experiment environment of the based-surface approach,a DNA computation based algorithm for solving the problem of special integer planning was proposed.We have introduced a method,in which the above problem transforms into a special-1,0 and 1 integer planning problem.The solution of the special integer planning problem has paved the way for the complete solution of integer planning problems.

Nancy Forbes, Richard J. Lipton