A stochastic vs deterministic perspective on the timing of cellular events.

Cells are the fundamental units of life, and like all life forms, they change over time. Changes in cell state are driven by molecular processes; of these many are initiated when molecule numbers reach and exceed specific thresholds, a characteristic that can be described as "digital cellular logic". Here we show how molecular and cellular noise profoundly influence the time to cross a critical threshold-the first-passage time-and map out scenarios in which stochastic dynamics result in shorter or longer average first-passage times compared to noise-less dynamics. We illustrate the dependence of the mean first-passage time on noise for a set of exemplar models of gene expression, auto-regulatory feedback control, and enzyme-mediated catalysis. Our theory provides intuitive insight into the origin of these effects and underscores two important insights: (i) deterministic predictions for cellular event timing can be highly inaccurate when molecule numbers are within the range known for many cells; (ii) molecular noise can significantly shift mean first-passage times, particularly within auto-regulatory genetic feedback circuits.

Repeated Decision Stumping Distils Simple Rules from Single-Cell Data.

Single-cell data afford unprecedented insights into molecular processes. But the complexity and size of these data sets have proved challenging and given rise to a large armory of statistical and machine learning approaches. The majority of approaches focuses on either describing features of these data, or making predictions and classifying unlabeled samples. In this study, we introduce repeated decision stumping (ReDX) as a method to distill simple models from single-cell data. We develop decision trees of depth one-hence "stumps"-to identify in an inductive manner, gene products involved in driving cell fate transitions, and in applications to published data we are able to discover the key players involved in these processes in an unbiased manner without prior knowledge. Our algorithm is deliberately targeting the simplest possible candidate hypotheses that can be extracted from complex high-dimensional data. There are three reasons for this: (1) the predictions become straightforwardly testable hypotheses; (2) the identified candidates form the basis for further mechanistic model development, for example, for engineering and synthetic biology interventions; and (3) this approach complements existing descriptive modeling approaches and frameworks. The approach is computationally efficient, has remarkable predictive power, including in simulation studies where the ground truth is known, and yields robust and statistically stable predictors; the same set of candidates is generated by applying the algorithm to different subsamples of experimental data.

BondGraphs.jl: composable energy-based modelling in systems biology.

SUMMARY: BondGraphs.jl is a Julia implementation of bond graphs. Bond graphs provide a modelling framework that describes energy flow through a physical system and by construction enforce thermodynamic constraints. The framework is widely used in engineering and has recently been shown to be a powerful approach for modelling biology. Models are mutable, hierarchical, multiscale, and multiphysics, and BondGraphs.jl is compatible with the Julia modelling ecosystem. AVAILABILITY AND IMPLEMENTATION: BondGraphs.jl is freely available under the MIT license. Source code and documentation can be found at https://github.com/jedforrest/BondGraphs.jl.

Julia for biologists.

Major computational challenges exist in relation to the collection, curation, processing and analysis of large genomic and imaging datasets, as well as the simulation of larger and more realistic models in systems biology. Here we discuss how a relative newcomer among programming languages-Julia-is poised to meet the current and emerging demands in the computational biosciences and beyond. Speed, flexibility, a thriving package ecosystem and readability are major factors that make high-performance computing and data analysis available to an unprecedented degree. We highlight how Julia's design is already enabling new ways of analyzing biological data and systems, and we provide a list of resources that can facilitate the transition into Julian computing.

Surveying membrane landscapes: a new look at the bacterial cell surface.

