# Molecular Logic Computation with Debugging Method

Authors: Xiangrong Liu; Juan Suo; Juan Liu; Yan Gao; Xiangxiang Zeng
Journal: Journal of Nanomaterials
 (2015)

---

## Abstract

Seesaw gate concept, which is based on a reversible DNA strand branch process, has been found to have the potential to be used in the construction of various computing devices. In this study, we consider constructing full adder and serial binary adder, using the new concept of seesaw gate. Our simulation of the full adder preformed properly as designed; however unexpected exception is noted in the simulation of the serial binary adder. To identify and address the exception, we propose a new method for debugging the molecular circuit. The main idea for this method is to add fan-outs to monitor the circuit in a reverse stepwise manner. These fan-outs are fluorescent signals that can obtain the real-time concentration of the target molecule. By analyzing the monitoring result, the exception can be identified and located. In this paper, examples of XOR and serial binary adder circuits are described to prove the practicability and validity of the molecular circuit debugging method.


---

## Body

## 1. Introduction

In recent years, the gap between the finite capability of silicon and the infinite demand of consumers has widened gradually. This condition has given rise to molecular computing as an alternative approach to silicon-based computing. Molecular computing is aimed at building computational devices using various kinds of molecules, including organic molecules, proteins, nucleic acids, enzymes, and even supramolecular hydrogels [1–5]. Various computing devices have been constructed with biological molecules [6–12]. Given its parallel and microscopic nature, DNA has great data storage capacity and flexible design. It thus shows great potential as a material for large-scale information processing.Several computing devices, such as logic gates, circuits, and tiny circuit boards, have been developed based on DNA molecules. In 2004, Stojanovic and Stefanovic proposed a series of molecular logic gate circuits based on nucleic acid catalysts [13]. In 2006, Seelig et al. reported the design and experimental implementation of DNA-based digital logic circuits using single-stranded nucleic acids [4]. In 2013, Zhang et al. established AND and OR gates based on DNA self-assembly and strand branch migration methods [12]. In 2014, a microfluidic half adder chip is achieved by controlling the annealing and denaturation of double-stranded DNA [14].With complex and uncertain parameters (e.g., concentration and temperature) to balance, molecular circuits always function abnormally, just not as we expected. In 2009, Qian and Winfree proposed a simple DNA gate motif, a seesaw gate, that used a reversible strand displacement reaction based on the toehold exchange principle [15]. Zou et al. proposed a dynamic selection strategy which can be DNA coding [16]. Unlike circuits with other techniques that can only involve at most tens of gates, the seesaw catalytic gate architecture appeared suitable for practical synthesis of large-scale circuits involving possibly thousands of gates. Furthermore, it was argued that synthesis and preparation of circuit components can be parallel and scalable. To illustrate the potential of this approach, some logic circuits even a four-bit square-root circuit that comprised 130 DNA strands were shown in [15, 17], which all enabled fast and reliable function.In this study, we aim to employ seesaw gates to construct an important computational component, adder. As we know, adders are the basic components of silicon-based computers and an indispensable component of all computer systems. Based on the seesaw gate concept proposed by Qian et al., we construct full adder and serial binary adder. As indicated by the term seesaw, the computing process is not static but a complex process of dynamic interaction, which can lead to a cyclic response based on DNA strand migration. With the recycling mechanism, the electrical adder can be transformed into some cyclic chemical reactions that can ensure a beneficial cycle in a long time. To test and verify the function of the molecular adder models, some simulations based on kinetic equations are performed. The simulation results show that the full adder yields expected results. However, the same is not achieved in the simulation of the serial binary adder, in which unexpected exception occurs. To identify and address this exception, we propose a method for debugging the molecular circuit by adding fluorescent signals to monitor the target molecule. As the fluorescent signals can detect the location of the exception, the abnormal circuit can be corrected using the error message.The remainder of this paper is arranged as follows: the next section introduces the concept of seesaw gate; Section3 describes the design and the simulation of full and serial binary adders based on seesaw gates; Section 4 proposes a debugging method for molecular circuits, and examples of XOR and serial binary adders are described to prove the practicability and validity of the debugging method; and conclusions and some open problems for future work are presented in Section 5.


## 2. Simple DNA Gate Motif, Seesaw Gate

