Explore the vast range of titles available.

Background Numerous centrality measures have been introduced to identify “central” nodes in large networks. The availability of a wide range of measures for ranking influential nodes leaves the user to decide which measure may best suit the analysis of a given network. The choice of a suitable measure is furthermore complicated by the impact of the network topology on ranking influential nodes by centrality measures. To approach this problem systematically, we examined the centrality profile of nodes of yeast protein-protein interaction networks (PPINs) in order to detect which centrality measure is succeeding in predicting influential proteins. We studied how different topological network features are reflected in a large set of commonly used centrality measures. Results We used yeast PPINs to compare 27 common of centrality measures. The measures characterize and assort influential nodes of the networks. We applied principal component analysis (PCA) and hierarchical clustering and found that the most informative measures depend on the network’s topology. Interestingly, some measures had a high level of contribution in comparison to others in all PPINs, namely Latora closeness, Decay, Lin, Freeman closeness, Diffusion, Residual closeness and Average distance centralities. Conclusions The choice of a suitable set of centrality measures is crucial for inferring important functional properties of a network. We concluded that undertaking data reduction using unsupervised machine learning methods helps to choose appropriate variables (centrality measures). Hence, we proposed identifying the contribution proportions of the centrality measures with PCA as a prerequisite step of network analysis before inferring functional consequences, e.g., essentiality of a node.

Background The complex interplay between viral replication and host immune response during infection remains poorly understood. While many viruses are known to employ anti-immune strategies to facilitate their replication, highly pathogenic virus infections can also cause an excessive immune response that exacerbates, rather than reduces pathogenicity. To investigate this dichotomy in severe acute respiratory syndrome coronavirus (SARS-CoV), we developed a transcriptional network model of SARS-CoV infection in mice and used the model to prioritize candidate regulatory targets for further investigation. Results We validated our predictions in 18 different knockout (KO) mouse strains, showing that network topology provides significant predictive power to identify genes that are important for viral infection. We identified a novel player in the immune response to virus infection, Kepi, an inhibitory subunit of the protein phosphatase 1 (PP1) complex, which protects against SARS-CoV pathogenesis. We also found that receptors for the proinflammatory cytokine tumor necrosis factor alpha (TNFα) promote pathogenesis, presumably through excessive inflammation. Conclusions The current study provides validation of network modeling approaches for identifying important players in virus infection pathogenesis, and a step forward in understanding the host response to an important infectious disease. The results presented here suggest the role of Kepi in the host response to SARS-CoV, as well as inflammatory activity driving pathogenesis through TNFα signaling in SARS-CoV infections. Though we have reported the utility of this approach in bacterial and cell culture studies previously, this is the first comprehensive study to confirm that network topology can be used to predict phenotypes in mice with experimental validation.

Background Many mathematical models have now been employed across every area of systems biology. These models increasingly involve large numbers of unknown parameters, have complex structure which can result in substantial evaluation time relative to the needs of the analysis, and need to be compared to observed data of various forms. The correct analysis of such models usually requires a global parameter search, over a high dimensional parameter space, that incorporates and respects the most important sources of uncertainty. This can be an extremely difficult task, but it is essential for any meaningful inference or prediction to be made about any biological system. It hence represents a fundamental challenge for the whole of systems biology. Methods Bayesian statistical methodology for the uncertainty analysis of complex models is introduced, which is designed to address the high dimensional global parameter search problem. Bayesian emulators that mimic the systems biology model but which are extremely fast to evaluate are embeded within an iterative history match: an efficient method to search high dimensional spaces within a more formal statistical setting, while incorporating major sources of uncertainty. Results The approach is demonstrated via application to a model of hormonal crosstalk in Arabidopsis root development, which has 32 rate parameters, for which we identify the sets of rate parameter values that lead to acceptable matches between model output and observed trend data. The multiple insights into the model’s structure that this analysis provides are discussed. The methodology is applied to a second related model, and the biological consequences of the resulting comparison, including the evaluation of gene functions, are described. Conclusions Bayesian uncertainty analysis for complex models using both emulators and history matching is shown to be a powerful technique that can greatly aid the study of a large class of systems biology models. It both provides insight into model behaviour and identifies the sets of rate parameters of interest.

