The Reasoning Engine: A Satisfiability Modulo Theories-Based Framework for Reasoning About Discrete Biological Models.

We present a framework called the Reasoning Engine, which implements Satisfiability Modulo Theories (SMT)-based methods within a unified computational environment to address diverse biological analysis problems. The Reasoning Engine was used to reproduce results from key scientific studies, as well as supporting new research in stem cell biology. The framework utilizes an intermediate language for encoding partially specified discrete dynamical systems, which bridges the gap between high-level domain-specific languages and low-level SMT solvers. We provide this framework as open source together with various biological case studies, illustrating the synthesis, enumeration, optimization, and reasoning over models consistent with experimental observations to reveal novel biological insights.

A deep learning model for predicting next-generation sequencing depth from DNA sequence.

Targeted high-throughput DNA sequencing is a primary approach for genomics and molecular diagnostics, and more recently as a readout for DNA information storage. Oligonucleotide probes used to enrich gene loci of interest have different hybridization kinetics, resulting in non-uniform coverage that increases sequencing costs and decreases sequencing sensitivities. Here, we present a deep learning model (DLM) for predicting Next-Generation Sequencing (NGS) depth from DNA probe sequences. Our DLM includes a bidirectional recurrent neural network that takes as input both DNA nucleotide identities as well as the calculated probability of the nucleotide being unpaired. We apply our DLM to three different NGS panels: a 39,145-plex panel for human single nucleotide polymorphisms (SNP), a 2000-plex panel for human long non-coding RNA (lncRNA), and a 7373-plex panel targeting non-human sequences for DNA information storage. In cross-validation, our DLM predicts sequencing depth to within a factor of 3 with 93% accuracy for the SNP panel, and 99% accuracy for the non-human panel. In independent testing, the DLM predicts the lncRNA panel with 89% accuracy when trained on the SNP panel. The same model is also effective at predicting the measured single-plex kinetic rate constants of DNA hybridization and strand displacement.

The effect of COVID-19 on blood donation habits.

BACKGROUND: Blood centers (BCs) rely on schools and businesses. Shelter-in-place orders closed them. This study determined how COVID-19 affected donation habits. STUDY DESIGN AND METHODS: Two periods were reviewed (May 1 through June 30, 2018 vs 2019 [control] and 2019 vs 2020 [study-COVID period]). These donations were reviewed: first-time, repeat (donation ≤ 2 years), and lapsed (no donation > 2 years); sex; age; ethnicity; and ABO blood groups at high school and college drives. Testing all donors for SARS-CoV-2 antibodies started May 18, 2020. RESULTS: In the study period donations significantly increased (control P = .683, study P ≤ .0001) and comparing sex (control male P = .716, female P = .657; study male P = .004, female P ≤ .0001). In the study period there was a significant decrease in Hispanic (P = .001) and African American (P < .0001) donations also seen among high school and college drives and an increase in Caucasian (P < .0001) donations. There was a significant increase in first-time (P < .0001) and lapsed donors (P < .0001) in the study period vs control (first-time P = .087, lapsed P = .308) and a significant decrease in donors not more than 30 years (study 16-20 P < .0001, 21-30 P < .0001). There was a significant increase in all blood types in the study period (P < .0001) and in donations after implementation of SARS-CoV-2 antibody testing (P = .001). CONCLUSIONS: Significant changes occurred in donation habits in the study vs the control periods. These included increased total donations, comparing sexes, first-time and lapsed donors, all blood types, and Caucasian donations. Significant decreases were seen in Hispanic and African American donations and those not more than 30 years old.

Formal Analysis of Network Motifs Links Structure to Function in Biological Programs.

A recurring set of small sub-networks have been identified as the building blocks of biological networks across diverse organisms. These network motifs are associated with certain dynamic behaviors and define key modules that are important for understanding complex biological programs. Besides studying the properties of motifs in isolation, current algorithms typically evaluate the occurrence frequency of a specific motif in a given biological network compared to that in random networks of similar structure. However, it remains challenging to relate the structure of motifs to the observed and expected behavior of the larger, more complex network they are contained within. This problem is compounded as even the precise structure of most biological networks remains largely unknown. Previously, we developed a formal reasoning approach enabling the synthesis of biological networks capable of reproducing some experimentally observed behavior. Here, we extend this approach to allow reasoning over the requirement for specific network motifs as a way of explaining how these behaviors arise. We illustrate the approach by analyzing the motifs involved in sign-sensitive delay and pulse generation. We demonstrate the scalability and biological relevance of the approach by studying the previously defined networks governing myeloid differentiation, the yeast cell cycle, and naïve pluripotency in mouse embryonic stem cells, revealing the requirement for certain motifs in these systems.

