Search

Chemical synapses exhibit a diverse array of internal mechanisms that affect the dynamics of transmission efficacy. Many of these processes, such as release of neurotransmitter and vesicle recycling, depend strongly on activity-dependent influx and accumulation of Ca2+. To model how each of these processes may affect the processing of information in neural circuits, and how their dysfunction may lead to disease states, requires a computationally efficient modelling framework, capable of generating accurate phenomenology without incurring a heavy computational cost per synapse. Constructing a phenomenologically realistic model requires the precise characterization of the timing and probability of neurotransmitter release. Difficulties arise in that functional forms of instantaneous release rate can be difficult to extract from noisy data without running many thousands of trials, and in biophysical synapses, facilitation of per-vesicle release probability is confounded by depletion. To overcome this, we obtained traces of free Ca2+ concentration in response to various action potential stimulus trains from a molecular MCell model of a hippocampal Schaffer collateral axon. Ca2+ sensors were placed at varying distance from a voltage-dependent calcium channel (VDCC) cluster, and Ca2+ was buffered by calbindin. Then, using the calcium traces to drive deterministic state vector models of synaptotagmin 1 and 7 (Syt-1/7), which respectively mediate synchronous and asynchronous release in excitatory hippocampal synapses, we obtained high-resolution profiles of instantaneous release rate, to which we applied functional fits. Synchronous vesicle release occurred predominantly within half a micron of the source of spike-evoked Ca2+ influx, while asynchronous release occurred more consistently at all distances. Both fast and slow mechanisms exhibited multi-exponential release rate curves, whose magnitudes decayed exponentially with distance from the Ca2+ source. Profile parameters facilitate on different time scales according to a single, general facilitation function. These functional descriptions lay the groundwork for efficient mesoscale modelling of vesicular release dynamics. Author summary: Most information transmission between neurons in the brain occurs via release of neurotransmitter from synaptic vesicles. In response to a presynaptic spike, calcium influx at the active zone of a synapse can trigger the release of neurotransmitter with a certain probability. These stochastic release events may occur immediately after a spike or with some delay. As calcium accumulates from one spike to the next, the probability of release may increase (facilitate) for subsequent spikes. This process, known as short-term plasticity, transforms the spiking code to a release code, underlying much of the brain's information processing. In this paper, we use an accurate, detailed model of presynaptic molecular physiology to characterize these processes at high precision in response to various spike trains. We then apply model reduction to the results to obtain a phenomenological model of release timing, probability, and facilitation, which can perform as accurately as the molecular model but with far less computational cost. This mesoscale model of spike-evoked release and facilitation helps to bridge the gap between microscale molecular dynamics and macroscale information processing in neural circuits. It can thus benefit large scale modelling of neural circuits, biologically inspired machine learning models, and the design of neuromorphic chips. [ABSTRACT FROM AUTHOR]

Phase separation of biomolecules could be mediated by both specific and non-specific interactions. How the interplay between non-specific and specific interactions along with polymer entropy influences phase separation is an open question. We address this question by simulating self-associating molecules as polymer chains with a short core stretch that forms the specifically interacting functional interface and longer non-core regions that participate in non-specific/promiscuous interactions. Our results show that the interplay of specific (strength, ϵsp) and non-specific interactions (strength, ϵns) could result in phase separation of polymers and its transition to solid-like aggregates (mature state). In the absence of ϵns, the polymer chains do not dwell long enough in the vicinity of each other to undergo phase separation and transition into a mature state. On the other hand, in the limit of strong ϵns, the assemblies cannot transition into the mature state and form a non-specific assembly, suggesting an optimal range of interactions favoring mature multimers. In the scenario where only a fraction (Nfrac) of the non-core regions participate in attractive interactions, we find that slight modifications to either ϵns or Nfrac can result in dramatically altered self-assembled states. Using a combination of heterogeneous and homogeneous mix of polymers, we establish how this interplay between interaction energies dictates the propensity of biomolecules to find the correct binding partner at dilute concentrations in crowded environments. Author summary: Biological function relies on the ability of biomolecules to bind to specific interaction partners. In the crowded cellular milieu, the process of biomolecules binding to specific interaction partners to carry out a function is non-trivial. A mere diffusion-limited meeting of interaction partners in space does not ensure biomolecular function. Rather, even when in contact, these molecules have to find the correct orientations to carry out their function. Further, for dynamic biomolecules such as polymers, the functional configuration is often one of several possible configurations. In this scenario, assuming the functional configuration after binding involves overcoming a significant entropic barrier. Therefore, the interacting biomolecules have to dwell in contact long enough before they reorganize to find the functional orientation! While functional contacts offer an enthalpic gain, they are often only a small fraction of all protein-protein interactions. Therefore, in this paper, we study the role played by non-functional, promiscuous interactions in shaping the thermodynamics and kinetics of the formation of specific interactions. Our results suggest that there exists an optimal range of non-specific interaction strengths, which promotes the process of biomolecular complexes finding the functional configurations. [ABSTRACT FROM AUTHOR]

Identifying structural differences among proteins can be a non-trivial task. When contrasting ensembles of protein structures obtained from molecular dynamics simulations, biologically-relevant features can be easily overshadowed by spurious fluctuations. Here, we present SINATRA Pro, a computational pipeline designed to robustly identify topological differences between two sets of protein structures. Algorithmically, SINATRA Pro works by first taking in the 3D atomic coordinates for each protein snapshot and summarizing them according to their underlying topology. Statistically significant topological features are then projected back onto a user-selected representative protein structure, thus facilitating the visual identification of biophysical signatures of different protein ensembles. We assess the ability of SINATRA Pro to detect minute conformational changes in five independent protein systems of varying complexities. In all test cases, SINATRA Pro identifies known structural features that have been validated by previous experimental and computational studies, as well as novel features that are also likely to be biologically-relevant according to the literature. These results highlight SINATRA Pro as a promising method for facilitating the non-trivial task of pattern recognition in trajectories resulting from molecular dynamics simulations, with substantially increased resolution. Author summary: Structural features of proteins often serve as signatures of their biological function and molecular binding activity. Elucidating these structural features is essential for a full understanding of underlying biophysical mechanisms. While there are existing methods aimed at identifying structural differences between protein variants, such methods do not have the capability to jointly infer both geometric and dynamic changes, simultaneously. In this paper, we propose SINATRA Pro, a computational framework for extracting key structural features between two sets of proteins. SINATRA Pro robustly outperforms standard techniques in pinpointing the physical locations of both static and dynamic signatures across various types of protein ensembles, and it does so with improved resolution. [ABSTRACT FROM AUTHOR]

The study of transcription remains one of the centerpieces of modern biology with implications in settings from development to metabolism to evolution to disease. Precision measurements using a host of different techniques including fluorescence and sequencing readouts have raised the bar for what it means to quantitatively understand transcriptional regulation. In particular our understanding of the simplest genetic circuit is sufficiently refined both experimentally and theoretically that it has become possible to carefully discriminate between different conceptual pictures of how this regulatory system works. This regulatory motif, originally posited by Jacob and Monod in the 1960s, consists of a single transcriptional repressor binding to a promoter site and inhibiting transcription. In this paper, we show how seven distinct models of this so-called simple-repression motif, based both on thermodynamic and kinetic thinking, can be used to derive the predicted levels of gene expression and shed light on the often surprising past success of the thermodynamic models. These different models are then invoked to confront a variety of different data on mean, variance and full gene expression distributions, illustrating the extent to which such models can and cannot be distinguished, and suggesting a two-state model with a distribution of burst sizes as the most potent of the seven for describing the simple-repression motif. Author summary: With the advent of new technologies allowing us to query biological activity with ever increasing precision, the deluge of quantitative biological data demands quantitative models. Transcriptional regulation—a feature that lies at the core of our understanding of cellular control in myriad context ranging from development to disease—is no exception, with single-cell and single-molecule techniques being routinely deployed to study cellular decision making. These data have served as a fertile proving ground to test models of transcription that mainly come in two flavors: thermodynamic models (based on equilibrium statistical mechanics) and kinetic models (based on chemical kinetics). In this paper we study the correspondence between these theoretical frameworks in the context of the simple repression motif, a common regulatory architecture in prokaryotes in which a repressor with a single binding site regulates expression. We explore the consequences of different levels of coarse-graining of the molecular steps involved in transcription, finding that, at the level of mean gene expression, the different models cannot be distinguished. We then study higher moments of the gene expression distribution which allows us to discard several of the models that disagree with experimental data and supporting a minimal kinetic model. [ABSTRACT FROM AUTHOR]

The spread of severe acute respiratory syndrome coronavirus 2 (SARS-CoV-2) virus poses serious threats to the global public health and leads to worldwide crisis. No effective drug or vaccine is readily available. The viral RNA-dependent RNA polymerase (RdRp) is a promising therapeutic target. A hybrid drug screening procedure was proposed and applied to identify potential drug candidates targeting RdRp from 1906 approved drugs. Among the four selected market available drug candidates, Pralatrexate and Azithromycin were confirmed to effectively inhibit SARS-CoV-2 replication in vitro with EC50 values of 0.008μM and 9.453 μM, respectively. For the first time, our study discovered that Pralatrexate is able to potently inhibit SARS-CoV-2 replication with a stronger inhibitory activity than Remdesivir within the same experimental conditions. The paper demonstrates the feasibility of fast and accurate anti-viral drug screening for inhibitors of SARS-CoV-2 and provides potential therapeutic agents against COVID-19. Author summary: Currently, a novel coronavirus called SARS-COV-2 is spreading across many parts of the world. Unfortunately, there is still a lack of effective drugs against the virus. Additionally, it usually takes much longer time to develop a new drug using traditional methods. Thus, it is now better to rely on some alternative methods to develop drugs that can treat such a disease effectively. In this paper, we have proposed a deep learning and molecular dynamics simulation based hybrid drug screening procedure for identifying potential drug candidates targeting RdRp from 1906 market available drugs. Our screening have successfully identified a FDA-approved drug called Pralatrexate that strongly inhibits the replication of 2019-nCoV in vitro with EC50 values of 0.008μM. This work demonstrated the feasibility of accurate virtual drug screening for inhibitors of SARS-CoV-2 and provides potential therapeutic agents against COVID-19. [ABSTRACT FROM AUTHOR]

Individuals differ widely in their contribution to the spread of infection within and across populations. Three key epidemiological host traits affect infectious disease spread: susceptibility (propensity to acquire infection), infectivity (propensity to transmit infection to others) and recoverability (propensity to recover quickly). Interventions aiming to reduce disease spread may target improvement in any one of these traits, but the necessary statistical methods for obtaining risk estimates are lacking. In this paper we introduce a novel software tool called SIRE (standing for "Susceptibility, Infectivity and Recoverability Estimation"), which allows for the first time simultaneous estimation of the genetic effect of a single nucleotide polymorphism (SNP), as well as non-genetic influences on these three unobservable host traits. SIRE implements a flexible Bayesian algorithm which accommodates a wide range of disease surveillance data comprising any combination of recorded individual infection and/or recovery times, or disease diagnostic test results. Different genetic and non-genetic regulations and data scenarios (representing realistic recording schemes) were simulated to validate SIRE and to assess their impact on the precision, accuracy and bias of parameter estimates. This analysis revealed that with few exceptions, SIRE provides unbiased, accurate parameter estimates associated with all three host traits. For most scenarios, SNP effects associated with recoverability can be estimated with highest precision, followed by susceptibility. For infectivity, many epidemics with few individuals give substantially more statistical power to identify SNP effects than the reverse. Importantly, precise estimates of SNP and other effects could be obtained even in the case of incomplete, censored and relatively infrequent measurements of individuals' infection or survival status, albeit requiring more individuals to yield equivalent precision. SIRE represents a new tool for analysing a wide range of experimental and field disease data with the aim of discovering and validating SNPs and other factors controlling infectious disease transmission. Author summary: Effective approaches to reduce the spread of infectious disease transmission in populations are urgently needed. Reduction in disease spread is most effectively achieved by reducing, separately or in combination, individual (i) "susceptibility", i.e. the relative risk to become infected when exposed to infectious individuals or material, (ii) "infectivity", i.e. the propensity to transmit infection to others when infected, and/or by (iii) improving "recoverability", i.e. the propensity to recover. However, to date it is impossible to assess how these three key epidemiological traits controlling disease transmission in a population are regulated by specific genes or interventions, as the necessary statistical methods for estimating genetic and non-genetic effects associated with these three traits from available disease surveillance data don't exist. This paper introduces a novel statistical method that can estimate, for the first time, genetic and non-genetic effects for host susceptibility, infectivity and recoverability simultaneously from a wide range of realistic disease surveillance data. The method has been incorporated into a user-friendly, freely available software tool called SIRE. SIRE can be applied to a range of experimental and field data and will help to move disease control significantly forward by simultaneously targeting multiple host traits affecting infectious disease spread. [ABSTRACT FROM AUTHOR]