Recent studies applying advanced imaging techniques are changing the way we understand bacterial cell surfaces, bringing new knowledge on everything from single-cell heterogeneity in bacterial populations to their drug sensitivity and mechanisms of antimicrobial resistance. In both Gram-positive and Gram-negative bacteria, the outermost surface of the bacterial cell is being imaged at nanoscale; as a result, topographical maps of bacterial cell surfaces can be constructed, revealing distinct zones and specific features that might uniquely identify each cell in a population. Functionally defined assembly precincts for protein insertion into the membrane have been mapped at nanoscale, and equivalent lipid-assembly precincts are suggested from discrete lipopolysaccharide patches. As we review here, particularly for Gram-negative bacteria, the applications of various modalities of nanoscale imaging are reawakening our curiosity about what is conceptually a 3D cell surface landscape: what it looks like, how it is made and how it provides resilience to respond to environmental impacts.

Integrating Problem-Based Learning Into an Internal Medicine Residency Curriculum.

Background: Problem-based learning (PBL) is a form of constructivist learning that allows learners to use higher order thinking by promoting learners to construct their own knowledge and understanding. PBL is prevalent in medical school education, but literature on PBL in graduate medical education (GME) is lacking. Because of the limited amount of data on PBL curricula in GME and the need for young physicians to develop critical thinking, lifelong self-directed learning, and problem-solving skills, we sought to incorporate PBL into the curriculum for our internal medicine residency program in a university-based community hospital setting. Methods: The PBL committee created 4 cases derived from actual patient encounters that address common chief complaints encountered in the hospital and served as a crash course curriculum for interns in internal medicine. The success of the PBL curriculum was measured using a 39-question survey created by PBL leadership to assess the learners' satisfaction with case content, likeability/design, feasibility, effectiveness, and motivation/self-learning. Additional questions asked for ways to improve PBL sessions in the future. Results: Overall, interns felt the content was clinically relevant, challenged them to think critically, and aided in the medical management of their patients. They also found PBL to be more effective and more enjoyable than the traditional lecture-style curriculum. Conclusion: Implementing a PBL curriculum in a residency program is possible. Although PBL has associated challenges such as scheduling, it is well received when supported by the program.

Open problems in mathematical biology.

Biology is data-rich, and it is equally rich in concepts and hypotheses. Part of trying to understand biological processes and systems is therefore to confront our ideas and hypotheses with data using statistical methods to determine the extent to which our hypotheses agree with reality. But doing so in a systematic way is becoming increasingly challenging as our hypotheses become more detailed, and our data becomes more complex. Mathematical methods are therefore gaining in importance across the life- and biomedical sciences. Mathematical models allow us to test our understanding, make testable predictions about future behaviour, and gain insights into how we can control the behaviour of biological systems. It has been argued that mathematical methods can be of great benefit to biologists to make sense of data. But mathematics and mathematicians are set to benefit equally from considering the often bewildering complexity inherent to living systems. Here we present a small selection of open problems and challenges in mathematical biology. We have chosen these open problems because they are of both biological and mathematical interest.

A group theoretic approach to model comparison with simplicial representations.

The complexity of biological systems, and the increasingly large amount of associated experimental data, necessitates that we develop mathematical models to further our understanding of these systems. Because biological systems are generally not well understood, most mathematical models of these systems are based on experimental data, resulting in a seemingly heterogeneous collection of models that ostensibly represent the same system. To understand the system we therefore need to understand how the different models are related to each other, with a view to obtaining a unified mathematical description. This goal is complicated by the fact that a number of distinct mathematical formalisms may be employed to represent the same system, making direct comparison of the models very difficult. A methodology for comparing mathematical models based on their underlying conceptual structure is therefore required. In previous work we developed an appropriate framework for model comparison where we represent models, specifically the conceptual structure of the models, as labelled simplicial complexes and compare them with the two general methodologies of comparison by distance and comparison by equivalence. In this article we continue the development of our model comparison methodology in two directions. First, we present a rigorous and automatable methodology for the core process of comparison by equivalence, namely determining the vertices in a simplicial representation, corresponding to model components, that are conceptually related and the identification of these vertices via simplicial operations. Our methodology is based on considerations of vertex symmetry in the simplicial representation, for which we develop the required mathematical theory of group actions on simplicial complexes. This methodology greatly simplifies and expedites the process of determining model equivalence. Second, we provide an alternative mathematical framework for our model-comparison methodology by representing models as groups, which allows for the direct application of group-theoretic techniques within our model-comparison methodology.