Discovering Essential Multiple Gene Effects Through Large Scale Optimization: An Application to Human Cancer Metabolism.

Computational modelling of metabolic processes has proven to be a useful approach to formulate our knowledge and improve our understanding of core biochemical systems that are crucial to maintaining cellular functions. Towards understanding the broader role of metabolism on cellular decision-making in health and disease conditions, it is important to integrate the study of metabolism with other core regulatory systems and omics within the cell, including gene expression patterns. After quantitatively integrating gene expression profiles with a genome-scale reconstruction of human metabolism, we propose a set of combinatorial methods to reverse engineer gene expression profiles and to find pairs and higher-order combinations of genetic modifications that simultaneously optimize multi-objective cellular goals. This enables us to suggest classes of transcriptomic profiles that are most suitable to achieve given metabolic phenotypes. We demonstrate how our techniques are able to compute beneficial, neutral or "toxic" combinations of gene expression levels. We test our methods on nine tissue-specific cancer models, comparing our outcomes with the corresponding normal cells, identifying genes as targets for potential therapies. Our methods open the way to a broad class of applications that require an understanding of the interplay among genotype, metabolism, and cellular behaviour, at scale.

Synthesizing and tuning stochastic chemical reaction networks with specified behaviours.

Methods from stochastic dynamical systems theory have been instrumental in understanding the behaviours of chemical reaction networks (CRNs) arising in natural systems. However, considerably less attention has been given to the inverse problem of synthesizing CRNs with a specified behaviour, which is important for the forward engineering of biological systems. Here, we present a method for generating discrete-state stochastic CRNs from functional specifications, which combines synthesis of reactions using satisfiability modulo theories and parameter optimization using Markov chain Monte Carlo. First, we identify candidate CRNs that have the possibility to produce correct computations for a given finite set of inputs. We then optimize the parameters of each CRN, using a combination of stochastic search techniques applied to the chemical master equation, to improve the probability of correct behaviour and rule out spurious solutions. In addition, we use techniques from continuous-time Markov chain theory to analyse the expected termination time for each CRN. We illustrate our approach by synthesizing CRNs for probabilistically computing majority, maximum and division, producing both known and previously unknown networks, including a novel CRN for probabilistically computing the maximum of two species. In future, synthesis techniques such as these could be used to automate the design of engineered biological circuits and chemical systems.

Predicting DNA hybridization kinetics from sequence.

Hybridization is a key molecular process in biology and biotechnology, but so far there is no predictive model for accurately determining hybridization rate constants based on sequence information. Here, we report a weighted neighbour voting (WNV) prediction algorithm, in which the hybridization rate constant of an unknown sequence is predicted based on similarity reactions with known rate constants. To construct this algorithm we first performed 210 fluorescence kinetics experiments to observe the hybridization kinetics of 100 different DNA target and probe pairs (36 nt sub-sequences of the CYCS and VEGF genes) at temperatures ranging from 28 to 55 °C. Automated feature selection and weighting optimization resulted in a final six-feature WNV model, which can predict hybridization rate constants of new sequences to within a factor of 3 with ∼91% accuracy, based on leave-one-out cross-validation. Accurate prediction of hybridization kinetics allows the design of efficient probe sequences for genomics research.

A Method to Identify and Analyze Biological Programs through Automated Reasoning.

Predictive biology is elusive because rigorous, data-constrained, mechanistic models of complex biological systems are difficult to derive and validate. Current approaches tend to construct and examine static interaction network models, which are descriptively rich but often lack explanatory and predictive power, or dynamic models that can be simulated to reproduce known behavior. However, in such approaches implicit assumptions are introduced as typically only one mechanism is considered, and exhaustively investigating all scenarios is impractical using simulation. To address these limitations, we present a methodology based on automated formal reasoning, which permits the synthesis and analysis of the complete set of logical models consistent with experimental observations. We test hypotheses against all candidate models, and remove the need for simulation by characterizing and simultaneously analyzing all mechanistic explanations of observed behavior. Our methodology transforms knowledge of complex biological processes from sets of possible interactions and experimental observations to precise, predictive biological programs governing cell function.