We are frequently faced with a large collection of antibodies, and want to select those with highest affinity for their cognate antigen. When developing a first-line therapeutic for a novel pathogen, for instance, we might look for such antibodies in patients that have recovered. There exist effective experimental methods of accomplishing this, such as cell sorting and baiting; however they are time consuming and expensive. Next generation sequencing of B cell receptor (BCR) repertoires offers an additional source of sequences that could be tapped if we had a reliable method of selecting those coding for the best antibodies. In this paper we introduce a method that uses evolutionary information from the family of related sequences that share a naive ancestor to predict the affinity of each resulting antibody for its antigen. When combined with information on the identity of the antigen, this method should provide a source of effective new antibodies. We also introduce a method for a related task: given an antibody of interest and its inferred ancestral lineage, which branches in the tree are likely to harbor key affinity-increasing mutations? We evaluate the performance of these methods on a wide variety of simulated samples, as well as two real data samples. These methods are implemented as part of continuing development of the partis BCR inference package, available at https://github.com/psathyrella/partis. Comments: Please post comments or questions on this paper as new issues at https://git.io/Jvxkn. Author summary: Antibodies form part of the adaptive immune response, and are critical to both naturally acquired immunity and vaccine response. Next generation sequencing of the B cell receptor (BCR) repertoire provides a broad and highly informative view of the DNA sequences from which antibodies arise. In many cases we would like to identify which of these BCR sequences correspond to antibodies with the highest affinity for a particular antigen. Existing experimental methods of selecting antibodies are effective, but time-consuming and expensive. In this paper we introduce new computational methods that use evolutionary information from the family of related BCR sequences to predict the affinity of each resulting antibody for its corresponding foreign antigen. When combined with information on the identity of this antigen (which we do not attempt to predict), these methods should provide a source of effective new antibodies that can then be experimentally synthesized and tested for function. [ABSTRACT FROM AUTHOR]

It has extensively been documented that human memory exhibits a wide range of systematic distortions, which have been associated with resource constraints. Resource constraints on memory can be formalised in the normative framework of lossy compression, however traditional lossy compression algorithms result in qualitatively different distortions to those found in experiments with humans. We argue that the form of distortions is characteristic of relying on a generative model adapted to the environment for compression. We show that this semantic compression framework can provide a unifying explanation of a wide variety of memory phenomena. We harness recent advances in learning deep generative models, that yield powerful tools to approximate generative models of complex data. We use three datasets, chess games, natural text, and hand-drawn sketches, to demonstrate the effects of semantic compression on memory performance. Our model accounts for memory distortions related to domain expertise, gist-based distortions, contextual effects, and delayed recall. Author summary: Human memory performs surprisingly poorly in many everyday tasks, which have been richly documented in laboratory experiments. While constraints on memory resources necessarily imply a loss of information, it is possible to do well or badly in relation to available memory resources. In this paper we recruit information theory, which establishes how to optimally lose information based on prior and complete knowledge of environmental statistics. For this, we address two challenges. 1, The environmental statistics is not known for the brain, rather these have to be learned over time from limited observations. 2, Information theory does not specify how different distortions of original experiences should be penalised. In this paper we tackle these challenges by assuming that a latent variable generative model of the environment is maintained in semantic memory. We show that compression of experiences through a generative model gives rise to systematic distortions that qualitatively correspond to a diverse range of observations in the experimental literature. [ABSTRACT FROM AUTHOR]

Dengue is an arbovirus affecting global populations. Frequent outbreaks occur, especially in equatorial cities such as Singapore, where year-round tropical climate, large daily influx of travelers and population density provide the ideal conditions for dengue to transmit. Little work has, however, quantified the peaks of dengue outbreaks, when health systems are likely to be most stretched. Nor have methods been developed to infer differences in exogenous factors which lead to the rise and fall of dengue case counts across extreme and non-extreme periods. In this paper, we developed time varying extreme mixture (tvEM) methods to account for the temporal dependence of dengue case counts across extreme and non-extreme periods. This approach permits inference of differences in climatic forcing across non-extreme and extreme periods of dengue case counts, quantification of their temporal dependence as well as estimation of thresholds with associated uncertainties to determine dengue case count extremities. Using tvEM, we found no evidence that weather affects dengue case counts in the near term for non-extreme periods, but that it has non-linear and mixed signals in influencing dengue through tvEM parameters in the extreme periods. Using the most appropriate tvEM specification, we found that a threshold at the 70th (95% credible interval 41.1, 83.8) quantile is optimal, with extreme events of 526.6, 1052.2 and 1183.6 weekly case counts expected at return periods of 5, 50 and 75 years. Weather parameters at a 1% scaled increase was found to decrease the long-run expected case counts, but larger increases would lead to a drastic expected rise from the baseline correspondingly. The tvEM approach can provide valuable inference on the extremes of time series, which in the case of infectious disease notifications, allows public health officials to understand the likely scale of outbreaks in the long run. Author summary: Dengue is an arbovirus affecting populations across much of the globe. Frequent outbreaks occur, especially in equatorial cities such as Singapore, where the year-round tropical climate, large daily influx of travelers and population density provide the ideal conditions for dengue transmission. Little work has however quantified the peaks of dengue outbreaks, when health systems are likely to be most stretched. Nor have methods been developed to infer differences in exogenous factors which lead to the rise and fall of dengue case counts across extreme and non extreme periods. In this paper, we developed time varying extreme mixture (tvEM) methods to account for the temporal dependence of dengue case counts across extreme and non-extreme periods. tvEM is able to infer differences in climatic forcing across non-extreme and extreme periods of dengue case counts, their temporal dependence as well as estimate suitable thresholds with associated uncertainties to determine dengue case count extremities. Using tvEM, we found no evidence that weather affects dengue case counts in the near term for non extreme periods, but has non-linear and mixed signals in influencing dengue through tvEM parameters in the extreme periods. Using the most appropriate tvEM specification, we found that a high percentile threshold is estimated, with dengue outbreak events far larger than currently observed to be expected in 5, 50 and 75 years. Weather parameters at a 1% scaled increase was found to decrease the long-run expected case counts, but larger increases would lead to a drastic expected rise from the baseline correspondingly. tvEM can provide valuable inference on the extremes of time series, which in the case of infectious disease data, allows public health officials to understand factors and the likely scale of infectious disease outbreaks in the long run. [ABSTRACT FROM AUTHOR]

Identification of mutations of the genes that give cancer a selective advantage is an important step towards research and clinical objectives. As such, there has been a growing interest in developing methods for identification of driver genes and their temporal order within a single patient (intra-tumor) as well as across a cohort of patients (inter-tumor). In this paper, we develop a probabilistic model for tumor progression, in which the driver genes are clustered into several ordered driver pathways. We develop an efficient inference algorithm that exhibits favorable scalability to the number of genes and samples compared to a previously introduced ILP-based method. Adopting a probabilistic approach also allows principled approaches to model selection and uncertainty quantification. Using a large set of experiments on synthetic datasets, we demonstrate our superior performance compared to the ILP-based method. We also analyze two biological datasets of colorectal and glioblastoma cancers. We emphasize that while the ILP-based method puts many seemingly passenger genes in the driver pathways, our algorithm keeps focused on truly driver genes and outputs more accurate models for cancer progression. Author summary: Cancer is a disease caused by the accumulation of somatic mutations in the genome. This process is mainly driven by mutations in certain genes that give the harboring cells some selective advantage. The rather few driver genes are usually masked amongst an abundance of so-called passenger mutations. Identification of the driver genes and the temporal order in which the mutations occur is of great importance towards research and clinical objectives. In this paper, we introduce a probabilistic model for cancer progression and devise an efficient inference algorithm to train the model. We show that our method scales favorably to large datasets and provides superior performance compared to an ILP-based counterpart on a wide set of synthetic data simulations. Our Bayesian approach also allows for systematic model selection and confidence quantification procedures in contrast to the previous non-probabilistic progression models. We also study two large datasets on colorectal and glioblastoma cancers and validate our inferred model in comparison to the ILP-based method. [ABSTRACT FROM AUTHOR]

During these days of global emergency for the COVID-19 disease outbreak, there is an urgency to share reliable information able to help worldwide life scientists to get better insights and make sense of the large amount of data currently available. In this study we used the results presented in [1] to perform two different Systems Biology analyses on the HCoV-host interactome. In the first one, we reconstructed the interactome of the HCoV-host proteins, integrating it with highly reliable miRNA and drug interactions information. We then added the IL-6 gene, identified in recent publications [2] as heavily involved in the COVID-19 progression and, interestingly, we identified several interactions with the reconstructed interactome. In the second analysis, we performed a Gene Ontology and a Pathways enrichment analysis on the full set of the HCoV-host interactome proteins and on the ones belonging to a significantly dense cluster of interacting proteins identified in the first analysis. Results of the two analyses provide a compact but comprehensive glance on some of the current state-of-the-art regulations, GO, and pathways involved in the HCoV-host interactome, and that could support all scientists currently focusing on SARS-CoV-2 research. Author summary: In this paper we provide data about the HCoV-host interactome that can be extracted from the integration of several public available databases. We used the initial interactome published by Zhou et al. and analyzed if there are already known and validated interactions. We also looked into possible known miRNAs and drugs interactions to suggest possible biomarker candidates and treatment options. We also performed a Gene Ontology and a Pathways enrichment analysis to understand which are the pathways most likely involved in the proteins targeted by SARS-CoV-2. This paper not only provides a set of validated and reliable data that could help researchers in their fight against the COVID-19 disease outbreak, but also demonstrates how Systems Biology can be effectively used to quickly gather preliminary but still significant data without resorting only to expensive lab experiments. [ABSTRACT FROM AUTHOR]

The human body generates a diverse set of high affinity antibodies, the soluble form of B cell receptors (BCRs), that bind to and neutralize invading pathogens. The natural development of BCRs must be understood in order to design vaccines for highly mutable pathogens such as influenza and HIV. BCR diversity is induced by naturally occurring combinatorial "V(D)J" rearrangement, mutation, and selection processes. Most current methods for BCR sequence analysis focus on separately modeling the above processes. Statistical phylogenetic methods are often used to model the mutational dynamics of BCR sequence data, but these techniques do not consider all the complexities associated with B cell diversification such as the V(D)J rearrangement process. In particular, standard phylogenetic approaches assume the DNA bases of the progenitor (or "naive") sequence arise independently and according to the same distribution, ignoring the complexities of V(D)J rearrangement. In this paper, we introduce a novel approach to Bayesian phylogenetic inference for BCR sequences that is based on a phylogenetic hidden Markov model (phylo-HMM). This technique not only integrates a naive rearrangement model with a phylogenetic model for BCR sequence evolution but also naturally accounts for uncertainty in all unobserved variables, including the phylogenetic tree, via posterior distribution sampling. Author summary: Rational vaccine design efforts depend on accurate inference of full evolutionary paths from a given naive sequence to the corresponding mature B cell receptor sequences in a germinal center. Before one can perform ancestral sequence inference for clonal sequences that result from the same naive rearrangement event, one must first obtain an estimate of the clonal phylogenetic tree. Currently, standard phylogenetic inference techniques are used to model the process of sequence evolution along the tree; however, these methods do not account for all the complexities associated with this evolutionary process. In this paper, we propose a Bayesian approach to phylogenetic inference for clonal sequences that is based on a phylogenetic hidden Markov model. Our phylo-HMM models both the naive rearrangement and somatic hypermutation processes and this Bayesian framework allows us to naturally account for uncertainty in all unobserved variables, including a phylogenetic tree, via posterior distribution sampling. We perform simulation-based experiments to show that naive sequence and phylogenetic inference performed jointly provides higher-quality estimates than those obtained by considering these inferences separately. Our application to real data reveals significant uncertainty in naive and ancestral sequences, confirming the importance of a Bayesian approach. [ABSTRACT FROM AUTHOR]