In this section, we introduce a simple DNA gate motif, “seesaw” gate, which is an enzyme-free DNA machinery mainly based on DNA strand migration [17, 18]. The entire reaction is a cyclic response, which means the reaction can work permanently in a self-motivated and self-directed way in a given condition. Typically, a threshold must be exceeded before catalysis occurs. When connected into circuits involving many interacting catalytic gates, complex circuit behavior can be obtained.The reaction mechanism is a simplified version of the entropy-driven catalytic gate introduced in [15, 19]. The fundamental operation is toehold exchange, which is a toehold-mediated strand displacement reaction that results in a free right-side signal strand replacing a bound left-side signal strand. Figure 1 shows a simple DNA gate motif, seesaw gate. In the top left corner, it is abstract diagram for a seesaw gate and a reporter. Numbers ahead of or at the top of nodes indicate identities of nodes (or interfaces to those nodes in a network) and numbers within the nodes or on the wires indicate relative concentration of different initial DNA species. Each species plays a specific role (e.g., input is a single molecular; gate:output is a compound molecular) and has a unique name that is useful while translating the reactions into some equivalent kinetic equations (e.g., w
2,5 and G
5
:
5,6). The other part is about basic reaction mechanisms involved in a seesaw network, which consists of three parts: thresholding, seesawing, and reporting. First the threshold gate absorbs the input strand. When the threshold is exceeded, the input strand begins to displace the output strand from the gate:output complex. An analogous process then allows the fuel strand to similarly displace the input strand from the new gate:input complex, completing a catalytic cycle that has the net effect of exchanging one left-side signal strand in solution (the fuel) for another left-side signal strand (the output). Finally, the output production can be acquired through the concentration of the reporter molecular. In principle, enough output can be obtained in a given condition with enough fuel and gate:output complex.Figure 1
A simple DNA gate motif of seesaw gate.The chemical reactions described in Figure1 can be equivalently translated into some kinetic equations. The main equations are shown below from (1) to (3). In these equations, w
2,5 and others indicate reacting molecular species, k
s indicates the slow strand displacement rate of seesawing and reporting reactions, and k
f indicates the fast strand displacement rate of thresholding reactions. Other side-reactions are ignored, which are also discussed in detail in [17].Seesawing reactions:(1)
w
2,5
+
G
5
:
5,6
⟺
k
s
k
s
G
2
:
5,5
+
w
5,6
,
w
2,5
+
G
5
:
5,7
⟺
k
s
k
s
G
2
:
5,5
+
w
5,7
.Thresholding reactions:(2)
w
2,5
+
T
h
2,5
:
5
→
k
f
w
a
s
t
e
.Reporting reactions:(3)
w
5,6
+
R
e
p
6
→
k
s
F
l
o
u
r
6
.These chemical reactions modelling the toehold exchange steps and threshold absorption steps can be written uniformly. For alli
,
j
,
k
∈
{
1,2
,
…
,
N
}, where the variables refer to the molecular species, (4)
w
j
i
+
g
i
:
i
k
⟺
k
0
k
0
g
j
i
:
i
+
w
i
k
,
w
i
j
+
t
h
i
j
:
j
→
k
1
w
a
s
t
e
←
k
1
t
h
i
:
i
j
+
w
i
j
.Using standard mass action chemical kinetics, it gives rise to a system of ordinary differential equations (ODEs) for the dynamics. In the following,w
i
j and similar terms refer to the concentration of the respective species, rather than to the species themselves:(5)
d
w
i
j
d
t
=
k
0
∑
n
=
1
N
w
n
i
·
g
i
:
i
j
+
w
j
n
·
g
i
j
:
j
m
m
m
m
m
m
∑
n
=
1
N
-
w
i
j
·
g
n
i
:
i
-
w
i
j
·
g
j
:
j
n
,
d
g
i
:
i
j
d
t
=
k
0
∑
n
=
1
N
w
i
j
·
g
n
i
:
i
-
w
n
i
·
g
i
:
i
j
,
d
g
i
j
:
j
d
t
=
k
0
∑
n
=
1
N
w
i
j
·
g
j
:
j
n
-
w
j
n
·
g
i
j
:
j
,
d
t
h
i
:
i
j
d
t
=
-
k
1
·
w
i
j
·
t
h
i
:
i
j
,
d
t
h
i
j
:
j
d
t
=
-
k
1
·
w
i
j
·
t
h
i
j
:
j
.These dynamics have conserved quantities for each gate nodei and for each signal wire i
j: (6)
∑
n
=
1
N
g
n
i
:
i
+
g
i
:
i
n
≡
c
i
,
g
i
:
i
j
-
t
h
i
:
i
j
+
w
i
j
+
g
i
j
:
j
-
t
h
i
j
:
j
≡
c
i
j
,
d
c
i
d
t
=
d
c
i
j
d
t
=
0
.With these dynamic equations above, simulations have been performed masterly by Mathematic in a PC platform (Windows OS, I3 processor, 2 G RAM).