The chemical Langevin equation for biochemical systems in dynamic environments.

Modeling and simulation of complex biochemical reaction networks form cornerstones of modern biophysics. Many of the approaches developed so far capture temporal fluctuations due to the inherent stochasticity of the biophysical processes, referred to as intrinsic noise. Stochastic fluctuations, however, predominantly stem from the interplay of the network with many other-and mostly unknown-fluctuating processes, as well as with various random signals arising from the extracellular world; these sources contribute extrinsic noise. Here, we provide a computational simulation method to probe the stochastic dynamics of biochemical systems subject to both intrinsic and extrinsic noise. We develop an extrinsic chemical Langevin equation (CLE)-a physically motivated extension of the CLE-to model intrinsically noisy reaction networks embedded in a stochastically fluctuating environment. The extrinsic CLE is a continuous approximation to the chemical master equation (CME) with time-varying propensities. In our approach, noise is incorporated at the level of the CME, and it can account for the full dynamics of the exogenous noise process, irrespective of timescales and their mismatches. We show that our method accurately captures the first two moments of the stationary probability density when compared with exact stochastic simulation methods while reducing the computational runtime by several orders of magnitude. Our approach provides a method that is practical, computationally efficient, and physically accurate to study systems that are simultaneously subject to a variety of noise sources.

More is different with a vengeance.

In his 1972 landmark paper "More is Different," Philip W. Anderson established "complexity" as a fundamentally important subject of inquiry. He highlighted the profound limitations of reductionist approaches in understanding nature's complexity, and he set in motion new lines of investigation that have, among other things, led to systems biology.

Cohesin couples transcriptional bursting probabilities of inducible enhancers and promoters.

Innate immune responses rely on inducible gene expression programmes which, in contrast to steady-state transcription, are highly dependent on cohesin. Here we address transcriptional parameters underlying this cohesin-dependence by single-molecule RNA-FISH and single-cell RNA-sequencing. We show that inducible innate immune genes are regulated predominantly by an increase in the probability of active transcription, and that probabilities of enhancer and promoter transcription are coordinated. Cohesin has no major impact on the fraction of transcribed inducible enhancers, or the number of mature mRNAs produced per transcribing cell. Cohesin is, however, required for coupling the probabilities of enhancer and promoter transcription. Enhancer-promoter coupling may not be explained by spatial proximity alone, and at the model locus Il12b can be disrupted by selective inhibition of the cohesinopathy-associated BET bromodomain BD2. Our data identify discrete steps in enhancer-mediated inducible gene expression that differ in cohesin-dependence, and suggest that cohesin and BD2 may act on shared pathways.

HyperGraphs.jl: representing higher-order relationships in Julia.

SUMMARY: HyperGraphs.jl is a Julia package that implements hypergraphs. These are a generalization of graphs that allow us to represent n-ary relationships and not just binary, pairwise relationships. High-order interactions are commonplace in biological systems and are of critical importance to their dynamics; hypergraphs thus offer a natural way to accurately describe and model these systems. AVAILABILITY AND IMPLEMENTATION: HyperGraphs.jl is freely available under the MIT license. Source code and documentation can be found at https://github.com/lpmdiaz/HyperGraphs.jl. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Gaining confidence in inferred networks.

Network inference is a notoriously challenging problem. Inferred networks are associated with high uncertainty and likely riddled with false positive and false negative interactions. Especially for biological networks we do not have good ways of judging the performance of inference methods against real networks, and instead we often rely solely on the performance against simulated data. Gaining confidence in networks inferred from real data nevertheless thus requires establishing reliable validation methods. Here, we argue that the expectation of mixing patterns in biological networks such as gene regulatory networks offers a reasonable starting point: interactions are more likely to occur between nodes with similar biological functions. We can quantify this behaviour using the assortativity coefficient, and here we show that the resulting heuristic, functional assortativity, offers a reliable and informative route for comparing different inference algorithms.

