CPU for simulation, simulation of large GRNs cannot
be done without a large cluster of CPUs. We propose
an inexpensive hardware-based simulation technique
for GRNs using specialized field-programmable gate
arrays.
In (Albert and Othmer, 2003) it is shown that
by using two discrete states of gene expression and
Boolean logic for gene regulation rules it is possible
to explain the action of segment polarity genes in the
creation of segments along the anterior-posterior axis
of a Drosophila embryo. While it has been demon-
strated that Boolean logic rules are enough to describe
gene interaction, there is little understanding on how
to construct Boolean rules for a generic gene regula-
tory system. We propose that the Boolean rules used
in gene regulation belong to a special class of func-
tions called threshold functions. These functions are
a subset of Boolean functions. Using this small subset
of functions we derive regulatory relationships from
the gene interaction graph. We then demonstrate that
it is possible to model the interaction of two differ-
ent sets of genes with these rules. These genes are
responsible for the dorsal-ventral patterning and seg-
ment formation along the anterior posterior axis of the
Drosophila embryo.
A threshold element (TE) has n binary inputs, x
1
,
..., x
n
, and a single binary output, y. Its internal pa-
rameters are a threshold T and weights w
1
, ..., w
n
,
where each weight w
i
is associated with x
i
. The val-
ues of T and w
i
(i = 1, ..., n) may be any real num-
bers (Dertouzos, 1965; Winder, 1965). The input-
output relation of a TE is defined as follows:
y =
1 if
∑
n
i=0
w
i
x
i
≥ T
0 otherwise
(1)
The weighted sum in Equation (1), denotes arithmetic
summation. Example: Figure 1 shows a threshold
element that implements the Boolean function y =
a
0
(b + c). Input a, b, c are assigned the weights −2, 1
and 1 respectively and the threshold (T ) is assigned
the value of 1. It can be seen that the logic function
realized by this threshold element is y = a
0
(b + c).
Figure 1: A threshold element. Figure 2: A perceptron.
Boolean AND and OR functions are threshold (Der-
touzos, 1965). Threshold elements are also ca-
pable of implementing complex Boolean functions.
e.g: ab(c + d) + cd(a + b). However, it should be
noted that a single TE cannot represent all Boolean
functions, as not all Boolean functions are thresh-
old (Muroga, 1971; Kohavi, 1970). The TE is sim-
ilar to a single perceptron (commonly encountered
in neural network literature) with the step function as
the activating function (Russell and Norvig, 2003), as
shown in Figure 2.
Simulation on a large gene regulatory network can
be a slow, computation-intensive process, largely due
to the fact that a general purpose CPU can only per-
form so many operations at one time (DeHon, 1996).
Consider the sequence of events the CPU must per-
form to compute the next state for each gene product
in the network. The CPU must first obtain a copy of
the current state of every gene product in the simula-
tion. Next the updating rules are applied to each gene
product in the simulation sequentially, using the cur-
rent states of the gene products as inputs. Each next
state computation requires one or more instructions,
depending on the rule being applied. Each next state
that is computed must also be saved. Once all next
state computations are complete, the current states are
replaced with the next states and the process repeats.
The total time t required by the CPU for each time
step in the simulation is given in Equation (2), where
t
instruction
is the time per instruction, n
instruction
is the
average number of instructions per next state compu-
tation, and n
gene
is the number of gene products in the
simulation.
t = (t
instruction
)(n
instruction
)(n
gene
) (2)
This is a highly inefficient method of simulation.
Since the next state computation of each gene prod-
uct depends only on the current states of the other
gene products in the simulation, it should be possible,
given the proper resources, to update all gene prod-
ucts in parallel. This can be achieved using a special-
ized field-programmable gate array.
The field-programmable gate array, or FPGA, is
composed of a matrix-like arrangement of config-
urable logic blocks, or CLBs, which are joined to-
gether by interconnect resources (Brown, 1992). The
CLBs and interconnect can be programmed via on-
chip memory to realize any design that it possesses
the resources to implement. Figure 3 shows the con-
ceptual FPGA architecture.
If the number of input parameters in the next state
computation of a single gene product is reasonably
low, the next state computation for a single gene prod-
uct can be implemented and synchronized using a sin-
gle CLB. Configurable logic blocks synchronized us-
ing the same clock signal operate in parallel, thus us-
ing a specialized FPGA the next states of all gene
THRESHOLD LOGIC GENE REGULATORY MODEL - Prediction of Dorsal-ventral Patterning and Hardware-based
Simulation of Drosophila
213