Inference of admixture proportions is a classical statistical problem in population genetics. Standard methods implicitly assume that both parents of an individual have the same admixture fraction. However, this is rarely the case in real data. In this paper we show that the distribution of admixture tract lengths in a genome contains information about the admixture proportions of the ancestors of an individual. We develop a Hidden Markov Model (HMM) framework for estimating the admixture proportions of the immediate ancestors of an individual, i.e. a type of decomposition of an individual's admixture proportions into further subsets of ancestral proportions in the ancestors. Based on a genealogical model for admixture tracts, we develop an efficient algorithm for computing the sampling probability of the genome from a single individual, as a function of the admixture proportions of the ancestors of this individual. This allows us to perform probabilistic inference of admixture proportions of ancestors only using the genome of an extant individual. We perform extensive simulations to quantify the error in the estimation of ancestral admixture proportions under various conditions. To illustrate the utility of the method, we apply it to real genetic data. Author summary: Ancestry inference is an important problem in genetics and is used commercially by a number of companies affecting millions of consumers of genetic ancestry tests. In this paper, we show that it is possible, not only to estimate the ancestry fractions of an individual, but also, with some uncertainty, to estimate the ancestry fractions of an individual's recent ancestors. For example, if an individual traces his/her ancestry 50% to Asia and 50% to Europe, it is possible to distinguish between the individual having two parents that each are 50:50 composites of Asian and European ancestry, or one parent from Asia and one from Europe. It is likewise also possible to make inferences about grandparents. We present a computationally efficient method for making such inferences called PedMix. PedMix is based on a probabilistic model for the descendant and the recent ancestors. PedMix infers admixture proportions of recent ancestors (parents, grandparents or even great grandparents) using whole-genome genetic variation data from a focal individual. Results on both simulated and real data show that PedMix performs reasonably well in most scenarios. [ABSTRACT FROM AUTHOR]

We consider how a signalling system can act as an information hub by multiplexing information arising from multiple signals. We formally define multiplexing, mathematically characterise which systems can multiplex and how well they can do it. While the results of this paper are theoretical, to motivate the idea of multiplexing, we provide experimental evidence that tentatively suggests that the NF-κB transcription factor can multiplex information about changes in multiple signals. We believe that our theoretical results may resolve the apparent paradox of how a system like NF-κB that regulates cell fate and inflammatory signalling in response to diverse stimuli can appear to have the low information carrying capacity suggested by recent studies on scalar signals. In carrying out our study, we introduce new methods for the analysis of large, nonlinear stochastic dynamic models, and develop computational algorithms that facilitate the calculation of fundamental constructs of information theory such as Kullback–Leibler divergences and sensitivity matrices, and link these methods to new theory about multiplexing information. We show that many current models such as those of the NF-κB system cannot multiplex effectively and provide models that overcome this limitation using post-transcriptional modifications. Author summary: Cells use signalling systems to pass on information arising from their ever-changing environment to their processing units. These biochemical networks regulate the transmission of multiple signals within the noisy and complex cellular environment, controlling whether to turn on or off processes of cell defence, death, division, and others. The question of how they actually achieve that becomes particularly critical given that many diseases occur when signalling systems malfunction. In this paper, we develop methodology and computational tools for simulating, measuring and analysing the ability of signalling systems to transmit multi-dimensional signals. We specifically focus on the capacity of signalling systems to simultaneously transmit multiple signals, such as temperature changes, presence and concentration of cytokines, viral and bacterial pathogens or drugs, through a single noisy, dynamic signalling system. We argue that a signalling system can act as an information hub, sending information in a multiplexed fashion rather similar to the way in which telecommunications networks send multiple signals over a shared medium by combining them into one. [ABSTRACT FROM AUTHOR]

Cortical circuits process information by rich recurrent interactions between excitatory neurons and inhibitory interneurons. One of the prime functions of interneurons is to stabilize the circuit by feedback inhibition, but the level of specificity on which inhibitory feedback operates is not fully resolved. We hypothesized that inhibitory circuits could enable separate feedback control loops for different synaptic input streams, by means of specific feedback inhibition to different neuronal compartments. To investigate this hypothesis, we adopted an optimization approach. Leveraging recent advances in training spiking network models, we optimized the connectivity and short-term plasticity of interneuron circuits for compartment-specific feedback inhibition onto pyramidal neurons. Over the course of the optimization, the interneurons diversified into two classes that resembled parvalbumin (PV) and somatostatin (SST) expressing interneurons. Using simulations and mathematical analyses, we show that the resulting circuit can be understood as a neural decoder that inverts the nonlinear biophysical computations performed within the pyramidal cells. Our model provides a proof of concept for studying structure-function relations in cortical circuits by a combination of gradient-based optimization and biologically plausible phenomenological models. Author summary: The brain contains billions of nerve cells—neurons—that can be classified into different types depending on their shape, connectivity and activity. A particularly diverse group of neurons is that of inhibitory neurons, named after their suppressive effect on neural activity. Presumably, their diverse properties allow inhibitory neurons to fulfil different functions, but what these functions are is currently unclear. In this paper, we investigated if a particular function can explain the existence and properties of the two most common inhibitory cell classes: The need to regulate activity in different physical parts (compartments) of the neurons they target. We investigated this function in a computer model, using optimization to find the neuron properties best-suited for compartment-specific inhibition. Our key result is that after the optimization, model neurons largely fell into two classes that resembled the two types of biological neurons. In particular, the optimized neurons were connected to only one compartment of other neurons. This suggests that the diversity of inhibitory neurons is well suited for compartment-specific inhibition. In the future, our approach of optimizing neural properties might be used to investigate other functions (or dysfunctions) of neuron diversity. [ABSTRACT FROM AUTHOR]

Machine learning-based classification approaches are widely used to predict host phenotypes from microbiome data. Classifiers are typically employed by considering operational taxonomic units or relative abundance profiles as input features. Such types of data are intrinsically sparse, which opens the opportunity to make predictions from the presence/absence rather than the relative abundance of microbial taxa. This also poses the question whether it is the presence rather than the abundance of particular taxa to be relevant for discrimination purposes, an aspect that has been so far overlooked in the literature. In this paper, we aim at filling this gap by performing a meta-analysis on 4,128 publicly available metagenomes associated with multiple case-control studies. At species-level taxonomic resolution, we show that it is the presence rather than the relative abundance of specific microbial taxa to be important when building classification models. Such findings are robust to the choice of the classifier and confirmed by statistical tests applied to identifying differentially abundant/present taxa. Results are further confirmed at coarser taxonomic resolutions and validated on 4,026 additional 16S rRNA samples coming from 30 public case-control studies. Author summary: The composition of the human microbiome has been linked to a large number of different diseases. In this context, classification methodologies based on machine learning approaches have represented a promising tool for diagnostic purposes from metagenomics data. The link between microbial population composition and host phenotypes has been usually performed by considering taxonomic profiles represented by relative abundances of microbial species. In this study, we show that it is more the presence rather than the relative abundance of microbial taxa to be relevant to maximize classification accuracy. This is accomplished by conducting a meta-analysis on more than 4,000 shotgun metagenomes coming from 25 case-control studies and in which original relative abundance data are degraded to presence/absence profiles. Findings are also extended to 16S rRNA data and advance the research field in building prediction models directly from human microbiome data. [ABSTRACT FROM AUTHOR]

The design of vaccines against highly mutable pathogens, such as HIV and influenza, requires a detailed understanding of how the adaptive immune system responds to encountering multiple variant antigens (Ags). Here, we describe a multiscale model of B cell receptor (BCR) affinity maturation that employs actual BCR nucleotide sequences and treats BCR/Ag interactions in atomistic detail. We apply the model to simulate the maturation of a broadly neutralizing Ab (bnAb) against HIV. Starting from a germline precursor sequence of the VRC01 anti-HIV Ab, we simulate BCR evolution in response to different vaccination protocols and different Ags, which were previously designed by us. The simulation results provide qualitative guidelines for future vaccine design and reveal unique insights into bnAb evolution against the CD4 binding site of HIV. Our model makes possible direct comparisons of simulated BCR populations with results of deep sequencing data, which will be explored in future applications. Author summary: Vaccination has saved more lives than any other medical procedure. But, we do not have robust ways to develop vaccines against highly mutable pathogens. For example, there is no effective vaccine against HIV, and a universal vaccine against diverse strains of influenza is also not available. The development of immunization strategies to elicit antibodies that can neutralize diverse strains of highly mutable pathogens (so-called 'broadly neutralizing antibodies', or bnAbs) would enable the design of universal vaccines against such pathogens, as well as other viruses that may emerge in the future. In this paper, we present an agent-based model of affinity maturation–the Darwinian process by which antibodies evolve against a pathogen–that, for the first time, enables the in silico investigation of real germline nucleotide sequences of antibodies known to evolve into potent bnAbs, evolving against real amino acid sequences of HIV-based vaccine-candidate proteins. Our results provide new insights into bnAb evolution against HIV, and can be used to qualitatively guide the future design of vaccines against highly mutable pathogens. [ABSTRACT FROM AUTHOR]

Segmenting three-dimensional (3D) microscopy images is essential for understanding phenomena like morphogenesis, cell division, cellular growth, and genetic expression patterns. Recently, deep learning (DL) pipelines have been developed, which claim to provide high accuracy segmentation of cellular images and are increasingly considered as the state of the art for image segmentation problems. However, it remains difficult to define their relative performances as the concurrent diversity and lack of uniform evaluation strategies makes it difficult to know how their results compare. In this paper, we first made an inventory of the available DL methods for 3D cell segmentation. We next implemented and quantitatively compared a number of representative DL pipelines, alongside a highly efficient non-DL method named MARS. The DL methods were trained on a common dataset of 3D cellular confocal microscopy images. Their segmentation accuracies were also tested in the presence of different image artifacts. A specific method for segmentation quality evaluation was adopted, which isolates segmentation errors due to under- or oversegmentation. This is complemented with a 3D visualization strategy for interactive exploration of segmentation quality. Our analysis shows that the DL pipelines have different levels of accuracy. Two of them, which are end-to-end 3D and were originally designed for cell boundary detection, show high performance and offer clear advantages in terms of adaptability to new data. Author summary: In recent years, a number of deep learning (DL) algorithms based on computational neural networks have been developed, which claim to achieve high accuracy and automatic segmentation of three-dimensional (3D) microscopy images. Although these algorithms have received considerable attention in the literature, it is difficult to evaluate their relative performances, while it remains unclear whether they really perform better than other, more classical segmentation methods. To clarify these issues, we performed a detailed, quantitative analysis of a number of representative DL pipelines for cell instance segmentation from 3D confocal microscopy image datasets. We developed a protocol for benchmarking the performances of such DL-based segmentation pipelines using common training and test datasets, evaluation metrics, and visualizations. Using this protocol, we evaluated and compared 4 different DL pipelines to identify their strengths and limitations. A high performance non-DL method was also included in the evaluation. We show that DL pipelines may show significant differences in their performances depending on their model architecture and pipeline components but overall show excellent adaptability to unseen data. We also show that our benchmarking protocol could be extended to a variety of segmentation pipelines and datasets. [ABSTRACT FROM AUTHOR]