Noise distorts the epigenetic landscape and shapes cell-fate decisions.

The Waddington epigenetic landscape has become an iconic representation of the cellular differentiation process. Recent single-cell transcriptomic data provide new opportunities for quantifying this originally conceptual tool, offering insight into the gene regulatory networks underlying cellular development. While many methods for constructing the landscape have been proposed, by far the most commonly employed approach is based on computing the landscape as the negative logarithm of the steady-state probability distribution. Here, we use simple models to highlight the complexities and limitations that arise when reconstructing the potential landscape in the presence of stochastic fluctuations. We consider how the landscape changes in accordance with different stochastic systems and show that it is the subtle interplay between the deterministic and stochastic components of the system that ultimately shapes the landscape. We further discuss how the presence of noise has important implications for the identifiability of the regulatory dynamics from experimental data. A record of this paper's transparent peer review process is included in the supplemental information.

Turing pattern design principles and their robustness.

Turing patterns have morphed from mathematical curiosities into highly desirable targets for synthetic biology. For a long time, their biological significance was sometimes disputed but there is now ample evidence for their involvement in processes ranging from skin pigmentation to digit and limb formation. While their role in developmental biology is now firmly established, their synthetic design has so far proved challenging. Here, we review recent large-scale mathematical analyses that have attempted to narrow down potential design principles. We consider different aspects of robustness of these models and outline why this perspective will be helpful in the search for synthetic Turing-patterning systems. We conclude by considering robustness in the context of developmental modelling more generally. This article is part of the theme issue 'Recent progress and open frontiers in Turing's theory of morphogenesis'.

Model comparison via simplicial complexes and persistent homology.

In many scientific and technological contexts, we have only a poor understanding of the structure and details of appropriate mathematical models. We often, therefore, need to compare different models. With available data we can use formal statistical model selection to compare and contrast the ability of different mathematical models to describe such data. There is, however, a lack of rigorous methods to compare different models a priori. Here, we develop and illustrate two such approaches that allow us to compare model structures in a systematic way by representing models as simplicial complexes. Using well-developed concepts from simplicial algebraic topology, we define a distance between models based on their simplicial representations. Employing persistent homology with a flat filtration provides for alternative representations of the models as persistence intervals, which represent model structure, from which the model distances are also obtained. We then expand on this measure of model distance to study the concept of model equivalence to determine the conceptual similarity of models. We apply our methodology for model comparison to demonstrate an equivalence between a positional-information model and a Turing-pattern model from developmental biology, constituting a novel observation for two classes of models that were previously regarded as unrelated.

Pathway dynamics can delineate the sources of transcriptional noise in gene expression.

Single-cell expression profiling opens up new vistas on cellular processes. Extensive cell-to-cell variability at the transcriptomic and proteomic level has been one of the stand-out observations. Because most experimental analyses are destructive we only have access to snapshot data of cellular states. This loss of temporal information presents significant challenges for inferring dynamics, as well as causes of cell-to-cell variability. In particular, we typically cannot separate dynamic variability from within cells ('intrinsic noise') from variability across the population ('extrinsic noise'). Here, we make this non-identifiability mathematically precise, allowing us to identify new experimental set-ups that can assist in resolving this non-identifiability. We show that multiple generic reporters from the same biochemical pathways (e.g. mRNA and protein) can infer magnitudes of intrinsic and extrinsic transcriptional noise, identifying sources of heterogeneity. Stochastic simulations support our theory, and demonstrate that 'pathway-reporters' compare favourably to the well-known, but often difficult to implement, dual-reporter method.