## 3. Molecular Adders Based on the Concept of Seesaw Gate

In electronics, an adder is a digital circuit that performs addition of numbers. In many computers and other types of processors, adders are used not only in arithmetic logic units, but also in other parts of the processor, where they are used to calculate addresses, table indices, and similar operations. In this section, we propose full adder and serial binary adder, with the concept described above, which is based on toehold-mediated DNA strand displacement.


### 3.1. Molecular Full Adder

A full adder adds binary numbers and accounts for values carried in and out. A single-bit full adder adds three single-bit numbers, often written asA, B, and C
0; A and B are the operands, and C
0 is a bit carried in from the next less significant stage. The full adder is usually a component in a cascade of adders which add 8-, 16-, and 32-bit binary numbers, and so on. The circuit produces a two-bit output, namely, output carry and sum, which are typically represented by the signals C
1 and S. The logic expression of the full adder is shown below:(7)
S
=
A
⨁
B
⨁
C
0
,
C
1
=
A
·
B
+
C
0
·
A
⨁
B
.Add a file containing a digital circuit netlist, which can translate into an equivalent dual-rail circuit, in which each input is replaced by a pair of inputs, representing logic ON and OFF separately. The equivalent seesaw circuit of the full adder is shown in Figure2, in which numbers ahead of or at the top of nodes indicate identities of nodes (or interfaces to those nodes in a network) and numbers within the nodes or on the wires indicate relative concentration of different initial DNA species. The seesaw circuit consists of 38 seesaw gates, any one of which is equivalent to the seesaw gate described in Figure 1. For example, the top left gate (gate:output G
5
:
5,16,30) is a general seesaw gate, whose input is w
4,5, threshold is T
h
4,5
:
5, outputs are w
5,16 and w
5,30, and fuel is w
5
,
f. The seesaw reactions of gate 5 (namely, G
5
:
5,16,30) are described after Figure 2.Figure 2
The seesaw circuit of the full adder.Seesawing reactions of gate 5:(8)
w
4,5
+
G
5
:
5,16,30
⟺
k
s
k
s
G
4
:
5,5
+
w
5,16
+
w
5,30
,
w
4,5
+
G
5
:
5
,
f
⟺
k
s
k
s
G
4
:
5,5
+
w
5
,
f
.Thresholding reactions of gate 5:(9)
w
4,5
+
T
h
4,5
:
5
→
k
f
w
a
s
t
e
.All of the other 37 gates are just like gate 5, are general seesaw gates, and can be similarly translated into corresponding seesaw reactions. Introduced in Section2, all these seesaw reactions can be translated into equivalent dynamic equations, which can be simulated by mathematic in a PC platform.Simulations are performed with the reference concentration1
x
=
30
n
M. The simulation result is shown in Figure 3, the horizontal axis represents the reaction time (from 0 h to 10 h), and the vertical axis represents the relative output concentration (from 0x to 10x). Moreover, the red curve describes the slope of the sum (S
=
0) over time, the green curve describes the slope of the sum (S
=
1) over time, the blue curve describes the slope of carry-over (C
=
0) over time, and the yellow curve describes the slope of carry-over (C
=
1) over time. When the reaction is almost completed, only one of the red and green curves (similarly blue and yellow) must stay at the high concentration (≥0.8x), and the other must stay at the low concentration (≤0.2x). This guarantees that only one result of S
=
1 and S
=
0 (similarly C
=
1 and C
=
0) can stay true, which is also reasonable in the real world. Any other condition is regarded as an exception. Finally, the high concentration curves represent the final true result. For example, if input signals A, B, and C
0 all stay OFF (i.e., between 0x and 0.1x), as shown in Figure 3(a), the final high concentration curves are S
=
0 and C
1
=
0, which is the true result, which means that the computing result is (s
u
m
=
0, c
a
r
r
y
=
0). The whole value table of full adder is shown in Table 1. It can be found that all the conditions go cohere with the theoretical value.Table 1
The value table of the half adder seesaw circuit.
Inputs
S = 0
S = 1
C
1 = 0
C
1 = 1
Computing results
(A = OFF, B = OFF, C
0 = OFF)
1
0
0
1
S = 0, C
1 = 1
(A = OFF, B = OFF, C
0 = ON)
0
1
1
0
S = 1, C
1 = 0
(A = OFF, B = ON, C
0 = OFF)
0
1
1
0
S = 1, C
1 = 0
(A = OFF, B = ON, C
0 = ON)
1
0
0
1
S = 0, C
1 = 1
(A = ON, B = OFF, C
0 = OFF)
0
1
1
0
S = 1, C
1 = 0
(A = ON, B = OFF, C
0 = ON)
1
0
0
1
S = 0, C
1 = 1
(A = ON, B = ON, C
0 = OFF)
1
0
0
1
S = 0, C
1 = 1
(A = ON, B = ON, C
0 = ON)
0
1
0
1
S = 1, C
1 = 1Figure 3
The simulation result of the full adder.
(a)
Input 000
(b)
Input 001
(c)
Input 010
(d)
Input 011
(e)
Input 100
(f)
Input 101
(g)
Input 110
(h)
Input 111