Microfluidic capacities for both recreating and monitoring cell cultures have opened the door to the use of Data Science and Machine Learning tools for understanding and simulating tumor evolution under controlled conditions. In this work, we show how these techniques could be applied to study Glioblastoma, the deadliest and most frequent primary brain tumor. In particular, we study Glioblastoma invasion using the recent concept of Physically-Guided Neural Networks with Internal Variables (PGNNIV), able to combine data obtained from microfluidic devices and some physical knowledge governing the tumor evolution. The physics is introduced by means of nonlinear advection-diffusion-reaction partial differential equation that models the Glioblastoma evolution for defining the network structure. On the other hand, multilayer perceptrons combined with a nodal deconvolution technique are used for learning the go or grow metabolic behavior which characterises the Glioblastoma invasion. The PGNNIV is here trained using synthetic data obtained from in silico tests created under different oxygenation conditions, using a previously validated model. The unravelling capacity of PGNNIV enables discovering complex metabolic processes in a non-parametric way, thus giving explanatory capacity to the networks, and, as a consequence, surpassing the predictive power of any parametric approach and for any kind of stimulus. Besides, the possibility of working, for a particular tumor, with different boundary and initial conditions, permits the use of PGNNIV for defining virtual therapies and for drug design, thus making the first steps towards in silico personalised medicine. Author summary: In this work, we apply Physically-Guided Neural Networks with Internal Variables (PGNNIV) to the understanding of the Glioblastoma evolution process. We explain the metabolic changes between the proliferative and migrative activity of Glioblastoma cell cultures by using the go or grow activation functions as a pair of internal variables, whose dependence on the oxygen level is unravelled by some building blocks of the whole PGNNIV. Due to its model-free nature, our method is able to identify different classical mechanistic approaches and to outperform cell culture evolution predictions, as we demonstrate in the paper. Unlike Biologically-Informed Neural Networks we can assimilate data obtained from different boundary conditions and under different external stimuli to simulate the tumor progression under arbitrary conditions. We demonstrate this ability by comparing the predictions with different boundary conditions, resulting in different oxygenation conditions. This flexibility enables the use of our proposed method for personalised medical purposes, as the cell culture metabolic information, for a particular tumor, is encapsulated in a sub-network and may be used for arbitrary in silico tests. [ABSTRACT FROM AUTHOR]

We present a spatial model describing the growth of a photosynthetic microalgae biofilm. In this 2D-model we consider photosynthesis, cell carbon accumulation, extracellular matrix excretion, and mortality. The rate of each of these mechanisms is given by kinetic laws regulated by light, nitrate, oxygen and inorganic carbon. The model is based on mixture theory and the behaviour of each component is defined on one hand by mass conservation, which takes into account biological features of the system, and on the other hand by conservation of momentum, which expresses the physical properties of the components. The model simulates the biofilm structural dynamics following an initial colonization phase. It shows that a 75 μm thick active region drives the biofilm development. We then determine the optimal harvesting period and biofilm height which maximize productivity. Finally, different harvesting patterns are tested and their effect on biofilm structure are discussed. The optimal strategy differs whether the objective is to recover the total biofilm or just the algal biomass. Author summary: Microalgae have many industrial applications, ranging from aquaculture, pharmaceutics, food industry to green energy. Planktonic cultivation of microalgae is energy-consuming. Growing them under a biofilm form is a new trend with attracting promises. Biofilms are complex heterogeneous ecosystems composed of microorganisms embedded within a self-produced extracellular matrix and stuck to a surface. Most of the studies have focused on bacterial biofilms and knowledge about microalgae biofilms is still very limited. In this paper, we propose a mathematical model describing microalgae biofilm development. We simulate in 1D and 2D the impact of harvesting conditions on biofilm productivity. In agreement with available experimental observations, we find that there exist optimal frequencies and patterns that optimize the productivity. We also show that the optimal conditions differ whether for maximizing the productivity of microalgae or of the whole biofilm. [ABSTRACT FROM AUTHOR]

In other words, the model may produce nice results for some parameter combinations but reporting this is not enough; modelling papers need to report the circumstances under which the model works and the circumstances under which it stops making sense - where it breaks down. In other words, when it comes to the comparison of relevant model outputs with data, finding one model that generates data consistent with what is observed does not mean that it is the unique causal model. So, in order to comprehensively explore the space of possible outcomes, then, the model needs to be run a large number of times to fully capture the effects of the model parameters as well as stochasticity (another good reason for efficient model code; see Rule 6). A good and often cited example of this kind of model is Ptolemy's model of planetary motion [[7]], which described the movements of the planets, and could be used to predict the behaviour of the solar system. [Extracted from the article]

Several important aspects related to SARS-CoV-2 transmission are not well known due to a lack of appropriate data. However, mathematical and computational tools can be used to extract part of this information from the available data, like some hidden age-related characteristics. In this paper, we present a method to investigate age-specific differences in transmission parameters related to susceptibility to and infectiousness upon contracting SARS-CoV-2 infection. More specifically, we use panel-based social contact data from diary-based surveys conducted in Belgium combined with the next generation principle to infer the relative incidence and we compare this to real-life incidence data. Comparing these two allows for the estimation of age-specific transmission parameters. Our analysis implies the susceptibility in children to be around half of the susceptibility in adults, and even lower for very young children (preschooler). However, the probability of adults and the elderly to contract the infection is decreasing throughout the vaccination campaign, thereby modifying the picture over time. Author summary: Basic transmission dynamic characteristics of SARS-CoV-2, such as the probability of acquiring infection when exposed ("susceptibility"), and the probability of transmitting infection when infected ("infectiousness") may be age-dependent. We present a computational method to estimate these age-specific characteristics using Belgian social contact and surveillance data. We found that children are less susceptible to infection than adults, with the former experiencing 20% to 50% of the susceptibility in adults, while the infectiousness is more difficult to discern. The force of infection (probability of acquiring infection per unit time) decreases over time for the oldest age groups first, following the roll-out of the vaccination campaign which targeted the elderly first. [ABSTRACT FROM AUTHOR]

Protein structure alignment algorithms are often time-consuming, resulting in challenges for large-scale protein structure similarity-based retrieval. There is an urgent need for more efficient structure comparison approaches as the number of protein structures increases rapidly. In this paper, we propose an effective graph-based protein structure representation learning method, GraSR, for fast and accurate structure comparison. In GraSR, a graph is constructed based on the intra-residue distance derived from the tertiary structure. Then, deep graph neural networks (GNNs) with a short-cut connection learn graph representations of the tertiary structures under a contrastive learning framework. To further improve GraSR, a novel dynamic training data partition strategy and length-scaling cosine distance are introduced. We objectively evaluate our method GraSR on SCOPe v2.07 and a new released independent test set from PDB database with a designed comprehensive performance metric. Compared with other state-of-the-art methods, GraSR achieves about 7%-10% improvement on two benchmark datasets. GraSR is also much faster than alignment-based methods. We dig into the model and observe that the superiority of GraSR is mainly brought by the learned discriminative residue-level and global descriptors. The web-server and source code of GraSR are freely available at www.csbio.sjtu.edu.cn/bioinf/GraSR/ for academic use. Author summary: The size and shape of protein structures vary considerably. Accurate protein structure comparison usually relies on structure alignment algorithms. However, superimposing two protein structures is relatively time-consuming, which makes it inappropriate for large-scale protein structure retrieval. Alignment-free algorithms are proposed for efficient protein structure comparison over the last few decades. These algorithms first transform the coordinates of atoms in two proteins to fixed-length vectors. Then, the comparison can be done by measuring the distance or similarity between two vectors, which is much faster than alignment. In this study, we propose a novel protein structure representation method for efficient structure comparison. Compared with other state-of-the-art alignment-free methods, our method achieves better performance on both ranking and multi-class classification tasks due to the powerful representation ability of deep graph neural networks. We dig into the model and observe that the superiority of our method is mainly brought by the learned discriminative residue-level and global descriptors. [ABSTRACT FROM AUTHOR]

Although chemotherapy is a standard treatment for cancer, it comes with significant side effects. In particular, certain agents can induce severe muscle loss, known as cachexia, worsening patient quality of life and treatment outcomes. 5-fluorouracil, an anti-cancer agent used to treat several cancers, has been shown to cause muscle loss. Experimental data indicates a non-linear dose-dependence for muscle loss in mice treated with daily or week-day schedules. We present a mathematical model of chemotherapy-induced muscle wasting that captures this non-linear dose-dependence. Area-under-the-curve metrics are proposed to quantify the treatment's effects on lean mass and tumour control. Model simulations are used to explore alternate dosing schedules, aging effects, and morphine use in chemotherapy treatment with the aim of better protecting lean mass while actively targeting the tumour, ultimately leading to improved personalization of treatment planning and improved patient quality of life. Author summary: In this paper we present a novel mathematical model for muscle loss due to cancer chemotherapy treatment. Loss of muscle mass relates to increased drug toxicity and side-effects, and to decreased patient quality of life and survival rates. With our model, we examine the therapeutic efficacy of various dosing schedules with the aim of controlling a growing tumour while also preserving lean mass. Preservation of body composition, in addition to consideration of inflammation and immune interactions, the gut microbiome, and other systemic health measures, may lead to improved patient-specific treatment plans that improve patient quality of life. [ABSTRACT FROM AUTHOR]

Understanding and characterising biochemical processes inside single cells requires experimental platforms that allow one to perturb and observe the dynamics of such processes as well as computational methods to build and parameterise models from the collected data. Recent progress with experimental platforms and optogenetics has made it possible to expose each cell in an experiment to an individualised input and automatically record cellular responses over days with fine time resolution. However, methods to infer parameters of stochastic kinetic models from single-cell longitudinal data have generally been developed under the assumption that experimental data is sparse and that responses of cells to at most a few different input perturbations can be observed. Here, we investigate and compare different approaches for calculating parameter likelihoods of single-cell longitudinal data based on approximations of the chemical master equation (CME) with a particular focus on coupling the linear noise approximation (LNA) or moment closure methods to a Kalman filter. We show that, as long as cells are measured sufficiently frequently, coupling the LNA to a Kalman filter allows one to accurately approximate likelihoods and to infer model parameters from data even in cases where the LNA provides poor approximations of the CME. Furthermore, the computational cost of filtering-based iterative likelihood evaluation scales advantageously in the number of measurement times and different input perturbations and is thus ideally suited for data obtained from modern experimental platforms. To demonstrate the practical usefulness of these results, we perform an experiment in which single cells, equipped with an optogenetic gene expression system, are exposed to various different light-input sequences and measured at several hundred time points and use parameter inference based on iterative likelihood evaluation to parameterise a stochastic model of the system. Author summary: A common result for the modelling of cellular processes is that available data is not sufficiently rich to uniquely determine the biological mechanism or even just to ensure identifiability of parameters of a given model. Perturbing cellular processes with informative input stimuli and measuring dynamical responses may alleviate this problem. With the development of novel experimental platforms, we are now in a position to parallelise such perturbation experiments at the single cell level. This raises a plethora of new questions. Is it more informative to diversify input perturbations but to observe only few cells for each input or should we rather ensure that many cells are observed for only few inputs? How can we calculate likelihoods and infer parameters of stochastic kinetic models from data sets in which each cell receives a different input perturbation? How does the computational efficiency of parameter inference methods scale with the number of inputs and the number of measurement times? Are there approaches that are particularly well-suited for such data sets? In this paper, we investigate these questions using the CcaS/CcaR optogenetic system driving the expression of a fluorescent reporter protein as primary case study. [ABSTRACT FROM AUTHOR]

Circadian rhythms in a wide range of organisms are mediated by molecular mechanisms based on transcription-translation feedback. In this paper, we use bifurcation theory to explore mathematical models of genetic oscillators, based on Kim & Forger's interpretation of the circadian clock in mammals. At the core of their models is a negative feedback loop whereby PER proteins (PER1 and PER2) bind to and inhibit their transcriptional activator, BMAL1. For oscillations to occur, the dissociation constant of the PER:BMAL1 complex, K^d , must be ≤ 0.04 nM, which is orders of magnitude smaller than a reasonable expectation of 1–10 nM for this protein complex. We relax this constraint by two modifications to Kim & Forger's 'single negative feedback' (SNF) model: first, by introducing a multistep reaction chain for posttranscriptional modifications of Per mRNA and posttranslational phosphorylations of PER, and second, by replacing the first-order rate law for degradation of PER in the nucleus by a Michaelis-Menten rate law. These modifications increase the maximum allowable K^d to ~2 nM. In a third modification, we consider an alternative rate law for gene transcription to resolve an unrealistically large rate of Per2 transcription at very low concentrations of BMAL1. Additionally, we studied extensions of the SNF model to include a second negative feedback loop (involving REV-ERB) and a supplementary positive feedback loop (involving ROR). Contrary to Kim & Forger's observations of these extended models, we find that, with our modifications, the supplementary positive feedback loop makes the oscillations more robust than observed in the models with one or two negative feedback loops. However, all three models are similarly robust when accounting for circadian rhythms (~24 h period) with K^d ≥ 1 nM. Our results provide testable predictions for future experimental studies. Author summary: The circadian rhythm aligns bodily functions to the day/night cycle and is important for our health. The rhythm originates from an intracellular molecular clock mechanism that mediates rhythmic gene expression. It is long understood that transcriptional negative feedback with sufficient time delay is key to generating circadian oscillations. However, some of the most widely cited mathematical models for the circadian clock suffer from problems of parameter 'fragilities'. That is, sustained oscillations are possible only for physically unrealistic parameter values. A recent model by Kim & Forger nicely incorporates the inhibitory binding of PER proteins to their transcription activator BMAL1, but oscillations in the Kim-Forger model require a binding affinity between PER and BMAL1 that is orders of magnitude larger than observed binding affinities of protein complexes. To rectify this problem, we make several physiologically credible modifications to the Kim-Forger model, which allow oscillations to occur with more realistic binding affinities. The modified model is further extended to explore the potential roles of supplementary feedback loops in the mammalian clock mechanism. Ultimately, accurate models of the circadian clock will provide better predictive tools for chronotherapy and chrono-pharmacology studies. [ABSTRACT FROM AUTHOR]

