Molecular circuits for associative learning in single-celled organisms

НазваниеMolecular circuits for associative learning in single-celled organisms
Размер46.2 Kb.
Molecular circuits for associative learning in single-celled organisms

Chrisantha T. Fernando1,5, Anthony M.L. Liekens2, Lewis Bingle1, Christian Beck4, Thorsten Lenser4, Dov Stekel1, Jon Rowe3

1 Systems Biology Centre, University of Birmingham, Birmingham, B15 2TT, UK

2TU/e Techniche Universiteit Eindhoven, the Netherlands

3 School of Computer Science, University of Birmingham, Birmingham, B15 2TT, UK

4 Bio Systems Analysis Group, Friedrich Schiller University Jena, Germany

5MRC National Institute for Medical Research, Mill Hill, London, London NW7 1AA, UK

Supplementary Material

1. Protein-Protein Interactions and Modifications to Hebbian Learning

Figure S1. Additional synthetic components improve the robustness of the Hebbian learning circuits. See text.

As described in Fritz et al (2007), protein-protein interactions can be designed to modify synthetic gene circuits. Hebbian learning is known to be inherently unstable, and various techniques are known in neuroscience to deal with runaway positive feedback. In the main paper we have used simple transcription factor decay to prevent runaway positive feedback. However, figure S1 shows a range of optional extras for a synthetic Hebbian circuit. (A) Autocatalytic p and wj transcription factors may permit the maintenance of memory over more generations. The gating of this positive auto-regulation by a growth-phase dependent sigma factor ensures that weights and outputs do not increase during stationary phase. (B) Subtractive and (C) multiplicative normalization of weights8 can be implemented by heterodimer (p + uj) and homodimer (p + p) mediated proteolysis of the transcription factor wj. The later allows competition for limited ‘weight resources’. (C) The BCM rule (Dayan & Abbott, 2001) can be implemented by using an extra molecule m to represent the sliding average of p or uj, which then combines with uj ­and p to degrade weights.

1.1 Pre-synaptic rule (not shown in Figure S1)


can be implemented simply by adding a constant decay to the weight equal to ­, that is zeroth order w.r.t. weight. This can be done if uj is a saturated enzyme that degrades w at a constant rate, or if u linearly activates an enzyme that does this job. It should be noted that the pre-synaptic rule is unstable. For then weights grow without bound, whereas for weights decay to zero. The post-synaptic rule is a minor modification, with decay of weights in proportion to rather than .

1.2. Saturating weight dependence rule (Figure S1B).


works by reducing the increase in weights as weights go to wmax, and actually decreasing weights if the weight goes above wmax. Here the w­ij transcription factor is destroyed at rate in the first order. This can be implemented if a heterodimer acts to degrade w­ij directly.

1.3. Oja’s rule (Figure S1C)


has a very similar form, except that here the homodimer v2 is responsible for the first order decay of wij. See that S3 differs from S2 in that the decay is transmitted to all weights via v even if that particular weight did not cause the production of v, thus implementing competition

1.4. Weight consolidation rule (not shown in figure S1)


( and ) can be implemented by introducing a autocatalytic promotor for w­ij with Hill-coefficient for wij binding of n = 2. The strength of the autocatalytic promotor of w­ij is equal to . At the same time there must be decay of wij at a first order constant rate and a decay of w­ij at a third order rate ! This is a complex process to implement, but it is conceivable that such processes could evolve if selection existed for consolidation of transcription factor cytoplasmic memory.

1.5. BCM rule (Figure S1D)

The rule is described by:


is a zero crossing function with positive slope for example vi(vi- ). is a short-term average of output activity and is given for example by


Let us first implement the sliding threshold 10.1. This is simply a TF that is activated by the output ­and decays at constant rate nv. The production of wij is at rate vi2uj and wij decays at rate vuj. Here, three species must come together to destroy wij, v, , and u­j. This rate must be 0th order, i.e. independent of the concentration of wij. can be implemented as another molecule m (Figure S1D), that is activated by v with Hill Coefficient = 2, and decays at 1st order with the same time constant as its production.

2. Evolution of Circuits In Silico

For the In silico optimization we expanded the SBMLevolver of Thorsten Lenser, which implements a new 2-layer evolutionary algorithm. The model in the main paper is a subsequent version optimized by hand, but based on the evolved parameters below. The upper level evolves the structure of the network using genetic programming while the lower level uses a evolution strategy to optimize only the parameter of the network. For the upper level we had a (10+10)-elitism strategy over 500 generations, that means in each generation we selected, based on the fitness rank, the 10 best individuals as parents for the next generation and created 10 new offspring. As we have used the network in figure S3 as the starting network and don’t want to mutate this, the offspring are just a copy of the parents. In the lower level we had a (2+2)-elitism strategy over 10 generations.

After all we received a network with the output you can see in figure 4 in the original paper.

The values of the signals - remember they are repressor - is 200 if they are inactive and 105 if they are active.

For the parameter of the network remember the equations:



















Table S1. The parameter of the evolved network. The concentrations at the beginning are 3.942(w1), 0.021 (w2) and 0.0002 (p)

To find this learning network we had to define a new fitness function. To make the explanation of the function easier we have to make a definition. We split one experiment into 9 sections:

Activation of signals



At the beginning, no signals.



First activation of signal 1 (U1).



Back to no activation



First activation of signal 2 (U2).



Again no activation



The pairing in the test case, so both signals are active (U1+U2). In the control case only signal 2 is active once more, no pairing



Memorise phase, no signals active



Test phase, signal 2 active for the last time



At the end, no signals


So we define as the value of protein O at the last timestep in section j in the test case, analogous as value of O in section j in the control case.

Then our fitness function looks like this:

As the SBMLevolver tries to find the smallest fitness possible, it will reduce all added parts and terms over the slash and increase the values under the slash. The first 4 punishments have no influence in the learning of the network, they should lead to a reasonable network only. So we used the following:

  1. If one term in the main function goes to a negative number set this term to 0 and add 1000

  2. Add a punishment of 1000 if W1 or W2 still growing in section 9. If so, it will never reach to state of the beginning again.

  3. Add the differences of the concentrations of P, W1 and W2 between the first and the last timestep in section 1. This leads to a steady state at the beginning.

  4. Add 1000 if any of the concentrations goes over the maximal concentration which is 200 in our case (the concentration of the signals if not active).

We also added two punishments, which have a influence in the learning of the fitness:

  1. Add 900 if (gain after learning is much smaller than with signal 1) and

  2. add 1000 if learning in the test case is not more than a twice of learning in the control case.

This helps the evolutionary algorithm to move in the space, but will have no influence in the final result, because the premises will not be true.

The cconst in the main function is for regulation of the strength of the fraction. The higher c the weightier is the main function in relation to the punishments. In our case we used also 100000 for cconst.

3. Evolution of circuits in vivo.

Figure S2 shows a proposed outline protocol for evolution of Hebbian learning circuits in vivo­. There are two phases of testing, the control and the test phase. In the control phase we do not pair the two stimuli and require no learning. In the test phase we pair two stimuli and require the learning of the association. A facs machine is used to select for no GFP expression, and high GFP expression respectively. Simulated evolution in silico was used to design an effective fitness function.

Figure S2. The overall protocol for artificial selection of plasmid gene circuits is shown. After circuits have been cloned in E. coli we will undertake high throughput selection using a classical conditioning task, to evolve bacterial colonies capable of robust conditioning. A FACS machine will be used to undertake selection using a 2-phase fitness function.

4. Simple model of MAPK implementation

The reactions describing the MAPK circuit are shown below:

with the corresponding differential equations:


Figure S3. U1Copy and U2Copy represent input chemicals. Initially W11 starts at 0.1, and V11 starts at 0. So that U1 initially activates the output, by U2 does not. After pairing of U1 and U2, output P11 is produced just with U2 input alone. This was not the case before pairing.

A classical conditioning experiment is shown in figure S3.

The CelleratorTM file (Bruce Shapiro) for Mathematica is available on on-line, and was used to simulate this system. These equations represent mass action kinetics, although more complex models are possible. The basic organization of Hebbian learning can be appreciated. There are two positive feedback loops, coupled by a common output signal. Both output and input must be present for weight increase. Weights and outputs are both double phosphorylated protein kinases. The single phosphorylated and unphosphorylated forms are intermediates in the circuit, without any enzymatic activity of their own. The system implements weight decay because w11 and v11 is dephosphorylated slowly back to w01 and v01­ respectively.

5. References

Dayan P, Abbott LF (2001) Theoretical Neuroscience: Computational and Mathematical Modeling of Neural Systems. (The MIT Press)


Molecular circuits for associative learning in single-celled organisms iconThe transformation of Molecular Biology on contact with higher organisms, 1960-1980: from a molecular description to a molecular explanation

Molecular circuits for associative learning in single-celled organisms iconS3 Students will investigate the habitats of different organisms and the dependence of organisms on their habitat

Molecular circuits for associative learning in single-celled organisms iconOf op amp ic-741,IC555,IC565,IC566,IC1496-functioning,parameters and specifications. Op amp applications-adder,subtractor,comparator circuits. Integrater,differentiator circuits

Molecular circuits for associative learning in single-celled organisms iconDepartments of Molecular and Human Genetics, Biochemistry, and Molecular Virology and Microbiology, Baylor College of Medicine, Room S809A, Mail Stop 225, 1

Molecular circuits for associative learning in single-celled organisms iconAssociative and Spatial Relationships in Thesaurus-based Retrieval

Molecular circuits for associative learning in single-celled organisms iconElectronic Devices & Circuits

Molecular circuits for associative learning in single-celled organisms iconDesign of powerful learning environments to promote intentional learning: multiple perspectives

Molecular circuits for associative learning in single-celled organisms iconGeneralized Pursuit Learning Schemes : New Families of Continuous and Discretized Learning Automata1

Molecular circuits for associative learning in single-celled organisms iconHandbook for Learning-centred Evaluation of Computer-facilitated Learning Projects in Higher Education

Molecular circuits for associative learning in single-celled organisms iconPart A: How your learning affects your teaching What do you understand about your own approach(es) to learning

Разместите кнопку на своём сайте:

База данных защищена авторским правом © 2014
обратиться к администрации
Главная страница