Branching in Biological Models of Computation Bethany Andres-Beck

In this paper, we will look at DNA computing, in particular at different ways that branching can be done in the sticker model (Roweis et. al. 1996) and the solutions to the NP complete problems. We will refer to control structures that are used in programming languages, looping and “if else ” statements, as branching. There are five sections to this paper. The first section will describe the process of DNA transcription then suggest a way that branching can be implemented into this process through the use of an OR gate. The section will continue to discuss the pros and cons of this idea. The second section will look at a series of approaches to DNA computing and how branching is implemented or could be implemented in them. The third section will briefly review state automata then go on to explaining a recent success in DNA computing ─ “The smart drug ” experiment, its conclusions and implications for branching in DNA computing. It will look at a possible combination of the “smart ” drug and the sticker models. In conclusion, pluses along with the minuses o