Transcription factors (TFs) play an important role in regulating gene expression, thus the identification of the sites bound by them has become a fundamental step for molecular and cellular biology. In this paper, we developed a deep learning framework leveraging existing fully convolutional neural networks (FCN) to predict TF-DNA binding signals at the base-resolution level (named as FCNsignal). The proposed FCNsignal can simultaneously achieve the following tasks: (i) modeling the base-resolution signals of binding regions; (ii) discriminating binding or non-binding regions; (iii) locating TF-DNA binding regions; (iv) predicting binding motifs. Besides, FCNsignal can also be used to predict opening regions across the whole genome. The experimental results on 53 TF ChIP-seq datasets and 6 chromatin accessibility ATAC-seq datasets show that our proposed framework outperforms some existing state-of-the-art methods. In addition, we explored to use the trained FCNsignal to locate all potential TF-DNA binding regions on a whole chromosome and predict DNA sequences of arbitrary length, and the results show that our framework can find most of the known binding regions and accept sequences of arbitrary length. Furthermore, we demonstrated the potential ability of our framework in discovering causal disease-associated single-nucleotide polymorphisms (SNPs) through a series of experiments. Author summary: Identification of transcription factor binding sites (TFBSs) is fundamental to study gene regulatory networks in biological systems, as TFs activate or suppress the transcription of genes by binding to specific TFBSs. With the development of high-throughput sequencing technologies and deep learning (DL), several DL-based approaches have been developed for systematically studying TFBSs, achieving impressive performance. Nevertheless, these methods either excessively focus on discriminating binding or non-binding sequences or individually accomplish multiple TFBSs-associated tasks. In this work, we provide an integrated framework, which utilizes the FCN architecture to predict TF-DNA binding signals at the base-resolution level, to simultaneously study multiple TFBSs-associated tasks. More importantly, we also demonstrate that our proposed framework has the ability to locate all potential TF-DNA binding regions from DNA sequences of arbitrary length. We hope that our framework can provide a new perspective on studying the mechanism of TF-DNA binding and its related tasks. [ABSTRACT FROM AUTHOR]

Tick paralysis resulting from bites from Ixodes holocyclus and I. cornuatus is one of the leading causes of emergency veterinary admissions for companion animals in Australia, often resulting in death if left untreated. Availability of timely information on periods of increased risk can help modulate behaviors that reduce exposures to ticks and improve awareness of owners for the need of lifesaving preventative ectoparasite treatment. Improved awareness of clinicians and pet owners about temporal changes in tick paralysis risk can be assisted by ecological forecasting frameworks that integrate environmental information into statistical time series models. Using an 11-year time series of tick paralysis cases from veterinary clinics in one of Australia's hotspots for the paralysis tick Ixodes holocyclus, we asked whether an ensemble model could accurately forecast clinical caseloads over near-term horizons. We fit a series of statistical time series (ARIMA, GARCH) and generative models (Prophet, Generalised Additive Model) using environmental variables as predictors, and then combined forecasts into a weighted ensemble to minimise prediction interval error. Our results indicate that variables related to temperature anomalies, levels of vegetation moisture and the Southern Oscillation Index can be useful for predicting tick paralysis admissions. Our model forecasted tick paralysis cases with exceptional accuracy while preserving epidemiological interpretability, outperforming a field-leading benchmark Exponential Smoothing model by reducing both point and prediction interval errors. Using online particle filtering to assimilate new observations and adjust forecast distributions when new data became available, our model adapted to changing temporal conditions and provided further reduced forecast errors. We expect our model pipeline to act as a platform for developing early warning systems that can notify clinicians and pet owners about heightened risks of environmentally driven veterinary conditions. Author summary: Tick-borne illnesses constitute a diverse group of debilitating conditions for pet dogs and cats around the world. In Australia, thousands of domestic dogs are admitted to emergency veterinary clinics due to tick paralysis each year. These admissions are highly seasonal and may be associated with changing environmental conditions, suggesting models that learn from environmental patterns to forecast the oncoming tick season could inform pet owners and clinicians about changing risks. In this paper we use a series of statistical forecasting models to analyse and predict tick paralysis admissions to veterinary clinics in a tick paralysis hotspot in Queensland, Australia. Our approach is novel in that we combine individual models into a superior ensemble that is trained to reduce forecast uncertainty, giving more accurate estimates of what the coming tick season will look like. Our model consistently outperforms a field-leading benchmark while uncovering important patterns about environmental drivers of paralysis tick exposure, including changes to levels of moist vegetation and maximum temperature. We also demonstrate how our model can be used to automatically produce forecasts of tick paralysis admissions as new data become available. This can have important implications for designing improved early warning systems for tick-borne illness. [ABSTRACT FROM AUTHOR]

Successful navigation requires the ability to compute one's location and heading from incoming multisensory information. Previous work has shown that this multisensory input comes in two forms: body-based idiothetic cues, from one's own rotations and translations, and visual allothetic cues, from the environment (usually visual landmarks). However, exactly how these two streams of information are integrated is unclear, with some models suggesting the body-based idiothetic and visual allothetic cues are combined, while others suggest they compete. In this paper we investigated the integration of body-based idiothetic and visual allothetic cues in the computation of heading using virtual reality. In our experiment, participants performed a series of body turns of up to 360 degrees in the dark with only a brief flash (300ms) of visual feedback en route. Because the environment was virtual, we had full control over the visual feedback and were able to vary the offset between this feedback and the true heading angle. By measuring the effect of the feedback offset on the angle participants turned, we were able to determine the extent to which they incorporated visual feedback as a function of the offset error. By further modeling this behavior we were able to quantify the computations people used. While there were considerable individual differences in performance on our task, with some participants mostly ignoring the visual feedback and others relying on it almost entirely, our modeling results suggest that almost all participants used the same strategy in which idiothetic and allothetic cues are combined when the mismatch between them is small, but compete when the mismatch is large. These findings suggest that participants update their estimate of heading using a hybrid strategy that mixes the combination and competition of cues. Author summary: Successful navigation requires us to combine visual information about our environment with body-based cues about our own rotations and translations. In this work we investigated how these disparate sources of information work together to compute an estimate of heading. Using a novel virtual reality task we measured how humans integrate visual and body-based cues when there is mismatch between them—that is, when the estimate of heading from visual information is different from body-based cues. By building computational models of different strategies, we reveal that humans use a hybrid strategy for integrating visual and body-based cues—combining them when the mismatch between them is small and picking one or the other when the mismatch is large. [ABSTRACT FROM AUTHOR]

The ability to aggregate experimental data analysis and results into a concise and interpretable format is a key step in evaluating the success of an experiment. This critical step determines baselines for reproducibility and is a key requirement for data dissemination. However, in practice it can be difficult to consolidate data analyses that encapsulates the broad range of datatypes available in the life sciences. We present STENCIL, a web templating engine designed to organize, visualize, and enable the sharing of interactive data visualizations. STENCIL leverages a flexible web framework for creating templates to render highly customizable visual front ends. This flexibility enables researchers to render small or large sets of experimental outcomes, producing high-quality downloadable and editable figures that retain their original relationship to the source data. REST API based back ends provide programmatic data access and supports easy data sharing. STENCIL is a lightweight tool that can stream data from Galaxy, a popular bioinformatic analysis web platform. STENCIL has been used to support the analysis and dissemination of two large scale genomic projects containing the complete data analysis for over 2,400 distinct datasets. Code and implementation details are available on GitHub: https://github.com/CEGRcode/stencil Author summary: Efficient and scalable data visualization of analysis is a critical bottleneck in biological discovery within life sciences. The exponential growth of genomic projects, which can now generate thousands of unique datasets in a single paper, have produced organizational and logistical difficulties for biochemists and bioinformaticians. To address these challenges, we developed the STENCIL web platform to incorporate principles of project management with a strong emphasis on data reproducibility and FAIR data practices. We architected STENCIL to operate on minimal system requirements (i.e., 1 CPU, 8Gb RAM) while seamlessly organizing thousands of unique samples in an intuitive interface for data discovery. Data reproducibility is provided by the well-proven Galaxy bioinformatic web platform. The utility of the STENCIL platform has been demonstrated in two prior publications to date. Its capabilities have now been dramatically expanded to provide native support for Galaxy integration, Federated login, local hosting, custom domain usage, and improved security protocols for analyzing controlled de-identified biomedical patient data. [ABSTRACT FROM AUTHOR]

Computational drug repositioning and drug-target prediction have become essential tasks in the early stage of drug discovery. In previous studies, these two tasks have often been considered separately. However, the entities studied in these two tasks (i.e., drugs, targets, and diseases) are inherently related. On one hand, drugs interact with targets in cells to modulate target activities, which in turn alter biological pathways to promote healthy functions and to treat diseases. On the other hand, both drug repositioning and drug-target prediction involve the same drug feature space, which naturally connects these two problems and the two domains (diseases and targets). By using the wisdom of the crowds, it is possible to transfer knowledge from one of the domains to the other. The existence of relationships among drug-target-disease motivates us to jointly consider drug repositioning and drug-target prediction in drug discovery. In this paper, we present a novel approach called iDrug, which seamlessly integrates drug repositioning and drug-target prediction into one coherent model via cross-network embedding. In particular, we provide a principled way to transfer knowledge from these two domains and to enhance prediction performance for both tasks. Using real-world datasets, we demonstrate that iDrug achieves superior performance on both learning tasks compared to several state-of-the-art approaches. Our code and datasets are available at: https://github.com/Case-esaC/iDrug. Author summary: Traditional high-throughput techniques for drug discovery are often expensive, time-consuming, and with high failure rates. Computational drug repositioning and drug-target prediction have thus become essential tasks in the early stage drug discovery. The emergence of large-scale heterogeneous biological networks has offered unprecedented opportunities for developing machine learning approaches to identify novel drug-disease or drug-target interactions. However, most existing works focused either on the drug-disease network or on the drug-target network, thus failed to capture the inherent dependencies between these two networks. These two biological networks are naturally connected since they involve the same drug feature space. In our opinion, ignoring this rich source of information is a major shortcoming of some existing works. In this paper, we present a novel approach called iDrug, which seamlessly integrates the drug-disease network and the drug-target network into one coherent model via cross-network embedding. As a result, iDrug is able to take full usage of the knowledge within these two biological networks to better exploit new biomedical insights of drug-target-disease. Therefore, iDrug has broad applications in drug discovery. [ABSTRACT FROM AUTHOR]

