PLoS Computational Biology最新文献

Controller motifs are simple biomolecular reaction networks with negative feedback. They can explain how regulatory function is achieved and are often used as building blocks in mathematical models of biological systems. In this paper we perform an extensive investigation into structural identifiability of controller motifs, specifically the so-called basic and antithetic controller motifs. Structural identifiability analysis is a useful tool in the creation and evaluation of mathematical models: it can be used to ensure that model parameters can be determined uniquely and to examine which measurements are necessary for this purpose. This is especially useful for biological models where parameter estimation can be difficult due to limited availability of measureable outputs. Our aim with this work is to investigate how structural identifiability is affected by controller motif complexity and choice of measurements. To increase the number of potential outputs we propose two methods for including flow measurements and show how this affects structural identifiability in combination with, or in the absence of, concentration measurements. In our investigation, we analyze 128 different controller motif structures using a combination of flow and/or concentration measurements, giving a total of 3648 instances. Among all instances, 34% of the measurement combinations provided structural identifiability. Our main findings for the controller motifs include: i) a single measurement is insufficient for structural identifiability, ii) measurements related to different chemical species are necessary for structural identifiability. Applying these findings result in a reduced subset of 1568 instances, where 80% are structurally identifiable, and more complex/interconnected motifs appear easier to structurally identify. The model structures we have investigated are commonly used in models of biological systems, and our results demonstrate how different model structures and measurement combinations affect structural identifiability of controller motifs.

Linear parametric state-space models are a ubiquitous tool for analyzing neural time series data, providing a way to characterize the underlying brain dynamics with much greater statistical efficiency than non-parametric data analysis approaches. However, neural time series data are frequently time-varying, exhibiting rapid changes in dynamics, with transient activity that is often the key feature of interest in the data. Stationary methods can be adapted to time-varying scenarios by employing fixed-duration windows under an assumption of quasi-stationarity. But time-varying dynamics can be explicitly modeled by switching state-space models, i.e., by using a pool of state-space models with different dynamics selected by a probabilistic switching process. Unfortunately, exact solutions for state inference and parameter learning with switching state-space models are intractable. Here we revisit a switching state-space model inference approach first proposed by Ghahramani and Hinton. We provide explicit derivations for solving the inference problem iteratively after applying a variational approximation on the joint posterior of the hidden states and the switching process. We introduce a novel initialization procedure using an efficient leave-one-out strategy to compare among candidate models, which significantly improves performance compared to the existing method that relies on deterministic annealing. We then utilize this state inference solution within a generalized expectation-maximization algorithm to estimate model parameters of the switching process and the linear state-space models with dynamics potentially shared among candidate models. We perform extensive simulations under different settings to benchmark performance against existing switching inference methods and further validate the robustness of our switching inference solution outside the generative switching model class. Finally, we demonstrate the utility of our method for sleep spindle detection in real recordings, showing how switching state-space models can be used to detect and extract transient spindles from human sleep electroencephalograms in an unsupervised manner.

The time-varying reproduction number (Rt) is an important measure of epidemic transmissibility that directly informs policy decisions and the optimisation of control measures. EpiEstim is a widely used opensource software tool that uses case incidence and the serial interval (SI, time between symptoms in a case and their infector) to estimate Rt in real-time. The incidence and the SI distribution must be provided at the same temporal resolution, which can limit the applicability of EpiEstim and other similar methods, e.g. for contexts where the time window of incidence reporting is longer than the mean SI. In the EpiEstim R package, we implement an expectation-maximisation algorithm to reconstruct daily incidence from temporally aggregated data, from which Rt can then be estimated. We assess the validity of our method using an extensive simulation study and apply it to COVID-19 and influenza data. For all datasets, the influence of intra-weekly variability in reported data was mitigated by using aggregated weekly data. Rt estimated on weekly sliding windows using incidence reconstructed from weekly data was strongly correlated with estimates from the original daily data. The simulation study revealed that Rt was well estimated in all scenarios and regardless of the temporal aggregation of the data. In the presence of weekend effects, Rt estimates from reconstructed data were more successful at recovering the true value of Rt than those obtained from reported daily data. These results show that this novel method allows Rt to be successfully recovered from aggregated data using a simple approach with very few data requirements. Additionally, by removing administrative noise when daily incidence data are reconstructed, the accuracy of Rt estimates can be improved.

Background: The majority of high-throughput single-cell molecular profiling methods quantify RNA expression; however, recent multimodal profiling methods add simultaneous measurement of genomic, proteomic, epigenetic, and/or spatial information on the same cells. The development of new statistical and computational methods in Bioconductor for such data will be facilitated by easy availability of landmark datasets using standard data classes.

