Shi Xiaolong

General DNA automaton model with r/w tape

Since Turing machine is consisted of R/W Tape head and Turing Tape, that means a DNA based Turing machine must realize the read and write processes on Turing Tape with DNA molecules, and make the head move in two directions either. Based on our previous works on DNA computing, especially on DNA automaton and the relationship between enzymes and their computation ability with DNA automaton model. We combined different enzymes together to modify the cut and recognition sites with a programmable Tape head to embody the read and write symbol procedure on Turing tape. And this article will describe how the programmable Tape head moves in two direction and read/write procedure of Turing Tape in details.

The Semi-roboticized DNA Computing Model of the 0-1 Integer Programming Problem

To general 0-1 integer programming problem, we present a semi-roboticized DNA computing model. Firstly, all potential solutions of the given 0-1 integer programming problem are generated. Secondly, we set the probes corresponding to constraint inequalities of 0-1 integer programming problem, and use these probes to design semi-roboticized apparatus for separating all potential solutions automatically. Finally, we obtain the solutions of the 0-1 integer programming problem. The most merit of the model is its automation characteristic, and the model fits to solve arbitrary 0-1 integer programming problem having arbitrary variables