### 3.2. Molecular Serial Binary Adder

The serial binary adder is a digital circuit that performs binary addition bit by bit. It has two two-bit inputs for the numbers to be added (A
2
A
1, B
2
B
1) and a single-bit input for the carry-in (C
0). The outputs are a two-bit output for the sum (S
2
S
1) and single-bit output for carry-out (C
2). First A
1, B
1, and C
0 are added together to produce the low-bit sum (S
1) and low-bit carry-out (C
1). The high-bit carry-in signal is the previously calculated low-bit carry-out signal, so A
2, B
2, and C
1 are added together to produce the high-bit sum (S
2) and high-bit carry-out (C
2). Addition is performed by adding each bit from lowest to highest, one per clock cycle. The logic expression of the serial binary adder is shown below:(10)
S
1
=
A
1
⨁
B
1
⨁
C
0
,
C
1
=
A
1
∗
B
1
+
A
1
+
B
1
∗
C
0
,
S
2
=
A
2
⨁
B
2
⨁
C
1
,
C
2
=
A
2
∗
B
2
+
A
2
+
B
2
∗
C
1
.In this paper, we use two full adders to achieve the serial binary adder, in which the carry-over of the first full adder is regarded as the input of the second full adder. Unfortunately, an exception occurs unexpectedly during simulation. As shown in Figure4, when the input is (0, 0, 0, 0, 0), the concentrations of S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are both over 0.5, indicating that both S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are true results, which are contrary to the reality. However, at this point, the final values of S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) still can be distinguished, which have not been the worst offenders. However, when the input is (1, 1, 1, 1, 1), the concentrations of S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) ascend nearly at the same height (which are both over 0.9), such that we are unable to distinguish the “low concentration” and “high concentration,” which is a very serious exception. In the next part, we will analyze the reason for this situation and propose a method to solve it.Figure 4
The simulation result of the serial binary adder.
(a)
Input 00000
(b)
Input 11111


## 3.1. Molecular Full Adder

