Singleton {NOT} and Doubleton {YES; NOT} Gates Act as Functionally Complete Sets in DNA-Integrated Computational Circuits
Related Experiment Video
Updated: Jun 28, 2025

Plasmid-derived DNA Strand Displacement Gates for Implementing Chemical Reaction Networks
Published on: November 25, 2015
Andrea C Bardales1, Quynh Vo1, Dmitry M Kolpashchikov1,2,3
1Chemistry Department, University of Central Florida, Orlando, FL 32816, USA.
Abstract:
A functionally complete Boolean operator is sufficient for computational circuits of arbitrary complexity. We connected YES (buffer) with NOT (inverter) and two NOT four-way junction (4J) DNA gates to obtain IMPLY and NAND Boolean functions, respectively, each of which represents a functionally complete gate. The results show a technological path towards creating a DNA computational circuit of arbitrary complexity based on singleton NOT or a combination of NOT and YES gates, which is not possible in electronic computers. We, therefore, concluded that DNA-based circuits and molecular computation may offer opportunities unforeseen in electronics.
Related Concept Videos
DNA as a Genetic Template
Combinatorial Gene Control
The expression of more than 30,000 genes is controlled by approximately 2000-3000 transcription factors. This is possible because a single transcription factor can recognize more than one regulatory sequence. The specificity in gene...
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
DNA-only Transposons
The donor site from where the transposon is excised is either degraded or...
Network Function of a Circuit
Complementary DNA