The cerebral vasculature has a complex and hierarchical network, ranging from vessels of a few millimeters to superficial cortical vessels with diameters of a few hundred micrometers, and to the microvasculature (arteriole/venule) and capillary beds in the cortex. In standard imaging techniques, it is difficult to segment all vessels in the network, especially in the case of the human brain. This study proposes a hybrid modeling approach that determines these networks by explicitly segmenting the large vessels from medical images and employing a novel vascular generation algorithm. The framework enables vasculatures to be generated at coarse and fine scales for individual arteries and veins with vascular subregions, following the personalized anatomy of the brain and macroscale vasculatures. In this study, the vascular structures of superficial cortical (pial) vessels before they penetrate the cortex are modeled as a mesoscale vasculature. The validity of the present approach is demonstrated through comparisons with partially observed data from existing measurements of the vessel distributions on the brain surface, pathway fractal features, and vascular territories of the major cerebral arteries. Additionally, this validation provides some biological insights: (i) vascular pathways may form to ensure a reasonable supply of blood to the local surface area; (ii) fractal features of vascular pathways are not sensitive to overall and local brain geometries; and (iii) whole pathways connecting the upstream and downstream entire-scale cerebral circulation are highly dependent on the local curvature of the cerebral sulci. Author summary: Cerebral autoregulation in the complex vascular networks of the brain is an amazing achievement. We believe that numerical analysis of the cerebral blood circulation using an anatomically precise vascular model provides a powerful tool for evaluating the direct relationships between local- and global-scale blood flows. However, there is a lack of information about the overall vascular pathways in the human brain, preventing a monolithic model of the human cerebrovasculature from being established. This paper presents a multiscale model of human cerebrovasculature based on a hybrid approach that uses image-based geometries and a newly developed mathematical algorithm. One important argument of this paper is the validity of the cerebrovasculature represented in the model, which reflects anatomical features of major cerebral vasculatures and brain shape, and has strong similarities with available data for human superficial cortical vessels. Investigations of the reconstructed model allow us to derive some biological insights and associated hypotheses for the cerebral vasculature. The authors believe the present cerebrovascular model can be applied to numerical simulations of the entire-scale cerebral blood flow. [ABSTRACT FROM AUTHOR]