A full adder adds binary numbers and accounts for values carried in and out. A single-bit full adder adds three single-bit numbers, often written asA, B, and C
0; A and B are the operands, and C
0 is a bit carried in from the next less significant stage. The full adder is usually a component in a cascade of adders which add 8-, 16-, and 32-bit binary numbers, and so on. The circuit produces a two-bit output, namely, output carry and sum, which are typically represented by the signals C
1 and S. The logic expression of the full adder is shown below:(7)
S
=
A
⨁
B
⨁
C
0
,
C
1
=
A
·
B
+
C
0
·
A
⨁
B
.Add a file containing a digital circuit netlist, which can translate into an equivalent dual-rail circuit, in which each input is replaced by a pair of inputs, representing logic ON and OFF separately. The equivalent seesaw circuit of the full adder is shown in Figure2, in which numbers ahead of or at the top of nodes indicate identities of nodes (or interfaces to those nodes in a network) and numbers within the nodes or on the wires indicate relative concentration of different initial DNA species. The seesaw circuit consists of 38 seesaw gates, any one of which is equivalent to the seesaw gate described in Figure 1. For example, the top left gate (gate:output G
5
:
5,16,30) is a general seesaw gate, whose input is w
4,5, threshold is T
h
4,5
:
5, outputs are w
5,16 and w
5,30, and fuel is w
5
,
f. The seesaw reactions of gate 5 (namely, G
5
:
5,16,30) are described after Figure 2.Figure 2
The seesaw circuit of the full adder.Seesawing reactions of gate 5:(8)
w
4,5
+
G
5
:
5,16,30
⟺
k
s
k
s
G
4
:
5,5
+
w
5,16
+
w
5,30
,
w
4,5
+
G
5
:
5
,
f
⟺
k
s
k
s
G
4
:
5,5
+
w
5
,
f
.Thresholding reactions of gate 5:(9)
w
4,5
+
T
h
4,5
:
5
→
k
f
w
a
s
t
e
.All of the other 37 gates are just like gate 5, are general seesaw gates, and can be similarly translated into corresponding seesaw reactions. Introduced in Section2, all these seesaw reactions can be translated into equivalent dynamic equations, which can be simulated by mathematic in a PC platform.Simulations are performed with the reference concentration1
x
=
30
n
M. The simulation result is shown in Figure 3, the horizontal axis represents the reaction time (from 0 h to 10 h), and the vertical axis represents the relative output concentration (from 0x to 10x). Moreover, the red curve describes the slope of the sum (S
=
0) over time, the green curve describes the slope of the sum (S
=
1) over time, the blue curve describes the slope of carry-over (C
=
0) over time, and the yellow curve describes the slope of carry-over (C
=
1) over time. When the reaction is almost completed, only one of the red and green curves (similarly blue and yellow) must stay at the high concentration (≥0.8x), and the other must stay at the low concentration (≤0.2x). This guarantees that only one result of S
=
1 and S
=
0 (similarly C
=
1 and C
=
0) can stay true, which is also reasonable in the real world. Any other condition is regarded as an exception. Finally, the high concentration curves represent the final true result. For example, if input signals A, B, and C
0 all stay OFF (i.e., between 0x and 0.1x), as shown in Figure 3(a), the final high concentration curves are S
=
0 and C
1
=
0, which is the true result, which means that the computing result is (s
u
m
=
0, c
a
r
r
y
=
0). The whole value table of full adder is shown in Table 1. It can be found that all the conditions go cohere with the theoretical value.Table 1
The value table of the half adder seesaw circuit.
Inputs
S = 0
S = 1
C
1 = 0
C
1 = 1
Computing results
(A = OFF, B = OFF, C
0 = OFF)
1
0
0
1
S = 0, C
1 = 1
(A = OFF, B = OFF, C
0 = ON)
0
1
1
0
S = 1, C
1 = 0
(A = OFF, B = ON, C
0 = OFF)
0
1
1
0
S = 1, C
1 = 0
(A = OFF, B = ON, C
0 = ON)
1
0
0
1
S = 0, C
1 = 1
(A = ON, B = OFF, C
0 = OFF)
0
1
1
0
S = 1, C
1 = 0
(A = ON, B = OFF, C
0 = ON)
1
0
0
1
S = 0, C
1 = 1
(A = ON, B = ON, C
0 = OFF)
1
0
0
1
S = 0, C
1 = 1
(A = ON, B = ON, C
0 = ON)
0
1
0
1
S = 1, C
1 = 1Figure 3
The simulation result of the full adder.
(a)
Input 000
(b)
Input 001
(c)
Input 010
(d)
Input 011
(e)
Input 100
(f)
Input 101
(g)
Input 110
(h)
Input 111


## 3.2. Molecular Serial Binary Adder

