3‑Input/1-Output Logic Implementation Demonstrated by DNA Algorithmic Self-Assembly

Although structural DNA nanotechnology is a well-established field, computations performed using DNA algorithmic self-assembly is still in the primitive stages in terms of its adaptability of rule implementation and experimental complexity. Here, we discuss the feasibility of constructing an <i>M</i>-input/<i>N</i>-output logic gate implemented into simple DNA building blocks. To date, no experimental demonstrations have been reported with <i>M</i> > 2 owing to the difficulty of tile design. To overcome this problem, we introduce a special tile referred to as an operator. We design appropriate binding domains in DNA tiles, and we demonstrate the growth of DNA algorithmic lattices generated by eight different rules from among 256 rules in a 3-input/1-output logic. The DNA lattices show simple, linelike, random, and mixed patterns, which we analyze to obtain errors and sorting factors. The errors vary from 0.8% to 12.8% depending upon the pattern complexity, and sorting factors obtained from the experiment are in good agreement with simulation results within a range of 1–18%