Interactive data visualization is imperative in the biological sciences. The development of independent layers of interactivity has been in pursuit in the visualization community. We developed bigPint, a data visualization package available on Bioconductor under the GPL-3 license (https://bioconductor.org/packages/release/bioc/html/bigPint.html). Our software introduces new visualization technology that enables independent layers of interactivity using Plotly in R, which aids in the exploration of large biological datasets. The bigPint package presents modernized versions of scatterplot matrices, volcano plots, and litre plots through the implementation of layered interactivity. These graphics have detected normalization issues, differential expression designation problems, and common analysis errors in public RNA-sequencing datasets. Researchers can apply bigPint graphics to their data by following recommended pipelines written in reproducible code in the user manual. In this paper, we explain how we achieved the independent layers of interactivity that are behind bigPint graphics. Pseudocode and source code are provided. Computational scientists can leverage our open-source code to expand upon our layered interactive technology and/or apply it in new ways toward other computational biology tasks. Author summary: Biological disciplines face the challenge of increasingly large and complex data. One necessary approach toward eliciting information is data visualization. Newer visualization tools incorporate interactive capabilities that allow scientists to extract information more efficiently than static counterparts. In this paper, we introduce technology that allows multiple independent layers of interactive visualization written in open-source code. This technology can be repurposed across various biological problems. Here, we apply this technology to RNA-sequencing data, a popular next-generation sequencing approach that provides snapshots of RNA quantity in biological samples at given moments in time. It can be used to investigate cellular differences between health and disease, cellular changes in response to external stimuli, and additional biological inquiries. RNA-sequencing data is large, noisy, and biased. It requires sophisticated normalization. The most popular open-source RNA-sequencing data analysis software focuses on models, with little emphasis on integrating effective visualization tools. This is despite sound evidence that RNA-sequencing data is most effectively explored using graphical and numerical approaches in a complementary fashion. The software we introduce can make it easier for researchers to use models and visuals in an integrated fashion during RNA-sequencing data analysis. [ABSTRACT FROM AUTHOR]

The human affect system is responsible for producing the positive and negative feelings that color and guide our lives. At the same time, when disrupted, its workings lie at the basis of the occurrence of mood disorder. Understanding the functioning and dynamics of the affect system is therefore crucial to understand the feelings that people experience on a daily basis, their dynamics across time, and how they can become dysregulated in mood disorder. In this paper, a nonlinear stochastic model for the dynamics of positive and negative affect is proposed called the Affective Ising Model (AIM). It incorporates principles of statistical mechanics, is inspired by neurophysiological and behavioral evidence about auto-excitation and mutual inhibition of the positive and negative affect dimensions, and is intended to better explain empirical phenomena such as skewness, multimodality, and non-linear relations of positive and negative affect. The AIM is applied to two large experience sampling studies on the occurrence of positive and negative affect in daily life in both normality and mood disorder. It is examined to what extent the model is able to reproduce the aforementioned non-Gaussian features observed in the data, using two sightly different continuous-time vector autoregressive (VAR) models as benchmarks. The predictive performance of the models is also compared by means of leave-one-out cross-validation. The results indicate that the AIM is better at reproducing non-Gaussian features while their performance is comparable for strictly Gaussian features. The predictive performance of the AIM is also shown to be better for the majority of the affect time series. The potential and limitations of the AIM as a computational model approximating the workings of the human affect system are discussed. Author summary: Feelings color and guide our lives. Understanding their dynamics is a crucial step on the way to eventually understanding mood disorders such as depression. In this paper, we propose a model for the dynamics of positive and negative affect, called the Affective Ising Model (AIM). Starting from a neurobiologically inspired yet abstract microscopic representation of how affect is generated, the model predicts the presence of a number of nonlinear phenomena in the dynamics of positive and negative affect. These nonlinear phenomena include skewed distributions, bimodality (people's affect can fluctuate around one of two possible states) and a V-shaped relation between positive and negative affect. These nonlinear signature features have been empirically established, but have thus far not been integrated into a single computation model. The AIM can be used in the future to explain both normal and dysfunctional affect. [ABSTRACT FROM AUTHOR]

Dengue, a mosquito-borne infectious disease caused by the dengue viruses, is present in many parts of the tropical and subtropical regions of the world. All four serotypes of dengue viruses are endemic in Singapore, an equatorial city-state. Frequent outbreaks occur, sometimes leading to national epidemics. However, few studies have attempted to characterize breakpoints which precede large rises in dengue case counts. In this paper, Bayesian regime switching (BRS) models were employed to infer epidemic and endemic regimes of dengue transmissions, each containing regime specific autoregressive processes which drive the growth and decline of dengue cases, estimated using a custom built multi-move Gibbs sampling algorithm. Posterior predictive checks indicate that BRS replicates temporal trends in Dengue transmissions well and nowcast accuracy assessed using a post-hoc classification scheme showed that BRS classification accuracy is robust even under limited data with the AUC-ROC at 0.935. LASSO-based regression and bootstrapping was used to account for plausibly high dimensions of climatic factors affecting Dengue transmissions, which was then estimated using cross-validation to conduct statistical inference on long-run climatic effects on the estimated regimes. BRS estimates epidemic and endemic regimes of dengue in Singapore which are characterized by persistence across time, lasting an average of 20 weeks and 66 weeks respectively, with a low probability of transitioning away from their regimes. Climate analysis with LASSO indicates that long-run climatic effects up to 20 weeks ago do not differentiate epidemic and endemic regimes. Lastly, by fitting BRS to simulated disease data generated from a stochastic Susceptible-Infected-Recovered model, mechanistic links between infectivity and regimes classified using BRS were provided. The model proposed could be applied to other localities and diseases under minimal data requirements where transmission counts over time are collected. Author summary: Dengue, a mosquito-borne infectious disease caused by the dengue viruses, is present in many parts of the tropical and subtropical regions of the world. All four serotypes of dengue viruses are endemic in Singapore, an equatorial city-state. Frequent outbreaks occur, sometimes leading to national epidemics. However, few studies have attempted to characterize breakpoints which precede large rises in dengue case counts. In this paper, Bayesian regime switching (BRS) models were employed to infer epidemic and endemic regimes of dengue transmissions, each containing regime specific processes which drive the growth and decline of dengue cases, estimated using a custom built multi-move Gibbs sampling algorithm. Assessments against various baseline showed that BRS performs better in characterizing dengue transmissions. The dengue regimes estimated by BRS are characterized by their persistent nature. Next, climate analysis showed no short nor long term associations between classified regimes with climate. Lastly, fitting BRS to simulated disease data generated from a mechanistic model, we showed links between disease infectivity and regimes classified using BRS. The model proposed could be applied to other localities and diseases under minimal data requirements where transmission counts over time are collected. [ABSTRACT FROM AUTHOR]

Humans are able to track multiple objects at any given time in their daily activities—for example, we can drive a car while monitoring obstacles, pedestrians, and other vehicles. Several past studies have examined how humans track targets simultaneously and what underlying behavioral and neural mechanisms they use. At the same time, computer-vision researchers have proposed different algorithms to track multiple targets automatically. These algorithms are useful for video surveillance, team-sport analysis, video analysis, video summarization, and human–computer interaction. Although there are several efficient biologically inspired algorithms in artificial intelligence, the human multiple-target tracking (MTT) ability is rarely imitated in computer-vision algorithms. In this paper, we review MTT studies in neuroscience and biologically inspired MTT methods in computer vision and discuss the ways in which they can be seen as complementary. Author summary: Multiple-target tracking (MTT) is a challenging task vital for both a human's daily life and for many artificial intelligent systems, such as those used for urban traffic control. Neuroscientists are interested in discovering the underlying neural mechanisms that successfully exploit cognitive resources, e.g., spatial attention or memory, during MTT. Computer-vision specialists aim to develop powerful MTT algorithms based on advanced models or data-driven computational methods. In this paper, we review MTT studies from both communities and discuss how findings from cognitive studies can inspire developers to construct higher performing MTT algorithms. Moreover, some directions have been proposed through which MTT algorithms could raise new questions in the cognitive science domain, and answering them can shed light on neural processes underlying MTT. [ABSTRACT FROM AUTHOR]

Analyzing the rhythm of animals' acoustic signals is of interest to a growing number of researchers: evolutionary biologists want to disentangle how these structures evolved and what patterns can be found, and ecologists and conservation biologists aim to discriminate cryptic species on the basis of parameters of acoustic signals such as temporal structures. Temporal structures are also relevant for research on vocal production learning, a part of which is for the animal to learn a temporal structure. These structures, in other words, these rhythms, are the topic of this paper. How can they be investigated in a meaningful, comparable and universal way? Several approaches exist. Here we used five methods to compare their suitability and interpretability for different questions and datasets and test how they support the reproducibility of results and bypass biases. Three very different datasets with regards to recording situation, length and context were analyzed: two social vocalizations of Neotropical bats (multisyllabic, medium long isolation calls of Saccopteryx bilineata, and monosyllabic, very short isolation calls of Carollia perspicillata) and click trains of sperm whales, Physeter macrocephalus. Techniques to be compared included Fourier analysis with a newly developed goodness-of-fit value, a generate-and-test approach where data was overlaid with varying artificial beats, and the analysis of inter-onset-intervals and calculations of a normalized Pairwise Variability Index (nPVI). We discuss the advantages and disadvantages of the methods and we also show suggestions on how to best visualize rhythm analysis results. Furthermore, we developed a decision tree that will enable researchers to select a suitable and comparable method on the basis of their data. Author summary: In the analysis of animal communication more and more interest is shown in rhythm of animal communication and what information this might convey. In this paper, we establish a workflow to analyze the temporal structure–namely the rhythm–of any particular animals'acoustic signal with methods that are applicable for a wide range of signals and results that are easily comparable and interpretable. This workflow will enhance the understanding of rhythmicality in animals' acoustic signals as well as facilitate comparison between species. Methods we conducted ranged from simple distributional and visual analysis to higher mathematics such as Fourier analysis. All analyses rely on Inter-Onset-Intervals, the duration between the beginning of one element and the next. We used different datasets from two neotropical bat species as well as from the sperm whale. With this selection, we cover very short sequences with only few elements up to sequences of around 200 elements, multisyllabic and monosyllabic sequences and social communication as well as sounds used for orientation and foraging. [ABSTRACT FROM AUTHOR]

In bacteria functionally related genes comprising metabolic pathways and protein complexes are frequently encoded in operons and are widely conserved across phylogenetically diverse species. The evolution of these operon-encoded processes is affected by diverse mechanisms such as gene duplication, loss, rearrangement, and horizontal transfer. These mechanisms can result in functional diversification, increasing the potential evolution of novel biological pathways, and enabling pre-existing pathways to adapt to the requirements of particular environments. Despite the fundamental importance that these mechanisms play in bacterial environmental adaptation, a systematic approach for studying the evolution of operon organization is lacking. Herein, we present a novel method to study the evolution of operons based on phylogenetic clustering of operon-encoded protein families and genomic-proximity network visualizations of operon architectures. We applied this approach to study the evolution of the synthase dependent exopolysaccharide (EPS) biosynthetic systems: cellulose, acetylated cellulose, poly-β-1,6-N-acetyl-D-glucosamine (PNAG), Pel, and alginate. These polymers have important roles in biofilm formation, antibiotic tolerance, and as virulence factors in opportunistic pathogens. Our approach revealed the complex evolutionary landscape of EPS machineries, and enabled operons to be classified into evolutionarily distinct lineages. Cellulose operons show phyla-specific operon lineages resulting from gene loss, rearrangement, and the acquisition of accessory loci, and the occurrence of whole-operon duplications arising through horizonal gene transfer. Our evolution-based classification also distinguishes between PNAG production from Gram-negative and Gram-positive bacteria on the basis of structural and functional evolution of the acetylation modification domains shared by PgaB and IcaB loci, respectively. We also predict several pel-like operon lineages in Gram-positive bacteria and demonstrate in our companion paper (Whitfield et al PLoS Pathogens, in press) that Bacillus cereus produces a Pel-dependent biofilm that is regulated by cyclic-3',5'-dimeric guanosine monophosphate (c-di-GMP). Author summary: In bacterial genomes, biological processes are frequently encoded by neighbouring co-transcribed genes, termed operons. In addition, operon-associated genes often belong to distinct evolutionary families with diverse biological functions. Studying the evolution of bacterial operons provides valuable insight into understanding the biological significance of genes involved in environmental adaptation. To date, no systematic approach has been devised to examine both the complex evolutionary relationships of operon encoded genes and the evolution of operon organization as a whole. To address this challenge, we developed an integrative method to study operon evolution by combining phylogenetic tree based clustering and genomic-context networks. We applied this method to perform the first systematic survey of all known synthase-dependent exopolysaccharide biosynthetic machineries, demonstrating the generalizability of our approach for operons of diverse size, protein family composition, and species distribution. Our method identified distinct biofilm operon clades across phylogenetically diverse bacteria, that result from gene rearrangement, duplication, loss, fusion, and horizontal gene transfer. We found different evolutionary trajectories for Gram-negative and Gram-positive PNAG biofilm production machineries, and in a companion paper (Whitfield et al PLoS Pathogens, in press) present experimental validation that the Pel polysaccharide is produced by a Gram-positive bacterium. [ABSTRACT FROM AUTHOR]

Biological systems are made up of components that change their actions (and interactions) over time and coordinate with other components nearby. Together with a large state space, the complexity of this behaviour can make it difficult to create concise mathematical models that can be easily extended or modified. This paper introduces the Beacon Calculus, a process algebra designed to simplify the task of modelling interacting biological components. Its breadth is demonstrated by creating models of DNA replication dynamics, the gene expression dynamics in response to DNA methylation damage, and a multisite phosphorylation switch. The flexibility of these models is shown by adapting the DNA replication model to further include two topics of interest from the literature: cooperative origin firing and replication fork barriers. The Beacon Calculus is supported with the open-source simulator bcs (https://github.com/MBoemo/bcs.git) to allow users to develop and simulate their own models. Author summary: Simulating a model of a biological system can suggest ideas for future experiments and help ensure that conclusions about a mechanism are consistent with data. The Beacon Calculus is a new language that makes modelling simple by allowing users to simulate a biological system in only a few lines of code. This simplicity is critical as it allows users the freedom to come up with new ideas and rapidly test them. Models written in the Beacon Calculus are also easy to modify and extend, allowing users to add new features to the model or incorporate it into a larger biological system. We demonstrate the breadth of applications in this paper by applying the Beacon Calculus to DNA replication and DNA damage repair, both of which have implications for genome stability and cancer. We also apply it to multisite phosphorylation, which is important for cellular signalling. To enable users to create their own models, we created the open-source Beacon Calculus simulator bcs (https://github.com/MBoemo/bcs.git) which is easy to install and is well-supported by documentation and examples. [ABSTRACT FROM AUTHOR]

Striatal oscillatory activity is associated with movement, reward, and decision-making, and observed in several interacting frequency bands. Local field potential recordings in rodent striatum show dopamine- and reward-dependent transitions between two states: a "spontaneous" state involving β (∼15-30 Hz) and low γ (∼40-60 Hz), and a state involving θ (∼4-8 Hz) and high γ (∼60-100 Hz) in response to dopaminergic agonism and reward. The mechanisms underlying these rhythmic dynamics, their interactions, and their functional consequences are not well understood. In this paper, we propose a biophysical model of striatal microcircuits that comprehensively describes the generation and interaction of these rhythms, as well as their modulation by dopamine. Building on previous modeling and experimental work suggesting that striatal projection neurons (SPNs) are capable of generating β oscillations, we show that networks of striatal fast-spiking interneurons (FSIs) are capable of generating δ/θ (ie, 2 to 6 Hz) and γ rhythms. Under simulated low dopaminergic tone our model FSI network produces low γ band oscillations, while under high dopaminergic tone the FSI network produces high γ band activity nested within a δ/θ oscillation. SPN networks produce β rhythms in both conditions, but under high dopaminergic tone, this β oscillation is interrupted by δ/θ-periodic bursts of γ-frequency FSI inhibition. Thus, in the high dopamine state, packets of FSI γ and SPN β alternate at a δ/θ timescale. In addition to a mechanistic explanation for previously observed rhythmic interactions and transitions, our model suggests a hypothesis as to how the relationship between dopamine and rhythmicity impacts motor function. We hypothesize that high dopamine-induced periodic FSI γ-rhythmic inhibition enables switching between β-rhythmic SPN cell assemblies representing the currently active motor program, and thus that dopamine facilitates movement in part by allowing for rapid, periodic shifts in motor program execution. Author summary: Striatal oscillatory activity is associated with movement, reward, and decision-making, and observed in several interacting frequency bands. The mechanisms underlying these rhythmic dynamics, their interactions, and their functional consequences are not well understood. In this paper, we propose a biophysical model of striatal microcircuits that comprehensively describes the generation and interaction of striatal rhythms, as well as their modulation by dopamine. Our model suggests a hypothesis as to how the relationship between dopamine and rhythmicity impacts the function of the motor system, enabling rapid, periodic shifts in motor program execution. [ABSTRACT FROM AUTHOR]

We describe Orbit Image Analysis, an open-source whole slide image analysis tool. The tool consists of a generic tile-processing engine which allows the execution of various image analysis algorithms provided by either Orbit itself or from other open-source platforms using a tile-based map-reduce execution framework. Orbit Image Analysis is capable of sophisticated whole slide imaging analyses due to several key features. First, Orbit has machine-learning capabilities. This deep learning segmentation can be integrated with complex object detection for analysis of intricate tissues. In addition, Orbit can run locally as standalone or connect to the open-source image server OMERO. Another important characteristic is its scale-out functionality, using the Apache Spark framework for distributed computing. In this paper, we describe the use of Orbit in three different real-world applications: quantification of idiopathic lung fibrosis, nerve fibre density quantification, and glomeruli detection in the kidney. Author summary: Whole slide images (WSI) are digital scans of samples, e.g. tissue sections. It is very convenient to view samples in this digital form, and with the increasing computation power it can also be used for quantification. These images are often too large to be analysed with standard tools. To overcome this issue, we created on open-source tool called Orbit Image Analysis which divides the images into smaller parts and allows the analysis of it with either embedded algorithms or the integration of existing tools. It also provides mechanisms to process huge amounts of images in distributed computing environments, such as clusters or cloud infrastructures. In this paper we describe the Orbit system and demonstrate its application based on three real-word use-cases. [ABSTRACT FROM AUTHOR]

Surveillance plays a crucial role in preventing emerging infectious diseases from becoming epidemic. In circumstances where it is possible to monitor the infection status of certain people, transport hubs, or hospitals, early detection of the disease allows interventions to be implemented before most of the damage can occur, or at least its impact can be mitigated. This paper addresses the question of which nodes we should select in a network of individuals susceptible to some infectious disease in order to minimize the number of casualties. By simulating disease outbreaks on a collection of empirical and synthetic networks we show that the best strategy depends on topological characteristics of the network. For highly modular or spatially embedded networks it is better to place the sentinels on nodes distributed across different regions. However, if the degree heterogeneity is high, then a strategy that targets network hubs is preferred. We further consider the consequences of having an incomplete sample of the network and demonstrate that the value of new information diminishes as more data is collected. Finally we find further marginal improvements using two heuristics informed by known results in graph theory that exploit the fragmented structure of sparse network data. Author summary: In a network of individuals susceptible to some infectious disease, what are the best locations to monitor in order to detect the infection before most damage can be done? In this paper we address this question by considering various heuristic strategies for sentinel placement that can potentially be implemented in real-world situations without requiring excessive amounts of computation, or even having perfect data about the structure of the network. We find that strategies that attempt to distribute sentinels over different regions of the network perform best in highly modular or spatially embedded networks, whereas the strategy of targeting the most well connected individuals works best when there is a considerable amount of contact heterogeneity between individuals. Our results may be used as a guideline to help decide when certain strategies should, or should not, be implemented. [ABSTRACT FROM AUTHOR]

Phylogenetic networks generalize phylogenetic trees by allowing the modelization of events of reticulate evolution. Among the different kinds of phylogenetic networks that have been proposed in the literature, the subclass of binary tree-child networks is one of the most studied ones. However, very little is known about the combinatorial structure of these networks. In this paper we address the problem of generating all possible binary tree-child (BTC) networks with a given number of leaves in an efficient way via reduction/augmentation operations that extend and generalize analogous operations for phylogenetic trees, and are biologically relevant. Since our solution is recursive, this also provides us with a recurrence relation giving an upper bound on the number of such networks. We also show how the operations introduced in this paper can be employed to extend the evolutive history of a set of sequences, represented by a BTC network, to include a new sequence. An implementation in python of the algorithms described in this paper, along with some computational experiments, can be downloaded from . [ABSTRACT FROM AUTHOR]

Infectious disease forecasting is an emerging field and has the potential to improve public health through anticipatory resource allocation, situational awareness, and mitigation planning. By way of exploring and operationalizing disease forecasting, the U.S. Centers for Disease Control and Prevention (CDC) has hosted FluSight since the 2013/14 flu season, an annual flu forecasting challenge. Since FluSight's onset, forecasters have developed and improved forecasting models in an effort to provide more timely, reliable, and accurate information about the likely progression of the outbreak. While improving the predictive performance of these forecasting models is often the primary objective, it is also important for a forecasting model to run quickly, facilitating further model development and improvement while providing flexibility when deployed in a real-time setting. In this vein I introduce Inferno, a fast and accurate flu forecasting model inspired by Dante, the top performing model in the 2018/19 FluSight challenge. When pseudoprospectively compared to all models that participated in FluSight 2018/19, Inferno would have placed 2nd in the national and regional challenge as well as the state challenge, behind only Dante. Inferno, however, runs in minutes and is trivially parallelizable, while Dante takes hours to run, representing a significant operational improvement with minimal impact to performance. Forecasting challenges like FluSight should continue to monitor and evaluate how they can be modified and expanded to incentivize the development of forecasting models that benefit public health. Author summary: Infectious disease forecasting, if accurate, timely, and reliable, can assist decision makers with resource allocation planning in an attempt to curb the negative impacts of an outbreak. Forecasting challenges, like the U.S. Centers for Disease Control and Prevention's flu forecasting challenge, FluSight, provide a space for teams to develop and operationalize real-time forecasting models that benefit public health, with weekly forecasts made at the state-level, Health and Human Services region-level, and the United States. The ultimate goal of these models is to produce accurate forecasts within the constraints of the forecasting challenge. Having a forecasting model that runs quickly is also important for future scalability, model development, and operational flexibility. In this paper, I present a fast and accurate flu forecasting model, Inferno. Through retrospective comparisons with FluSight-participating models, Inferno was shown to be a leading forecasting model in the field. Inferno, however, runs in minutes not hours, as other leading forecasting models do. This reduction in runtime constitutes an advancement in flu forecasting, positioning Inferno to scale to more granular geographic units, like counties or health care providers. [ABSTRACT FROM AUTHOR]

The cell cycle of Caulobacter crescentus involves the polar morphogenesis and an asymmetric cell division driven by precise interactions and regulations of proteins, which makes Caulobacter an ideal model organism for investigating bacterial cell development and differentiation. The abundance of molecular data accumulated on Caulobacter motivates system biologists to analyze the complex regulatory network of cell cycle via quantitative modeling. In this paper, We propose a comprehensive model to accurately characterize the underlying mechanisms of cell cycle regulation based on the study of: a) chromosome replication and methylation; b) interactive pathways of five master regulatory proteins including DnaA, GcrA, CcrM, CtrA, and SciP, as well as novel consideration of their corresponding mRNAs; c) cell cycle-dependent proteolysis of CtrA through hierarchical protease complexes. The temporal dynamics of our simulation results are able to closely replicate an extensive set of experimental observations and capture the main phenotype of seven mutant strains of Caulobacter crescentus. Collectively, the proposed model can be used to predict phenotypes of other mutant cases, especially for nonviable strains which are hard to cultivate and observe. Moreover, the module of cyclic proteolysis is an efficient tool to study the metabolism of proteins with similar mechanisms. Author summary: Timed cellular events in both eukaryotes and prokaryotes, such as chromosome replication, transcription, cell differentiation, cytokinesis, and cell division, are controlled by remarkably complex genetic regulations and protein-protein interactions. In this work, we investigate the cell cycle of Caulobacter crescentus, an alphaproteobacterium undergoing asymmetric cell divisions, to understand mechanisms underlying temporal regulations of complex cellular events. The asymmetric lifestyle makes Caulobacter crescentus easily synchronized and tracked, which is the foundation of molecular data accumulation. Here, we utilize the mathematical modeling together with experimental information to systematically integrate the complex gene-protein and protein-protein interactions in cell cycle progression. Using the mathematical model, we capture core features of cell cycle-dependent methylation, transcription, and proteolysis. In mutant cases, we found the complex and redundant regulatory network ensure the robustness of Caulobacter crescentus system because the change of most molecules does not cause immediate mortality, although they influence the time points of cell differentiation and division. The overall model and individual modules such as simulating transcriptional regulations and protease complexes can be further extended to the study of cell development in other bacterial species. [ABSTRACT FROM AUTHOR]