Results: We collected, processed, and packaged publicly available landmark datasets from important single-cell multimodal protocols, including CITE-Seq, ECCITE-Seq, SCoPE2, scNMT, 10X Multiome, seqFISH, and G&T. We integrate data modalities via the MultiAssayExperiment Bioconductor class, document and re-distribute datasets as the SingleCellMultiModal package in Bioconductor's Cloud-based ExperimentHub. The result is single-command actualization of landmark datasets from seven single-cell multimodal data generation technologies, without need for further data processing or wrangling in order to analyze and develop methods within Bioconductor's ecosystem of hundreds of packages for single-cell and multimodal data.

Conclusions: We provide two examples of integrative analyses that are greatly simplified by SingleCellMultiModal. The package will facilitate development of bioinformatic and statistical methods in Bioconductor to meet the challenges of integrating molecular layers and analyzing phenotypic outputs including cell differentiation, activity, and disease.

The ability to acquire abstract knowledge is a hallmark of human intelligence and is believed by many to be one of the core differences between humans and neural network models. Agents can be endowed with an inductive bias towards abstraction through meta-learning, where they are trained on a distribution of tasks that share some abstract structure that can be learned and applied. However, because neural networks are hard to interpret, it can be difficult to tell whether agents have learned the underlying abstraction, or alternatively statistical patterns that are characteristic of that abstraction. In this work, we compare the performance of humans and agents in a meta-reinforcement learning paradigm in which tasks are generated from abstract rules. We define a novel methodology for building "task metamers" that closely match the statistics of the abstract tasks but use a different underlying generative process, and evaluate performance on both abstract and metamer tasks. We find that humans perform better at abstract tasks than metamer tasks whereas common neural network architectures typically perform worse on the abstract tasks than the matched metamers. This work provides a foundation for characterizing differences between humans and machine learning that can be used in future work towards developing machines with more human-like behavior.

Episodic memories are formed after a single exposure to novel stimuli. The plasticity mechanisms underlying such fast learning still remain largely unknown. Recently, it was shown that cells in area CA1 of the hippocampus of mice could form or shift their place fields after a single traversal of a virtual linear track. In-vivo intracellular recordings in CA1 cells revealed that previously silent inputs from CA3 could be switched on when they occurred within a few seconds of a dendritic plateau potential (PP) in the post-synaptic cell, a phenomenon dubbed Behavioral Time-scale Plasticity (BTSP). A recently developed computational framework for BTSP in which the dynamics of synaptic traces related to the pre-synaptic activity and post-synaptic PP are explicitly modelled, can account for experimental findings. Here we show that this model of plasticity can be further simplified to a 1D map which describes changes to the synaptic weights after a single trial. We use a temporally symmetric version of this map to study the storage of a large number of spatial memories in a recurrent network, such as CA3. Specifically, the simplicity of the map allows us to calculate the correlation of the synaptic weight matrix with any given past environment analytically. We show that the calculated memory trace can be used to predict the emergence and stability of bump attractors in a high dimensional neural network model endowed with BTSP.

Nucleic acid probes are valuable tools in biology and chemistry and are indispensable for PCR amplification of DNA, RNA quantification and visualization, and downregulation of gene expression. Recently, triplex-forming oligonucleotides (TFO) have received increased attention due to their improved selectivity and sensitivity in recognizing purine-rich double-stranded RNA regions at physiological pH by incorporating backbone and base modifications. For example, triplex-forming peptide nucleic acid (PNA) oligomers have been used for imaging a structured RNA in cells and inhibiting influenza A replication. Although a handful of programs are available to identify triplex target sites (TTS) in DNA, none are available that find such regions in structured RNAs. Here, we describe TFOFinder, a Python program that facilitates the identification of intramolecular purine-only RNA duplexes that are amenable to forming parallel triple helices (pyrimidine/purine/pyrimidine) and the design of the corresponding TFO(s). We performed genome- and transcriptome-wide analyses of TTS in Drosophila melanogaster and found that only 0.3% (123) of total unique transcripts (35,642) show the potential of forming 12-purine long triplex forming sites that contain at least one guanine. Using minimization algorithms, we predicted the secondary structure(s) of these transcripts, and using TFOFinder, we found that 97 (79%) of the identified 123 transcripts are predicted to fold to form at least one TTS for parallel triple helix formation. The number of transcripts with potential purine TTS increases when the strict search conditions are relaxed by decreasing the length of the probe or by allowing up to two pyrimidine inversions or 1-nucleotide bulge in the target site. These results are encouraging for the use of modified triplex forming probes for live imaging of endogenous structured RNA targets, such as pre-miRNAs, and inhibition of target-specific translation and viral replication.

