1 / 12

A new DNA computing model for the NAND gate based on induced hairpin formation

This paper presents a theoretical model of the NAND gate using induced hairpin formation, with only six steps needed for computation. The model allows for higher reliability and can be easily incorporated into the next generation of DNA chips for combinatorial computing networks.

isaacsj
Download Presentation

A new DNA computing model for the NAND gate based on induced hairpin formation

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A new DNA computing model for the NAND gate based on induced hairpin formation 생물정보학 협동과정 소 영 제

  2. The hairpin structure serves as a stop signal for transcription Termination of transcription The DNA template mRNA, and polymerase then go their separate ways

  3. These “self-complementary” sequences allow the formation of a HAIRPIN or STEM and LOOP Structure Hairpin Structure

  4. A Boolean circuit representing the Boolean function Boolean circuits The input and output of logical NAND gate

  5. 1 NAND : 0 Theoretical model of the NAND gate

  6. Two subsequence x1 and x2 of length l Two partially complementary sequences of length m which contain some GG mismatches as in To separate sequence to surface Chemically modified surface Encoding requirement on the NAND gate

  7. Input variable xi (i=1,2) • 1 is complementary strands • They are anneal with correspondent subsequence of the gate strands Step 1 to simulate the NAND gate base on hairpin

  8. Step 2 to simulate the NAND gate base on hairpin 0 1 1 1 • Adding naphthyridine dimer to surface • This will induce the hairpin formation for some of the gate strand Naphtyridine dimer

  9. Washing the surface with distilled water so that the naphtyridine dimer is completely removed • After this the gate strands in hairpin structure will become single stranded while the double strands remain unchanged Step 3 to simulate the NAND gate base on hairpin

  10. Adding the output strands z and the complementary strands 5’-x2-s-z-3’ to the surface • Then ligase is added to seal the nick between the the gate strand and the output strand. • Output strand z at the end of these gate strands whose output is “1”, while those whose output is “0” remain unchanged Step 4 to simulate the NAND gate base on hairpin 5’-CCAA | TTG-3’ Endonuclease Hpa

  11. After clearing, adding enzyme Hpa I to the surface -> to cut output z • Collecting these strands z • Purifying them and prepared for the input of the next gate • to get The gate’s output(SPR) Final step to simulate the NAND gate base on hairpin Construct Boolean circuit network with such kind of NAND gates. Because there are so many gates at each level, it is impractical to add their outputs one by one, for otherwise the circuit’s parallelism would be greatly reduced

  12. This paper presented a theoretical model of the NAND gate through the induced hairpin formation (only six steps needed) • The time consumption will increase linearly with the level number of network, nothing to do with the total number of logical gates • NAND gate to be reusable for repeated cycles of computation • This model may be expected to perform the computation with higher reliability as the hairpin formation has high specific hybridization ability. • This model can be easily incorporated with the next generation of DNA chip to form a combinatorial computing network Conclusion

More Related