1. DNA Computing: implementation of data flow logical operations P. Wasieqicz, A. Malinowski, R. Nowak, J.J. Mulawka, P. Borsuk, P. Weglenski, and A. Plucienniczak Future Generation Computer Systems 17 (2001) 361-378

2. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ Data flow parallel processing Data availability rather than a program counter is used to drive the execution of instructions. Instead of being stored in shared memory, data are directly hold inside instructions. Nodes labeled with particular operations calculate a result whenever the inputs are valid.

3. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ Data flow logic gates Radioactive adenine Radioactive adenine 32PdATP using the Klenow polymerase

4. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ Data flow logic gates Logic gate strands can be separated It is possible to use those gates with DNA chips

5. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ DNA-based implementation of simple logic network

6. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ NAND gate Second class restriction enzyme (FokI) Check the length

7. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ Calculating Boolean functions The construction of the graph starts with creating nodes, which are related to function arguments plus one node – root. The function’s result is TRUE when at least one leaf of the tree can be reached from the root through the successive nodes.

8. (C) 2001, SNU Biointelligence Lab, http://bi.snu.ac.kr/http://bi.snu.ac.kr/ Calculating Boolean functions