Background The human gut contains approximately 10 14 bacteria, belonging to hundreds of different species. Together, these microbial species form a complex food web that can break down nutrient sources that our own digestive enzymes cannot handle, including complex polysaccharides, producing short chain fatty acids and additional metabolites, e.g., vitamin K. Microbial diversity is important for colonic health: Changes in the composition of the microbiota have been associated with inflammatory bowel disease, diabetes, obesity and Crohn’s disease, and make the microbiota more vulnerable to infestation by harmful species, e.g., Clostridium difficile. To get a grip on the controlling factors of microbial diversity in the gut, we here propose a multi-scale, spatiotemporal dynamic flux-balance analysis model to study the emergence of metabolic diversity in a spatial gut-like, tubular environment. The model features genome-scale metabolic models (GEM) of microbial populations, resource sharing via extracellular metabolites, and spatial population dynamics and evolution. Results In this model, cross-feeding interactions emerge readily, despite the species’ ability to metabolize sugars autonomously. Interestingly, the community requires cross-feeding for producing a realistic set of short-chain fatty acids from an input of glucose, If we let the composition of the microbial subpopulations change during invasion of adjacent space, a complex and stratified microbiota evolves, with subspecies specializing on cross-feeding interactions via a mechanism of compensated trait loss. The microbial diversity and stratification collapse if the flux through the gut is enhanced to mimic diarrhea. Conclusions In conclusion, this in silico model is a helpful tool in systems biology to predict and explain the controlling factors of microbial diversity in the gut. It can be extended to include, e.g., complex nutrient sources, and host-microbiota interactions via the intestinal wall.

Background Cellular behaviors are governed by interaction networks among biomolecules, for example gene regulatory and signal transduction networks. An often used dynamic modeling framework for these networks, Boolean modeling, can obtain their attractors (which correspond to cell types and behaviors) and their trajectories from an initial state (e.g. a resting state) to the attractors, for example in response to an external signal. The existing methods however do not elucidate the causal relationships between distant nodes in the network. Results In this work, we propose a simple logic framework, based on categorizing causal relationships as sufficient or necessary, as a complement to Boolean networks. We identify and explore the properties of complex subnetworks that are distillable into a single logic relationship. We also identify cyclic subnetworks that ensure the stabilization of the state of participating nodes regardless of the rest of the network. We identify the logic backbone of biomolecular networks, consisting of external signals, self-sustaining cyclic subnetworks (stable motifs), and output nodes. Furthermore, we use the logic framework to identify crucial nodes whose override can drive the system from one steady state to another. We apply these techniques to two biological networks: the epithelial-to-mesenchymal transition network corresponding to a developmental process exploited in tumor invasion, and the network of abscisic acid induced stomatal closure in plants. We find interesting subnetworks with logical implications in these networks. Using these subgraphs and motifs, we efficiently reduce both networks to succinct backbone structures. Conclusions The logic representation identifies the causal relationships between distant nodes and subnetworks. This knowledge can form the basis of network control or used in the reverse engineering of networks.

Background It is well known that the deterministic dynamics of biochemical reaction networks can be more easily studied if timescale separation conditions are invoked (the quasi-steady-state assumption). In this case the deterministic dynamics of a large network of elementary reactions are well described by the dynamics of a smaller network of effective reactions. Each of the latter represents a group of elementary reactions in the large network and has associated with it an effective macroscopic rate law. A popular method to achieve model reduction in the presence of intrinsic noise consists of using the effective macroscopic rate laws to heuristically deduce effective probabilities for the effective reactions which then enables simulation via the stochastic simulation algorithm (SSA). The validity of this heuristic SSA method is a priori doubtful because the reaction probabilities for the SSA have only been rigorously derived from microscopic physics arguments for elementary reactions. Results We here obtain, by rigorous means and in closed-form, a reduced linear Langevin equation description of the stochastic dynamics of monostable biochemical networks in conditions characterized by small intrinsic noise and timescale separation. The slow-scale linear noise approximation (ssLNA), as the new method is called, is used to calculate the intrinsic noise statistics of enzyme and gene networks. The results agree very well with SSA simulations of the non-reduced network of elementary reactions. In contrast the conventional heuristic SSA is shown to overestimate the size of noise for Michaelis-Menten kinetics, considerably under-estimate the size of noise for Hill-type kinetics and in some cases even miss the prediction of noise-induced oscillations. Conclusions A new general method, the ssLNA, is derived and shown to correctly describe the statistics of intrinsic noise about the macroscopic concentrations under timescale separation conditions. The ssLNA provides a simple and accurate means of performing stochastic model reduction and hence it is expected to be of widespread utility in studying the dynamics of large noisy reaction networks, as is common in computational and systems biology.

Background Angiogenesis is important in physiological and pathological conditions, as blood vessels provide nutrients and oxygen needed for tissue growth and survival. Therefore, targeting angiogenesis is a prominent strategy in both tissue engineering and cancer treatment. However, not all of the approaches to promote or inhibit angiogenesis lead to successful outcomes. Angiogenesis-based therapies primarily target pro-angiogenic factors such as vascular endothelial growth factor-A (VEGF) or fibroblast growth factor (FGF) in isolation. However, pre-clinical and clinical evidence shows these therapies often have limited effects. To improve therapeutic strategies, including targeting FGF and VEGF in combination, we need a quantitative understanding of the how the promoters combine to stimulate angiogenesis. Results In this study, we trained and validated a detailed mathematical model to quantitatively characterize the crosstalk of FGF and VEGF intracellular signaling. This signaling is initiated by FGF binding to the FGF receptor 1 (FGFR1) and heparan sulfate glycosaminoglycans (HSGAGs) or VEGF binding to VEGF receptor 2 (VEGFR2) to promote downstream signaling. The model focuses on FGF- and VEGF-induced mitogen-activated protein kinase (MAPK) signaling and phosphorylation of extracellular regulated kinase (ERK), which promotes cell proliferation. We apply the model to predict the dynamics of phosphorylated ERK (pERK) in response to the stimulation by FGF and VEGF individually and in combination. The model predicts that FGF and VEGF have differential effects on pERK. Additionally, since VEGFR2 upregulation has been observed in pathological conditions, we apply the model to investigate the effects of VEGFR2 density and trafficking parameters. The model predictions show that these parameters significantly influence the response to VEGF stimulation. Conclusions The model agrees with experimental data and is a framework to synthesize and quantitatively explain experimental studies. Ultimately, the model provides mechanistic insight into FGF and VEGF interactions needed to identify potential targets for pro- or anti-angiogenic therapies.