In biology, seemingly random variation within or between cells can have significant effects on a number of cellular processes, like how cells divide and develop. For example, how often a gene is switched on, or 'expressed', can randomly fluctuate over time. This 'noise' may lead to a cell having slightly more of a particular molecule, causing it to behave differently to other cells in the population. However, it is currently unclear how this random variation is created and controlled in cells, and what effect this has on biological systems as a whole. When a gene is expressed, its sequence typically gets copied in to a molecule called mRNA, which is then processed and used to build the protein encoded by the gene. By measuring the levels of mRNA molecules in individual cells, researchers have been able to investigate how gene expression varies within populations. These experiments are carried out on dead cells at a single point in time, and mathematical models are then applied to detect noise in the molecular data. This approach, however, precludes how noise changes over time, making it difficult to determine the source of cell-to-cell variability. In particular, whether the variation detected is the result of genuine random molecular changes (intrinsic noise), or external factors ­ such as temperature and pH ­ fluctuating in the cells environment (extrinsic noise). Here, Ham et al. have built on previous mathematical models to identify a new approach for investigating the source of molecular noise. They found that for any given gene it is impossible to understand what causes its activity levels to vary just from data on its mRNA levels. Instead, information on other molecules that are affected by expression of the gene (termed 'pathway reporters') can provide a clearer picture of whether molecular variability is the result of intrinsic or extrinsic noise. The mathematical models developed by Ham et al. reveal what can and cannot be learned about noise from gene expression data. Furthermore, pathway-reporters are easier to measure experimentally than other reporters that are typically used to study the origins and effects of cell-to-cell variability. These findings could help researchers design single cell experiments that are better for studying noise, leading to a deeper understanding of how different types of variation impact cell biology.

The design principles of discrete turing patterning systems.

The formation of spatial structures lies at the heart of developmental processes. However, many of the underlying gene regulatory and biochemical processes remain poorly understood. Turing patterns constitute a main candidate to explain such processes, but they appear sensitive to fluctuations and variations in kinetic parameters, raising the question of how they may be adopted and realised in naturally evolved systems. The vast majority of mathematical studies of Turing patterns have used continuous models specified in terms of partial differential equations. Here, we complement this work by studying Turing patterns using discrete cellular automata models. We perform a large-scale study on all possible two-species networks and find the same Turing pattern producing networks as in the continuous framework. In contrast to continuous models, however, we find these Turing pattern topologies to be substantially more robust to changes in the parameters of the model. We also find that diffusion-driven instabilities are substantially weaker predictors for Turing patterns in our discrete modelling framework in comparison to the continuous case, in the sense that the presence of an instability does not guarantee a pattern emerging in simulations. We show that a more refined criterion constitutes a stronger predictor. The similarity of the results for the two modelling frameworks suggests a deeper underlying principle of Turing mechanisms in nature. Together with the larger robustness in the discrete case this suggests that Turing patterns may be more robust than previously thought.

Collocation based training of neural ordinary differential equations.

The predictive power of machine learning models often exceeds that of mechanistic modeling approaches. However, the interpretability of purely data-driven models, without any mechanistic basis is often complicated, and predictive power by itself can be a poor metric by which we might want to judge different methods. In this work, we focus on the relatively new modeling techniques of neural ordinary differential equations. We discuss how they relate to machine learning and mechanistic models, with the potential to narrow the gulf between these two frameworks: they constitute a class of hybrid model that integrates ideas from data-driven and dynamical systems approaches. Training neural ODEs as representations of dynamical systems data has its own specific demands, and we here propose a collocation scheme as a fast and efficient training strategy. This alleviates the need for costly ODE solvers. We illustrate the advantages that collocation approaches offer, as well as their robustness to qualitative features of a dynamical system, and the quantity and quality of observational data. We focus on systems that exemplify some of the hallmarks of complex dynamical systems encountered in systems biology, and we map out how these methods can be used in the analysis of mathematical models of cellular and physiological processes.