The serial binary adder is a digital circuit that performs binary addition bit by bit. It has two two-bit inputs for the numbers to be added (A
2
A
1, B
2
B
1) and a single-bit input for the carry-in (C
0). The outputs are a two-bit output for the sum (S
2
S
1) and single-bit output for carry-out (C
2). First A
1, B
1, and C
0 are added together to produce the low-bit sum (S
1) and low-bit carry-out (C
1). The high-bit carry-in signal is the previously calculated low-bit carry-out signal, so A
2, B
2, and C
1 are added together to produce the high-bit sum (S
2) and high-bit carry-out (C
2). Addition is performed by adding each bit from lowest to highest, one per clock cycle. The logic expression of the serial binary adder is shown below:(10)
S
1
=
A
1
⨁
B
1
⨁
C
0
,
C
1
=
A
1
∗
B
1
+
A
1
+
B
1
∗
C
0
,
S
2
=
A
2
⨁
B
2
⨁
C
1
,
C
2
=
A
2
∗
B
2
+
A
2
+
B
2
∗
C
1
.In this paper, we use two full adders to achieve the serial binary adder, in which the carry-over of the first full adder is regarded as the input of the second full adder. Unfortunately, an exception occurs unexpectedly during simulation. As shown in Figure4, when the input is (0, 0, 0, 0, 0), the concentrations of S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are both over 0.5, indicating that both S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are true results, which are contrary to the reality. However, at this point, the final values of S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) still can be distinguished, which have not been the worst offenders. However, when the input is (1, 1, 1, 1, 1), the concentrations of S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) ascend nearly at the same height (which are both over 0.9), such that we are unable to distinguish the “low concentration” and “high concentration,” which is a very serious exception. In the next part, we will analyze the reason for this situation and propose a method to solve it.Figure 4
The simulation result of the serial binary adder.
(a)
Input 00000
(b)
Input 11111


## 4. A Debugging Method for Molecular Circuit

As of this writing, many well-worked molecular computing devices, including logic gates, circuits, and tiny circuit boards, exist. However, an effective debugging method for molecular circuit is still needed. In the molecular circuit, exceptions always occur unexpectedly because of the tiny differences in temperature, concentration, reaction duration, and other factors. Thus, proposing a method to debug the molecular circuits is of great importance to the development of molecular computing. In this paper, we propose a method to address this issue.The main idea is to add fan-outs to the seesaw circuit. Fan-outs are molecular fluorescent signals that can monitor the target molecule (any possible abnormal molecule). The real-time concentration of the target molecule can be obtained, which can help us analyze the circuit exception. If the site of the exception is unknown, debugging can be implemented from the output end step by step, until the exception molecular is discovered. The results in Figure6 indicate that the new fluorescent signal nearly does not influence the initial molecular circuit, which means that our debugging does not change the original circuit. In the following section, some examples are shown to explain the process and manipulation of this method, as well as to prove the practicability and validity of the method.


### 4.1. Debugging of the XOR Circuit

Exclusive or XOR is a logical operation that outputs truly whenever both inputs differ (one is true, and the other is false). The opposite of XOR is logical biconditional, which outputs truly whenever both inputs are the same. It gains the name “exclusive or” because the meaning of “or” is ambiguous when both operands are true; “exclusive or” excludes that case. XOR is sometimes thought of as one or the other but not both. The XOR circuit is a simple circuit that is used to obtain the monitoring results, so we first choose the XOR circuit for analysis. Two inputs (A and B) and an output (S) exist in the XOR circuit. The logic expression of the XOR circuit is shown below:(11)
S
=
A
⨁
B
=
A
·
B
′
+
A
′
·
B
.To debug the XOR circuit, as shown in Figure5, we add two fluorescent signals (35 and 36) for monitoring the target molecule directly before the output signal, which is the direct input of the final output, which will directly influence the final result. Four fluorescent signals exist in the circuit. The original fluorescent signals (32, 34) monitor the real output. The added fluorescent signals (35, 36) monitor the temporary output, wherein an exception may occur. Other parts of the circuit remain unchanged.Figure 5
The seesaw circuit of the XOR circuit with monitoring molecular.Figure 6
The simulation result of the XOR circuit.
(a)
With monitoring molecular (35, 36)
(b)
Without monitoring molecularThe simulation result is shown in Figure6. The changed circuit results with monitoring molecule are shown in Figure 6(a), whereas the original circuit results without monitoring molecule are shown in Figure 6(b). Table 2 shows the actual simulation results of the two cases, from which we can find the contrast between the simulation result of with monitoring molecule and without monitoring molecule and that the average of the difference between the two cases equals 0.004, which proves that the output almost remains unchanged and the debugging method does not influence the initial molecular circuit. Furthermore, the output of the monitoring molecule is consistent with the theoretical value and proves that circuit functions properly at the monitoring point.Table 2
The contrast between the simulation result of with monitoring and without monitoring.
Input
Monitor
T
=
2
T
=
4
T
=
6
T
=
8
(0, 0)
yes/no
0.033/0.029
0.046/0.041
0.055/0.050
0.064/0.059
(0, 1)
yes/no
0.106/0.102
0.497/0.506
0.825/0.833
0.943/0.947
(1, 0)
yes/no
0.033/0.029
0.046/0.041
0.055/0.050
0.064/0.059
(1, 1)
yes/no
0.112/0.107
0.525/0.534
0.853/0.853
0.952/0.956