Automated Synthesis and Analysis of Switching Gene Regulatory Networks.

Studying the gene regulatory networks (GRNs) that govern how cells change into specific cell types with unique roles throughout development is an active area of experimental research. The fate specification process can be viewed as a biological program prescribing the system dynamics, governed by a network of genetic interactions. To investigate the possibility that GRNs are not fixed but rather change their topology, for example as cells progress through commitment, we introduce the concept of Switching Gene Regulatory Networks (SGRNs) to enable the modelling and analysis of network reconfiguration. We define the synthesis problem of constructing SGRNs that are guaranteed to satisfy a set of constraints representing experimental observations of cell behaviour. We propose a solution to this problem that employs methods based upon Satisfiability Modulo Theories (SMT) solvers, and evaluate the feasibility and scalability of our approach by considering a set of synthetic benchmarks exhibiting possible biological behaviour of cell development. We outline how our approach is applied to a more realistic biological system, by considering a simplified network involved in the processes of neuron maturation and fate specification in the mammalian cortex.

Orthogonal intercellular signaling for programmed spatial behavior.

Bidirectional intercellular signaling is an essential feature of multicellular organisms, and the engineering of complex biological systems will require multiple pathways for intercellular signaling with minimal crosstalk. Natural quorum-sensing systems provide components for cell communication, but their use is often constrained by signal crosstalk. We have established new orthogonal systems for cell-cell communication using acyl homoserine lactone signaling systems. Quantitative measurements in contexts of differing receiver protein expression allowed us to separate different types of crosstalk between 3-oxo-C6- and 3-oxo-C12-homoserine lactones, cognate receiver proteins, and DNA promoters. Mutating promoter sequences minimized interactions with heterologous receiver proteins. We used experimental data to parameterize a computational model for signal crosstalk and to estimate the effect of receiver protein levels on signal crosstalk. We used this model to predict optimal expression levels for receiver proteins, to create an effective two-channel cell communication device. Establishment of a novel spatial assay allowed measurement of interactions between geometrically constrained cell populations via these diffusible signals. We built relay devices capable of long-range signal propagation mediated by cycles of signal induction, communication and response by discrete cell populations. This work demonstrates the ability to systematically reduce crosstalk within intercellular signaling systems and to use these systems to engineer complex spatiotemporal patterning in cell populations.

Programming languages for circuit design.

This chapter provides an overview of a programming language for Genetic Engineering of Cells (GEC). A GEC program specifies a genetic circuit at a high level of abstraction through constraints on otherwise unspecified DNA parts. The GEC compiler then selects parts which satisfy the constraints from a given parts database. GEC further provides more conventional programming language constructs for abstraction, e.g., through modularity. The GEC language and compiler is available through a Web tool which also provides functionality, e.g., for simulation of designed circuits.

Computational design of nucleic acid feedback control circuits.

The design of synthetic circuits for controlling molecular-scale processes is an important goal of synthetic biology, with potential applications in future in vitro and in vivo biotechnology. In this paper, we present a computational approach for designing feedback control circuits constructed from nucleic acids. Our approach relies on an existing methodology for expressing signal processing and control circuits as biomolecular reactions. We first extend the methodology so that circuits can be expressed using just two classes of reactions: catalysis and annihilation. We then propose implementations of these reactions in three distinct classes of nucleic acid circuits, which rely on DNA strand displacement, DNA enzyme and RNA enzyme mechanisms, respectively. We use these implementations to design a Proportional Integral controller, capable of regulating the output of a system according to a given reference signal, and discuss the trade-offs between the different approaches. As a proof of principle, we implement our methodology as an extension to a DNA strand displacement software tool, thus allowing a broad range of nucleic acid circuits to be designed and analyzed within a common modeling framework.

A computational method for automated characterization of genetic components.

