Pan Linqiang

Towards Reliable Simulation of Bounded Fan-in Boolean Circuits using Molecular Beacon

A fundamental concept in computer science is that of the universal Turing machine which is an abstract definition of a general purpose computer. It has also been shown that any computer which is able to simulate Boolean circuits of any complexity is such a general purpose computer. However, few studies have devoted to DNA computer of this kind. Molecular beacon is a hairpin-formed oligonucleotide probe, which can report the presence of target sequence in solution with higher specificity compared with linear probe. It is particularly useful when single base discrimination is desired in the process of hybridization underlying DNA computing. In this paper, molecular beacon is utilized to simulate logical AND and OR gates. Then we present simulating an instance of bounded fan-in Boolean circuit comprising of these gates in time proportional to the depth of the circuit. The purpose of this paper is to explore the possibility of reliably simulating Boolean circuits using molecular beacon

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