### 4.2. Debugging of the Serial Binary Adder Circuit

In the aforementioned section, we pointed out that the serial binary adder does not function properly. An exception occurs when the input is (1, 1, 1, 1, 1) and concentrations ofS
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are both over 0.9. Thus, both S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are true results. Actually, the concentration of S
1
=
1 and S
2
=
1 should be low, with a final value that does not exceed 0.2. Therefore, an exception must occur somewhere. To determine where the exception occurs, we debug the circuit with the above method in a reverse stepwise manner.We analyze the exception ofS
1
=
1. The concentration of S
1
=
1 is obtained from fluorescent signal 130 (Figure 7), which represents the output of AND (62, 63). The direct input of AND (62, 63) is the first target molecule to monitor, which are molecules 43 and 55, so we add two fluorescent signals to monitor molecules 43 and 55. The monitoring result is shown in Figure 8(a), showing that molecule 55 functions well, but molecule 43 indicates an exception, which should be a low concentration in theory. We then monitor the direct input of molecule 43, which are molecules 7 and 35. The monitoring results are shown in Figure 8(b), in which both molecules indicate an emerging exception. Subsequently, we monitor the direct input of molecule 35, which are molecules 19 and 31, and the monitoring results are shown in Figure 8(c), which shows that molecule 19 indicates an exception. We then monitor the direct input of molecule 19, which are molecules 11 and 15. The monitoring results are shown in Figure 8(d); both molecules demonstrate an exception, which is also the point where exception occurs first. Thus, the exception point is found. The error transmission line described above is shown in Figure 7 (red line). The other error line of S
2
=
1 can be obtained in the same way, which is shown in Figure 7 (green line).Figure 7
The error line of the serial binary adder circuit.Figure 8
The simulation result of the serial binary adder circuit.
(a)
(b)
(c)
(d)


## 4.1. Debugging of the XOR Circuit

Exclusive or XOR is a logical operation that outputs truly whenever both inputs differ (one is true, and the other is false). The opposite of XOR is logical biconditional, which outputs truly whenever both inputs are the same. It gains the name “exclusive or” because the meaning of “or” is ambiguous when both operands are true; “exclusive or” excludes that case. XOR is sometimes thought of as one or the other but not both. The XOR circuit is a simple circuit that is used to obtain the monitoring results, so we first choose the XOR circuit for analysis. Two inputs (A and B) and an output (S) exist in the XOR circuit. The logic expression of the XOR circuit is shown below:(11)
S
=
A
⨁
B
=
A
·
B
′
+
A
′
·
B
.To debug the XOR circuit, as shown in Figure5, we add two fluorescent signals (35 and 36) for monitoring the target molecule directly before the output signal, which is the direct input of the final output, which will directly influence the final result. Four fluorescent signals exist in the circuit. The original fluorescent signals (32, 34) monitor the real output. The added fluorescent signals (35, 36) monitor the temporary output, wherein an exception may occur. Other parts of the circuit remain unchanged.Figure 5
The seesaw circuit of the XOR circuit with monitoring molecular.Figure 6
The simulation result of the XOR circuit.
(a)
With monitoring molecular (35, 36)
(b)
Without monitoring molecularThe simulation result is shown in Figure6. The changed circuit results with monitoring molecule are shown in Figure 6(a), whereas the original circuit results without monitoring molecule are shown in Figure 6(b). Table 2 shows the actual simulation results of the two cases, from which we can find the contrast between the simulation result of with monitoring molecule and without monitoring molecule and that the average of the difference between the two cases equals 0.004, which proves that the output almost remains unchanged and the debugging method does not influence the initial molecular circuit. Furthermore, the output of the monitoring molecule is consistent with the theoretical value and proves that circuit functions properly at the monitoring point.Table 2
The contrast between the simulation result of with monitoring and without monitoring.
Input
Monitor
T
=
2
T
=
4
T
=
6
T
=
8
(0, 0)
yes/no
0.033/0.029
0.046/0.041
0.055/0.050
0.064/0.059
(0, 1)
yes/no
0.106/0.102
0.497/0.506
0.825/0.833
0.943/0.947
(1, 0)
yes/no
0.033/0.029
0.046/0.041
0.055/0.050
0.064/0.059
(1, 1)
yes/no
0.112/0.107
0.525/0.534
0.853/0.853
0.952/0.956


