A Self-Controlled and Self-Healing Model of Bacterial Cells.

A new kind of self-assembly model, morphogenetic (M) systems, assembles spatial units into larger structures through local interactions of simpler components and enables discovery of new principles for cellular membrane assembly, development, and its interface function. The model is based on interactions among three kinds of constitutive objects such as tiles and protein-like elements in discrete time and continuous 3D space. It was motivated by achieving a balance between three conflicting goals: biological, physical-chemical, and computational realism. A recent example is a unified model of morphogenesis of a single biological cell, its membrane and cytoskeleton formation, and finally, its self-reproduction. Here, a family of dynamic M systems (Mbac) is described with similar characteristics, modeling the process of bacterial cell formation and division that exhibits bacterial behaviors of living cells at the macro-level (including cell growth that is self-controlled and sensitive to the presence/absence of nutrients transported through membranes), as well as self-healing properties. Remarkably, it consists of only 20 or so developmental rules. Furthermore, since the model exhibits membrane formation and septic mitosis, it affords more rigorous definitions of concepts such as injury and self-healing that enable quantitative analyses of these kinds of properties. Mbac shows that self-assembly and interactions of living organisms with their environments and membrane interfaces are critical for self-healing, and that these properties can be defined and quantified more rigorously and precisely, despite their complexity.

Morphogenetic systems: Models and experiments.

M systems are mathematical models of morphogenesis developed to gain insights into its relations to phenomena such as self-assembly, self-controlled growth, homeostasis, self-healing and self-reproduction, in both natural and artificial systems. M systems rely on basic principles of membrane computing and self-assembly, as well as explicit emphasis on geometrical structures (location and shape) in 2D, 3D or higher dimensional Euclidean spaces. They can be used for principled studies of these phenomena, both theoretically and experimentally, at a computational level abstracted from their detailed implementation. In particular, they afford 2D and 3D models to explore biological morphogenetic processes. Theoretical studies have shown that M systems are powerful tools (e.g., computational universal, i.e. can become as complex as any computer program) and their parallelism allows for trading space for time in solving efficiently problems considered infeasible on conventional computers (NP-hard problems). In addition, they can also exhibit properties such as robustness to injuries and degrees of self-healing. This paper focuses on the experimental side of M systems. To this end, we have developed a high-level morphogenetic simulator, Cytos, to implement and visualize M systems in silico in order to verify theoretical results and facilitate research in M systems. We summarize the software package and make a brief comparison with some other simulators of membrane systems. The core of the article is a description of a range of experiments inspired by aspects of morphogenesis in both prokaryotic and eukaryotic cells. The experiments explore the regulatory role of the septum and of the cytoskeleton in cell fission, the robustness of cell models against injuries, and, finally, the impact of changing nutrient concentration on population growth.

An autonomous in vivo dual selection protocol for boolean genetic circuits.

Success in synthetic biology depends on the efficient construction of robust genetic circuitry. However, even the direct engineering of the simplest genetic elements (switches, logic gates) is a challenge and involves intense lab work. As the complexity of biological circuits grows, it becomes more complicated and less fruitful to rely on the rational design paradigm, because it demands many time-consuming trial-and-error cycles. One of the reasons is the context-dependent behavior of small assembly parts (like BioBricks), which in a complex environment often interact in an unpredictable way. Therefore, the idea of evolutionary engineering (artificial directed in vivo evolution) based on screening and selection of randomized combinatorial genetic circuit libraries became popular. In this article we build on the so-called dual selection technique. We propose a plasmid-based framework using toxin-antitoxin pairs together with the relaxase conjugative protein, enabling an efficient autonomous in vivo evolutionary selection of simple Boolean circuits in bacteria (E. coli was chosen for demonstration). Unlike previously reported protocols, both on and off selection steps can run simultaneously in various cells in the same environment without human intervention; and good circuits not only survive the selection process but are also horizontally transferred by conjugation to the neighbor cells to accelerate the convergence rate of the selection process. Our directed evolution strategy combines a new dual selection method with fluorescence-based screening to increase the robustness of the technique against mutations. As there are more orthogonal toxin-antitoxin pairs in E. coli, the approach is likely to be scalable to more complex functions. In silico experiments based on empirical data confirm the high search and selection capability of the protocol.

Brain clock driven by neuropeptides and second messengers.

The master circadian pacemaker in mammals is localized in a small portion of the brain called the suprachiasmatic nucleus (SCN). It is unclear how the SCN produces circadian rhythms. A common interpretation is that the SCN produces oscillations through the coupling of genetic oscillators in the neurons. The coupling is effected by a network of neuropeptides and second messengers. This network is crucial for the correct function of the SCN. However, models that study a possible oscillatory behavior of the network itself have received little attention. Here we propose and analyze a model to examine this oscillatory potential. We show that an intercellular oscillator emerges in the SCN as a result of the neuropeptide and second messenger dynamics. We find that this intercellular clock can produce circadian rhythms by itself with and without genetic clocks. We also found that the model is robust to perturbation of parameters and can be entrained by light-dark cycles.

The laws of natural deduction in inference by DNA computer.

We present a DNA-based implementation of reaction system with molecules encoding elements of the propositional logic, that is, propositions and formulas. The protocol can perform inference steps using, for example, modus ponens and modus tollens rules and de Morgan's laws. The set of the implemented operations allows for inference of formulas using the laws of natural deduction. The system can also detect whether a certain proposition a can be deduced from the basic facts and given rules. The whole protocol is fully autonomous; that is, after introducing the initial set of molecules, no human assistance is needed. Only one restriction enzyme is used throughout the inference process. Unlike some other similar implementations, our improved design allows representing simultaneously a fact a and its negation ~a, including special reactions to detect the inconsistency, that is, a simultaneous occurrence of a fact and its negation. An analysis of correctness, completeness, and complexity is included.

DNA strand displacement system running logic programs.

The paper presents a DNA-based computing model which is enzyme-free and autonomous, not requiring a human intervention during the computation. The model is able to perform iterated resolution steps with logical formulae in conjunctive normal form. The implementation is based on the technique of DNA strand displacement, with each clause encoded in a separate DNA molecule. Propositions are encoded assigning a strand to each proposition p, and its complementary strand to the proposition ¬p; clauses are encoded comprising different propositions in the same strand. The model allows to run logic programs composed of Horn clauses by cascading resolution steps. The potential of the model is demonstrated also by its theoretical capability of solving SAT. The resulting SAT algorithm has a linear time complexity in the number of resolution steps, whereas its spatial complexity is exponential in the number of variables of the formula.

A P system and a constructive membrane-inspired DNA algorithm for solving the Maximum Clique Problem.

We present a P system with replicated rewriting to solve the Maximum Clique Problem for a graph. Strings representing cliques are built gradually. This involves the use of inhibitors that control the space of all generated solutions to the problem. Calculating the maximum clique for a graph is a highly relevant issue not only on purely computational grounds, but also because of its relationship to fundamental problems in genomics. We propose to implement the designed P system by means of a DNA algorithm. This algorithm is then compared with two standard papers that addressed the same problem and its DNA implementation in the past. This comparison is carried out on the basis of a series of computational and physical parameters. Our solution features a significantly lower cost in terms of time, the number and size of strands, as well as the simplicity of the biological implementation.