In microorganisms, different from primary metabolism for cellular growth, secondary metabolism is for ecological interactions and stress responses and an important source of natural products widely used in various areas such as pharmaceutics and food additives. With advancements of sequencing technologies and bioinformatics tools, a large number of biosynthetic gene clusters of secondary metabolites have been discovered from microbial genomes. However, due to challenges from the difficulty of genome-scale pathway reconstruction and the limitation of conventional flux balance analysis (FBA) on secondary metabolism, the quantitative modeling of secondary metabolism is poorly established, in contrast to that of primary metabolism. This review first discusses current efforts on the reconstruction of secondary metabolic pathways in genome-scale metabolic models (GSMMs), as well as related FBA-based modeling techniques. Additionally, potential extensions of FBA are suggested to improve the prediction accuracy of secondary metabolite production. As this review posits, biosynthetic pathway reconstruction for various secondary metabolites will become automated and a modeling framework capturing secondary metabolism onset will enhance the predictive power. Expectedly, an improved FBA-based modeling workflow will facilitate quantitative study of secondary metabolism and in silico design of engineering strategies for natural product production.

Immunotherapeutic cytokines can activate immune cells against cancers and chronic infections. N-803 is an IL-15 superagonist that expands CD8+ T cells and increases their cytotoxicity. N-803 also temporarily reduced viral load in a limited subset of non-human primates infected with simian immunodeficiency virus (SIV), a model of HIV. However, viral suppression has not been observed in all SIV cohorts and may depend on pre-treatment viral load and the corresponding effects on CD8+ T cells. Starting from an existing mechanistic mathematical model of N-803 immunotherapy of SIV, we develop a model that includes activation of SIV-specific and non-SIV-specific CD8+ T cells by antigen, inflammation, and N-803. Also included is a regulatory counter-response that inhibits CD8+ T cell proliferation and function, representing the effects of immune checkpoint molecules and immunosuppressive cells. We simultaneously calibrate the model to two separate SIV cohorts. The first cohort had low viral loads prior to treatment (≈3-4 log viral RNA copy equivalents (CEQ)/mL), and N-803 treatment transiently suppressed viral load. The second had higher pre-treatment viral loads (≈5-7 log CEQ/mL) and saw no consistent virus suppression with N-803. The mathematical model can replicate the viral and CD8+ T cell dynamics of both cohorts based on different pre-treatment viral loads and different levels of regulatory inhibition of CD8+ T cells due to those viral loads (i.e. initial conditions of model). Our predictions are validated by additional data from these and other SIV cohorts. While both cohorts had high numbers of activated SIV-specific CD8+ T cells in simulations, viral suppression was precluded in the high viral load cohort due to elevated inhibition of cytotoxicity. Thus, we mathematically demonstrate how the pre-treatment viral load can influence immunotherapeutic efficacy, highlighting the in vivo conditions and combination therapies that could maximize efficacy and improve treatment outcomes.

Genetic regulatory networks (GRNs) regulate the flow of genetic information from the genome to expressed messenger RNAs (mRNAs) and thus are critical to controlling the phenotypic characteristics of cells. Numerous methods exist for profiling mRNA transcript levels and identifying protein-DNA binding interactions at the genome-wide scale. These enable researchers to determine the structure and output of transcriptional regulatory networks, but uncovering the complete structure and regulatory logic of GRNs remains a challenge. The field of GRN inference aims to meet this challenge using computational modeling to derive the structure and logic of GRNs from experimental data and to encode this knowledge in Boolean networks, Bayesian networks, ordinary differential equation (ODE) models, or other modeling frameworks. However, most existing models do not incorporate dynamic transcriptional data since it has historically been less widely available in comparison to "static" transcriptional data. We report the development of an evolutionary algorithm-based ODE modeling approach (named EA) that integrates kinetic transcription data and the theory of attractor matching to infer GRN architecture and regulatory logic. Our method outperformed six leading GRN inference methods, none of which incorporate kinetic transcriptional data, in predicting regulatory connections among TFs when applied to a small-scale engineered synthetic GRN in Saccharomyces cerevisiae. Moreover, we demonstrate the potential of our method to predict unknown transcriptional profiles that would be produced upon genetic perturbation of the GRN governing a two-state cellular phenotypic switch in Candida albicans. We established an iterative refinement strategy to facilitate candidate selection for experimentation; the experimental results in turn provide validation or improvement for the model. In this way, our GRN inference approach can expedite the development of a sophisticated mathematical model that can accurately describe the structure and dynamics of the in vivo GRN.