## 4.2. Debugging of the Serial Binary Adder Circuit

In the aforementioned section, we pointed out that the serial binary adder does not function properly. An exception occurs when the input is (1, 1, 1, 1, 1) and concentrations ofS
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are both over 0.9. Thus, both S
1
=
1 and S
1
=
0 (similarly S
2
=
1 and S
2
=
0) are true results. Actually, the concentration of S
1
=
1 and S
2
=
1 should be low, with a final value that does not exceed 0.2. Therefore, an exception must occur somewhere. To determine where the exception occurs, we debug the circuit with the above method in a reverse stepwise manner.We analyze the exception ofS
1
=
1. The concentration of S
1
=
1 is obtained from fluorescent signal 130 (Figure 7), which represents the output of AND (62, 63). The direct input of AND (62, 63) is the first target molecule to monitor, which are molecules 43 and 55, so we add two fluorescent signals to monitor molecules 43 and 55. The monitoring result is shown in Figure 8(a), showing that molecule 55 functions well, but molecule 43 indicates an exception, which should be a low concentration in theory. We then monitor the direct input of molecule 43, which are molecules 7 and 35. The monitoring results are shown in Figure 8(b), in which both molecules indicate an emerging exception. Subsequently, we monitor the direct input of molecule 35, which are molecules 19 and 31, and the monitoring results are shown in Figure 8(c), which shows that molecule 19 indicates an exception. We then monitor the direct input of molecule 19, which are molecules 11 and 15. The monitoring results are shown in Figure 8(d); both molecules demonstrate an exception, which is also the point where exception occurs first. Thus, the exception point is found. The error transmission line described above is shown in Figure 7 (red line). The other error line of S
2
=
1 can be obtained in the same way, which is shown in Figure 7 (green line).Figure 7
The error line of the serial binary adder circuit.Figure 8
The simulation result of the serial binary adder circuit.
(a)
(b)
(c)
(d)


## 5. Conclusions and Future Work

In this paper, we construct several adders with a simple DNA gate motif, namely, the seesaw gate. The seesaw gate is a single DNA strand that can bind to signal strands via toehold domain. In the initial state, the input signals with a high concentration will react with the compound molecule in which the output signals are bound. The fundamental operation is toehold exchange, which is a toehold-mediated strand displacement reaction that results in a free right-side signal strand replacing a bound left-side signal strand. Typically, circuits with any arbitrarily complex can be contracted via cascading the simple gates. We build some adders with the above concept, including half adder, full adder, and serial binary adder. The validity and correctness of the half adder and full adder are demonstrated by simulation experiment.During the simulation of the serial binary adder, an exception occurs, which leads to the incorrectness of the output. We find that the fan-out of the seesaw gate can influence the output, which is bordered by the threshold. When the output is with high concentration, more fan-outs lead to lower concentration of the output; when the output is with low concentration, more fan-outs lead to higher concentration of the output. In the case of the serial binary adder, the fan-outs number has reached upper limit, and the output with low concentration is higher than that under normal conditions, thereby leading to the exception.To solve this problem, we propose a method to debug the molecular circuit. The main idea is to add fan-outs to the seesaw circuit, which is a molecular fluorescent signal. With the fluorescent molecule, we can obtain the output of any gate. Thus, the debugging process can be implemented in a stepwise manner, similar to the occasion of the serial binary adder circuit above.For future studies, two directions can be considered. First, we should design an adaptive debugging method, which is a self-correcting mechanism that can adjust the parameters (e.g., concentration and threshold) aimed at different circuits automatically. Second, to solve the abnormal occasion, we should study the signal reconstruction mechanism for recovery of the distorted signal, which can help deal with the output exception of the serial binary adder circuit. Moreover, with the signal reconstruction mechanism, more large-scale circuits are more likely to be implemented.



---

*Source: 120365-2015-09-02.xml*