Cell intercalation is a key cell behaviour of morphogenesis and wound healing, where local cell neighbour exchanges can cause dramatic tissue deformations such as body axis extension. Substantial experimental work has identified the key molecular players facilitating intercalation, but there remains a lack of consensus and understanding of their physical roles. Existing biophysical models that represent cell-cell contacts with single edges cannot study cell neighbour exchange as a continuous process, where neighbouring cell cortices must uncouple. Here, we develop an Apposed-Cortex Adhesion Model (ACAM) to understand active cell intercalation behaviours in the context of a 2D epithelial tissue. The junctional actomyosin cortex of every cell is modelled as a continuous viscoelastic rope-loop, explicitly representing cortices facing each other at bicellular junctions and the adhesion molecules that couple them. The model parameters relate directly to the properties of the key subcellular players that drive dynamics, providing a multi-scale understanding of cell behaviours. We show that active cell neighbour exchanges can be driven by purely junctional mechanisms. Active contractility and cortical turnover in a single bicellular junction are sufficient to shrink and remove a junction. Next, a new, orthogonal junction extends passively. The ACAM reveals how the turnover of adhesion molecules regulates tension transmission and junction deformation rates by controlling slippage between apposed cell cortices. The model additionally predicts that rosettes, which form when a vertex becomes common to many cells, are more likely to occur in actively intercalating tissues with strong friction from adhesion molecules. Author summary: During development tissues undergo dramatic shape changes to build and reshape organs. In many instances, these tissue-level deformations are driven by the active reorganisation of the constituent cells. This intercalation process involves multiple cell neighbour exchanges, where an interface shared between two cells is removed and a new interface is grown. The key molecular players involved in neighbour exchanges, such as contractile motors proteins and adhesion complexes, are now well-known. However, how their physical properties facilitate the process remains poorly understood. For example, how do cells maintain sufficient adhesive contact while actively uncoupling from one another? Then, how does a new interface grow in a contractile environment? Many existing biophysical models cannot answer such questions, due to representing shared cell interfaces as discrete elements that cannot uncouple. In this paper, we develop a model that represents cell cortices as contractile rope-loops coupled by adhesions. We outline the conditions required for successful neighbour exchanges, in terms of the properties of the known molecules that drive the process. The model predicts that tissue dynamics depend strongly on the ability of neighbouring cortices to slip relative to one another, which is regulated by adhesion turnover. [ABSTRACT FROM AUTHOR]

Since their introduction in the 50's, variance component mixed models have been widely used in many application fields. In this context, ReML estimation is by far the most popular procedure to infer the variance components of the model. Although many implementations of the ReML procedure are readily available, there is still need for computational improvements due to the ever-increasing size of the datasets to be handled, and to the complexity of the models to be adjusted. In this paper, we present a Min-Max (MM) algorithm for ReML inference and combine it with several speed-up procedures. The ReML MM algorithm we present is compared to 5 state-of-the-art publicly available algorithms used in statistical genetics. The computational performance of the different algorithms are evaluated on several datasets representing different plant breeding experimental designs. The MM algorithm ranks among the top 2 methods in almost all settings and is more versatile than many of its competitors. The MM algorithm is a promising alternative to the classical AI-ReML algorithm in the context of variance component mixed models. It is available in the MM4LMM R-package. Author summary: Mixed models have been a cornerstone of the quantitative genetics methodology for decades. Due to the growing size of datasets, their associated computational cost is a major burden, particularly in genome-wide association studies that routinely address Millions of markers, requiring as many mixed models to be fitted. In the particular case of a 2-variance component mixed models efficient procedures such as FaST-LMM or GEMMA have been developed to analyze panels with tens of thousands of individuals. However, there is room for improvement in cases where the computational burden is due to the number of variance components in the model rather than the panel size, a classical situation in plant genetics where several variance components are required to handle various polygenic effects. We consider a "MM" (Min-Max) algorithm as an alternative to the by-default AI (Average Information) algorithm used to perform inference in mixed models. The MM algorithm can be combined to the classical tricks used to accelerate the inference process (e.g. simultaneous orthogonalization or squared iterative acceleration methods). The MM procedure is implemented in an MM4LMM package, and is competitive compared to classical algorithms used in plant genetics. This package should help geneticists handling more complex models to analyze their data than today. [ABSTRACT FROM AUTHOR]

Constructing biological networks capable of performing specific biological functionalities has been of sustained interest in synthetic biology. Adaptation is one such ubiquitous functional property, which enables every living organism to sense a change in its surroundings and return to its operating condition prior to the disturbance. In this paper, we present a generic systems theory-driven method for designing adaptive protein networks. First, we translate the necessary qualitative conditions for adaptation to mathematical constraints using the language of systems theory, which we then map back as 'design requirements' for the underlying networks. We go on to prove that a protein network with different input–output nodes (proteins) needs to be at least of third-order in order to provide adaptation. Next, we show that the necessary design principles obtained for a three-node network in adaptation consist of negative feedback or a feed-forward realization. We argue that presence of a particular class of negative feedback or feed-forward realization is necessary for a network of any size to provide adaptation. Further, we claim that the necessary structural conditions derived in this work are the strictest among the ones hitherto existed in the literature. Finally, we prove that the capability of producing adaptation is retained for the admissible motifs even when the output node is connected with a downstream system in a feedback fashion. This result explains how complex biological networks achieve robustness while keeping the core motifs unchanged in the context of a particular functionality. We corroborate our theoretical results with detailed and thorough numerical simulations. Overall, our results present a generic, systematic and robust framework for designing various kinds of biological networks. Author summary: Biological systems display a remarkable diversity of functionalities, many of which can be conceived as the response of a large network composed of small interconnecting modules. Unravelling the connection pattern, i.e. design principles, behind important biological functionalities is one of the most challenging problems in systems biology. One such phenomenon is perfect adaptation, which merits special attention owing to its universal presence ranging from chemotaxis in bacterial cells to calcium homeostasis in mammalian cells. The present work focuses on finding the design principles for perfect adaptation in the presence of a stair-case type disturbance. To this end, the current work proposes a systems-theoretic approach to deduce precise mathematical (hence structural) conditions that comply with the key performance parameters for adaptation. The approach is agnostic to the particularities of the reaction kinetics, underlining the dominant role of the topological structure on the response of the network. Notably, the design principles obtained in this work serve as the most strict necessary structural conditions for a network of any size to provide perfect adaptation. [ABSTRACT FROM AUTHOR]

The aim of this paper is two-fold. First, we propose a new computational method to investigate the particularities of evolution. Second, we apply this method to a model of gene regulatory networks (GRNs) and explore the evolution of mutational robustness and bistability. Living systems have developed their functions through evolutionary processes. To understand the particularities of this process theoretically, evolutionary simulation (ES) alone is insufficient because the outcomes of ES depend on evolutionary pathways. We need a reference system for comparison. An appropriate reference system for this purpose is an ensemble of the randomly sampled genotypes. However, generating high-fitness genotypes by simple random sampling is difficult because such genotypes are rare. In this study, we used the multicanonical Monte Carlo method developed in statistical physics to construct a reference ensemble of GRNs and compared it with the outcomes of ES. We obtained the following results. First, mutational robustness was significantly higher in ES than in the reference ensemble at the same fitness level. Second, the emergence of a new phenotype, bistability, was delayed in evolution. Third, the bistable group of GRNs contains many mutationally fragile GRNs compared with those in the non-bistable group. This suggests that the delayed emergence of bistability is a consequence of the mutation-selection mechanism. Author summary: Living systems are products of evolution, and their present forms reflect their evolutionary history. Thus, to investigate the particularity of the evolutionary process by computer simulations, an appropriate reference system is needed for comparison with the outcomes of evolutionary simulations. In this study, we considered a model of gene regulatory networks (GRNs). Our idea was to construct a reference ensemble comprising randomly generated GRNs. To produce GRNs with high fitness values, which are rare, we employed a "rare event sampling" method developed in statistical physics. In particular, we focused on the evolution of mutational robustness. Living systems do not lose viability readily, even when some genes are mutated. This trait, called mutational robustness, has developed throughout evolution, along with functionality. Using the abovementioned method, we found that mutational robustness resulting from evolution exceeded that of the reference set. Therefore, mutational robustness is enhanced by evolution. We also found that the emergence of a new phenotype was significantly delayed in evolution. Our results suggest that this delay is a consequence of the fact that mutationally robust GRNs are favored by evolution. [ABSTRACT FROM AUTHOR]

Dynamic models based on non-linear differential equations are increasingly being used in many biological applications. Highly informative dynamic experiments are valuable for the identification of these dynamic models. The storage of fresh fruit and vegetables is one such application where dynamic experimentation is gaining momentum. In this paper, we construct optimal O2 and CO2 gas input profiles to estimate the respiration and fermentation kinetics of pear fruit. The optimal input profiles, however, depend on the true values of the respiration and fermentation parameters. Locally optimal design of input profiles, which uses a single initial guess for the parameters, is the traditional method to deal with this issue. This method, however, is very sensitive to the initial values selected for the model parameters. Therefore, we present a robust experimental design approach that can handle uncertainty on the model parameters. Author summary: Fruit and vegetables need to be stored at low temperature and oxygen conditions as well as slightly heightened carbon dioxide conditions so that they remain fresh throughout the entire year. The exact storage conditions are different for each cultivated variety. Optimizing these storage conditions typically requires a lot of experimentation. Traditionally, this was done by independently storing the fruit of vegetable product at many different combinations of temperature as well as oxygen and carbon dioxide conditions, and by tracking the quality of the product and choosing the best of these conditions. This, however, is a very wasteful approach as the quality tracking at certain conditions do not inform us about the quality at different storage conditions. Instead, we adopt a model-based approach, where the product is described as a dynamic system with inputs and outputs. This model has parameters that must be estimated from experimental data. But once the model has been calibrated it can be used to make predictions at any storage condition. We develop the experimental design methodology required to precisely estimate the model parameters. We do this in a robust manner, meaning we are able to discover the true model parameter values no matter their specific value. [ABSTRACT FROM AUTHOR]