DNA Switching Circuits Based on Binary Tree

Abstract

Switching circuits provide an interesting strategy for modularization construction of digital computing. Multi-step reactions on DNA origami template are essentially the same as switching circuits. Herein, DNA switch circuits(DSCs) based on binary tree is used to solve arbitrary digital computing. The establishment and implementation of DSCs is completed on DNA origami template. The nodes in the binary tree are mapped to hairpins on DNA origami template and the switches are mapped to the hairpins which is abundant in the solution. DSCs operate on the basis of a hybridization chain reaction on DNA origami substrates. The results are read using bulk fluorescence spectroscopic methods. Compared with multi input logic “AND” gate, the number of DNA strands (anchored hairpins and fuels) required by DSCs is reduced more than 33.33% and 66.67%, respectively. The DSCs are used to construct the full-subtractor and prime number discriminator, which indicates this strategy can construct arbitrary digital circuits.

Keywords

• Switching circuit
• DNA origami
• full-subtractor
• prime number discriminator