Background Waddington’s epigenetic landscape is an intuitive metaphor for the developmental and evolutionary potential of biological regulatory processes. It emphasises time-dependence and transient behaviour. Nowadays, we can derive this landscape by modelling a specific regulatory network as a dynamical system and calculating its so-called potential surface. In this sense, potential surfaces are the mathematical equivalent of the Waddingtonian landscape metaphor. In order to fully capture the time-dependent (non-autonomous) transient behaviour of biological processes, we must be able to characterise potential landscapes and how they change over time. However, currently available mathematical tools focus on the asymptotic (steady-state) behaviour of autonomous dynamical systems, which restricts how biological systems are studied. Results We present a pragmatic first step towards a methodology for dealing with transient behaviours in non-autonomous systems. We propose a classification scheme for different kinds of such dynamics based on the simulation of a simple genetic toggle-switch model with time-variable parameters. For this low-dimensional system, we can calculate and explicitly visualise numerical approximations to the potential landscape. Focussing on transient dynamics in non-autonomous systems reveals a range of interesting and biologically relevant behaviours that would be missed in steady-state analyses of autonomous systems. Our simulation-based approach allows us to identify four qualitatively different kinds of dynamics: transitions, pursuits, and two kinds of captures. We describe these in detail, and illustrate the usefulness of our classification scheme by providing a number of examples that demonstrate how it can be employed to gain specific mechanistic insights into the dynamics of gene regulation. Conclusions The practical aim of our proposed classification scheme is to make the analysis of explicitly time-dependent transient behaviour tractable, and to encourage the wider use of non-autonomous models in systems biology. Our method is applicable to a large class of biological processes.

Background Heterogeneous gene expressions of cells are widely observed in self-renewing pluripotent stem cells, suggesting possible coexistence of multiple cellular states with distinct characteristics. Though the elements regulating cellular states have been identified, the underlying dynamic mechanisms and the significance of such cellular heterogeneity remain elusive. Results We present a gene regulatory network model to investigate the bimodal Nanog distribution in stem cells. Our model reveals a novel role of dynamic conversion between the cellular states of high and low Nanog levels. Model simulations demonstrate that the low-Nanog state benefits cell differentiation through serving as an intermediate state to reduce the barrier of transition. Interestingly, the existence of low-Nanog state dynamically slows down the reprogramming process, and additional Nanog activation is found to be essential to quickly attaining the fully reprogrammed cell state. Conclusions Nanog has been recognized as a critical pluripotency gene in stem cell regulation. Our modeling results quantitatively show a dual role of Nanog during stem cell differentiation and reprogramming, and the importance of the intermediate state during cell state transitions. Our approach offers a general method for analyzing key regulatory factors controlling cell differentiation and reprogramming.

Background Reaction gap filling is a computational technique for proposing the addition of reactions to genome-scale metabolic models to permit those models to run correctly. Gap filling completes what are otherwise incomplete models that lack fully connected metabolic networks. The models are incomplete because they are derived from annotated genomes in which not all enzymes have been identified. Here we compare the results of applying an automated likelihood-based gap filler within the Pathway Tools software with the results of manually gap filling the same metabolic model. Both gap-filling exercises were applied to the same genome-derived qualitative metabolic reconstruction for Bifidobacterium longum subsp. longum JCM 1217, and to the same modeling conditions — anaerobic growth under four nutrients producing 53 biomass metabolites. Results The solution computed by the gap-filling program GenDev contained 12 reactions, but closer examination showed that solution was not minimal; two of the twelve reactions can be removed to yield a set of ten reactions that enable model growth. The manually curated solution contained 13 reactions, eight of which were shared with the 12-reaction computed solution. Thus, GenDev achieved recall of 61.5% and precision of 66.6%. These results suggest that although computational gap fillers are populating metabolic models with significant numbers of correct reactions, automatically gap-filled metabolic models also contain significant numbers of incorrect reactions. Conclusions Our conclusion is that manual curation of gap-filler results is needed to obtain high-accuracy models. Many of the differences between the manual and automatic solutions resulted from using expert biological knowledge to direct the choice of reactions within the curated solution, such as reactions specific to the anaerobic lifestyle of B. longum .