The ability to design and construct synthetic biological systems with predictable behavior could enable significant advances in medical treatment, agricultural sustainability, and bioenergy production. However, to reach a stage where such systems can be reliably designed from biological components, integrated experimental and computational techniques that enable robust component characterization are needed. In this paper we present a computational method for the automated characterization of genetic components. Our method exploits a recently developed multichannel experimental protocol and integrates bacterial growth modeling, Bayesian parameter estimation, and model selection, together with data processing steps that are amenable to automation. We implement the method within the Genetic Engineering of Cells modeling and design environment, which enables both characterization and design to be integrated within a common software framework. To demonstrate the application of the method, we quantitatively characterize a synthetic receiver device that responds to the 3-oxohexanoyl-homoserine lactone signal, across a range of experimental conditions.

Robustness analysis and tuning of synthetic gene networks.

MOTIVATION: The goal of synthetic biology is to design and construct biological systems that present a desired behavior. The construction of synthetic gene networks implementing simple functions has demonstrated the feasibility of this approach. However, the design of these networks is difficult, notably because existing techniques and tools are not adapted to deal with uncertainties on molecular concentrations and parameter values. RESULTS: We propose an approach for the analysis of a class of uncertain piecewise-multiaffine differential equation models. This modeling framework is well adapted to the experimental data currently available. Moreover, these models present interesting mathematical properties that allow the development of efficient algorithms for solving robustness analyses and tuning problems. These algorithms are implemented in the tool RoVerGeNe, and their practical applicability and biological relevance are demonstrated on the analysis of the tuning of a synthetic transcriptional cascade built in Escherichia coli. AVAILABILITY: RoVerGeNe and the transcriptional cascade model are available at http://iasi.bu.edu/%7Ebatt/rovergene/rovergene.htm.

The sequence-dependent unfolding pathway plays a critical role in the amyloidogenicity of transthyretin.

Human transthyretin (TTR) is an amyloidogenic protein whose aggregation is associated with several types of amyloid diseases. The following mechanism of TTR amyloid formation has been proposed. TTR tetramer at first dissociates into native monomers, which is the rate-limiting step in fibril formation. The monomeric species then partially unfold to form amyloidogenic intermediates that subsequently undergo a downhill self-assembly process. The amyloid deposit can be facilitated by disease-associated point mutations. However, only subtle structural differences were observed between the crystal structures of the wild type and the disease-associated variants. To investigate how single-point mutations influence the effective energy landscapes of TTR monomers, molecular dynamics (MD) simulations were performed on wild-type TTR and two pathogenic variants. Principal coordinate analysis on MD-generated ensembles has revealed multiple unfolding pathways for each protein. Amyloidogenic intermediates with the dislocated C strand-loop-D strand motif were observed only on the unfolding pathways of V30M and L55P variants and not for wild-type TTR. Our study suggests that the sequence-dependent unfolding pathway plays a crucial role in the amyloidogenicity of TTR. Analyses of side chain concerted motions indicate that pathogenic mutations on "edge strands" disrupt the delicate side chain correlated motions, which in turn may alter the sequence of unfolding events.

Peptide plane can flip in two opposite directions: implication in amyloid formation of transthyretin.

Transthyretin (TTR) is one of the known 20 or so human proteins that form fibrils in vivo, which is a hallmark of amyloid diseases. Recently, molecular dynamics simulations using ENCAD force field have revealed that under low pH conditions, the peptide planes of several amyloidogenic proteins can flip in one direction to form an alpha-pleated structure which may be a common conformational transition in the fibril formation. We performed molecular dynamics simulations with AMBER force fields on a recently engineered double mutant TTR, which was shown experimentally to form amyloid fibrils even under close to physiological conditions. Our simulations have demonstrated that peptide-plane flipping can occur even under neutral pH and room temperature for this amyloidogenic TTR variant. Unlike previously reported peptide-plane flipping of TTR using ENCAD force field, we have found two-way flipping using AMBER force field. We propose a new mechanism of amyloid formation based on the two-way flipping, which gives a better explanation of various experimental and computational results. In principle, the residual dipolar and hydrogen-bond scalar coupling techniques can be applied to the wild-type TTR and the variant to study the peptide-plane flipping of amyloidogenic proteins.