Training signaling pathway maps to biochemical data with constrained fuzzy logic: quantitative analysis of liver cell responses to inflammatory stimuli

Predictive understanding of cell signaling network operation based on general prior knowledge but consistent with empirical data in a specific environmental context is a current challenge in computational biology. Recent work has demonstrated that Boolean logic can be used to create context-specific network models by training proteomic pathway maps to dedicated biochemical data; however, the Boolean formalism is restricted to characterizing protein species as either fully active or inactive. To advance beyond this limitation, we propose a novel form of fuzzy logic sufficiently flexible to model quantitative data but also sufficiently simple to efficiently construct models by training pathway maps on dedicated experimental measurements. Our new approach, termed constrained fuzzy logic (cFL), converts a prior knowledge network (obtained from literature or interactome databases) into a computable model that describes graded values of protein activation across multiple pathways. We train a cFL-converted network to experimental data describing hepatocytic protein activation by inflammatory cytokines and demonstrate the application of the resultant trained models for three important purposes: (a) generating experimentally testable biological hypotheses concerning pathway crosstalk, (b) establishing capability for quantitative prediction of protein activity, and (c) prediction and understanding of the cytokine release phenotypic response. Our methodology systematically and quantitatively trains a protein pathway map summarizing curated literature to context-specific biochemical data. This process generates a computable model yielding successful prediction of new test data and offering biological insight into complex datasets that are difficult to fully analyze by intuition alone.     

Dynamic Bayesian network and nonparametric regression for nonlinear modeling of gene networks from time series gene expression data

We propose a dynamic Bayesian network and nonparametric regression model for constructing a gene network from time series microarray gene expression data. The proposed method can overcome a shortcoming of the Bayesian network model in the sense of the construction of cyclic regulations. The proposed method can analyze the microarray data as a continuous data and can capture even nonlinear relations among genes. It can be expected that this model will give a deeper insight into complicated biological systems. We also derive a new criterion for evaluating an estimated network from Bayes approach. We conduct Monte Carlo experiments to examine the effectiveness of the proposed method. We also demonstrate the proposed method through the analysis of the Saccharomyces cerevisiae gene expression data.     

Development of predictive models of laboratory animal growth using artificial neural networks

Traditional regression analysis of body weight growth curvesencounters problems .when the data are extremely variable. Whiletransformations are often employed to meet the criteria of theanalysis, some transformations are inadequate for normalizingthe data. Regression analysis also requires presuppositionsregarding the model to be fit and the techniques to be usedin the analysis. An alternative approach using artificial neuralnetworks is presented which may be suitable for developing predictivemodels of growth. Neural networks are simulators of the processesthat occur in the biological brain during the learning process.They are trained on the data, developing the necessary algorithmswithin their internal architecture, and produce a predictivemodel based on the learned facts. A dataset of Sprague–Dawleyrat (Rattus norvegicus) weights is analyzed by both traditionalregression analysis and neural network training. Predictionsof body weight are made from both models. While both methodsproduce models that adequately predict the body weights, theneural network model is superior in that it combines accuracyand precision, being less influenced by longitudinal variabilityin the data. Thus, the neural network provides another toolfor researchers to analyze growth curve data.     

Protein complex detection with semi-supervised learning in protein interaction networks

Background

Protein-protein interactions (PPIs) play fundamental roles in nearly all biological processes. The systematic analysis of PPI networks can enable a great understanding of cellular organization, processes and function. In this paper, we investigate the problem of protein complex detection from noisy protein interaction data, i.e., finding the subsets of proteins that are closely coupled via protein interactions. However, protein complexes are likely to overlap and the interaction data are very noisy. It is a great challenge to effectively analyze the massive data for biologically meaningful protein complex detection.

Results

Many people try to solve the problem by using the traditional unsupervised graph clustering methods. Here, we stand from a different point of view, redefining the properties and features for protein complexes and designing a “semi-supervised” method to analyze the problem. In this paper, we utilize the neural network with the “semi-supervised” mechanism to detect the protein complexes. By retraining the neural network model recursively, we could find the optimized parameters for the model, in such a way we can successfully detect the protein complexes. The comparison results show that our algorithm could identify protein complexes that are missed by other methods. We also have shown that our method achieve better precision and recall rates for the identified protein complexes than other existing methods. In addition, the framework we proposed is easy to be extended in the future.

Conclusions

Using a weighted network to represent the protein interaction network is more appropriate than using a traditional unweighted network. In addition, integrating biological features and topological features to represent protein complexes is more meaningful than using dense subgraphs. Last, the “semi-supervised” learning model is a promising model to detect protein complexes with more biological and topological features available.

     

Modularized learning of genetic interaction networks from biological annotations and mRNA expression data

MOTIVATION: Inferring the genetic interaction mechanism using Bayesian networks has recently drawn increasing attention due to its well-established theoretical foundation and statistical robustness. However, the relative insufficiency of experiments with respect to the number of genes leads to many false positive inferences. RESULTS: We propose a novel method to infer genetic networks by alleviating the shortage of available mRNA expression data with prior knowledge. We call the proposed method 'modularized network learning' (MONET). Firstly, the proposed method divides a whole gene set to overlapped modules considering biological annotations and expression data together. Secondly, it infers a Bayesian network for each module, and integrates the learned subnetworks to a global network. An algorithm that measures a similarity between genes based on hierarchy, specificity and multiplicity of biological annotations is presented. The proposed method draws a global picture of inter-module relationships as well as a detailed look of intra-module interactions. We applied the proposed method to analyze Saccharomyces cerevisiae stress data, and found several hypotheses to suggest putative functions of unclassified genes. We also compared the proposed method with a whole-set-based approach and two expression-based clustering approaches.     

IntNetDB v1.0: an integrated protein-protein interaction network database generated by a probabilistic model

Background  

Although protein-protein interaction (PPI) networks have been explored by various experimental methods, the maps so built are still limited in coverage and accuracy. To further expand the PPI network and to extract more accurate information from existing maps, studies have been carried out to integrate various types of functional relationship data. A frequently updated database of computationally analyzed potential PPIs to provide biological researchers with rapid and easy access to analyze original data as a biological network is still lacking.     

Using network models to approximate spatial point-process models

Spatial effects are fundamental to ecological and epidemiological systems, yet the incorporation of space into models is potentially complex. Fixed-edge network models (i.e. networks where each edge has the same fixed strength of interaction) are widely used to study spatial processes but they make simplistic assumptions about spatial scale and structure. Furthermore, it can be difficult to parameterize such models with empirical data. By comparison, spatial point-process models are often more realistic than fixed-edge network models, but are also more difficult to analyze. Here we develop a moment closure technique that allows us to define a fixed-edge network model which predicts the prevalence and rate of epidemic spread of a continuous spatial point-process epidemic model. This approach provides a systematic method for accurate parameterization of network models using data from continuously distributed populations (such as data on dispersal kernels). Insofar as point-process models are accurate representations of real spatial biological systems, our example also supports the view that network models are realistic representations of space.     

Create and assess protein networks through molecular characteristics of individual proteins

MOTIVATION: The study of biological systems, pathways and processes relies increasingly on analyses of networks. Most often, such analyses focus on network topology, thereby treating all proteins or genes as identical, featureless nodes. Integrating molecular data and insights about the qualities of individual proteins into the analysis may enhance our ability to decipher biological pathways and processes. RESULTS: Here, we introduce a novel platform for data integration that generates networks on the macro system-level, analyzes the molecular characteristics of each protein on the micro level, and then combines the two levels by using the molecular characteristics to assess networks. It also annotates the function and subcellular localization of each protein and displays the process on an image of a cell, rendering each protein in its respective cellular compartment. By thus visualizing the network in a cellular context we are able to analyze pathways and processes in a novel way. As an example, we use the system to analyze proteins implicated with Alzheimers disease and show how the integrated view corroborates previous observations and how it helps in the formulation of new hypotheses regarding the molecular underpinnings of the disease. AVAILABILITY: http://www.rostlab.org/services/pinat.     

Integrating external biological knowledge in the construction of regulatory networks from time-series expression data

ABSTRACT: BACKGROUND: Inference about regulatory networks from high-throughput genomics data is of great interest in systems biology. We present a Bayesian approach to infer gene regulatory networks from time series expression data by integrating various types of biological knowledge. RESULTS: We formulate network construction as a series of variable selection problems and use linear regression to model the data. Our method summarizes additional data sources with an informative prior probability distribution over candidate regression models. We extend the Bayesian model averaging (BMA) variable selection method to select regulators in the regression framework. We summarize the external biological knowledge by an informative prior probability distribution over the candidate regression models. CONCLUSIONS: We demonstrate our method on simulated data and a set of time-series microarray experiments measuring the effect of a drug perturbation on gene expression levels, and show that it outperforms leading regression-based methods in the literature.     

A biological approach to computational models of proteomic networks

Computational modeling is useful as a means to assemble and test what we know about proteins and networks. Models can help address key questions about the measurement, definition and function of proteomic networks. Here, we place these biological questions at the forefront in reviewing the computational strategies that are available to analyze proteomic networks. Recent examples illustrate how models can extract more information from proteomic data, test possible interactions between network proteins and link networks to cellular behavior. No single model can achieve all these goals, however, which is why it is critical to prioritize biological questions before specifying a particular modeling approach.     

Inference of scale-free networks from gene expression time series

Quantitative time-series observation of gene expression is becoming possible, for example by cell array technology. However, there are no practical methods with which to infer network structures using only observed time-series data. As most computational models of biological networks for continuous time-series data have a high degree of freedom, it is almost impossible to infer the correct structures. On the other hand, it has been reported that some kinds of biological networks, such as gene networks and metabolic pathways, may have scale-free properties. We hypothesize that the architecture of inferred biological network models can be restricted to scale-free networks. We developed an inference algorithm for biological networks using only time-series data by introducing such a restriction. We adopt the S-system as the network model, and a distributed genetic algorithm to optimize models to fit its simulated results to observed time series data. We have tested our algorithm on a case study (simulated data). We compared optimization under no restriction, which allows for a fully connected network, and under the restriction that the total number of links must equal that expected from a scale free network. The restriction reduced both false positive and false negative estimation of the links and also the differences between model simulation and the given time-series data.     

A modified Ising model of Barabási–Albert network with gene-type spins

The central question of systems biology is to understand how individual components of a biological system such as genes or proteins cooperate in emerging phenotypes resulting in the evolution of diseases. As living cells are open systems in quasi-steady state type equilibrium in continuous exchange with their environment, computational techniques that have been successfully applied in statistical thermodynamics to describe phase transitions may provide new insights to the emerging behavior of biological systems. Here we systematically evaluate the translation of computational techniques from solid-state physics to network models that closely resemble biological networks and develop specific translational rules to tackle problems unique to living systems. We focus on logic models exhibiting only two states in each network node. Motivated by the apparent asymmetry between biological states where an entity exhibits boolean states i.e. is active or inactive, we present an adaptation of symmetric Ising model towards an asymmetric one fitting to living systems here referred to as the modified Ising model with gene-type spins. We analyze phase transitions by Monte Carlo simulations and propose a mean-field solution of a modified Ising model of a network type that closely resembles a real-world network, the Barabási–Albert model of scale-free networks. We show that asymmetric Ising models show similarities to symmetric Ising models with the external field and undergoes a discontinuous phase transition of the first-order and exhibits hysteresis. The simulation setup presented herein can be directly used for any biological network connectivity dataset and is also applicable for other networks that exhibit similar states of activity. The method proposed here is a general statistical method to deal with non-linear large scale models arising in the context of biological systems and is scalable to any network size.

     

基于神经网络原理的荧光寿命成像研究

荧光寿命成像技术(fhlorescence lifetime imaging,FLIM)是一种新颖且功能强大的、能用于复杂生物组织和细胞结构与功能分析的生物组织成像技术。传统的时域荧光寿命成像数据分析方法,由于没有考虑荧光分子团之间以及他们与周围环境的相互作用,可能导致复杂的连续分布荧光寿命这一实际情况,因此对生物组织中自发荧光发光强度衰减过程的实验数据拟合效果欠佳。文章提出利用人工神经网络(artificial neural network,ANN)原理拟合算法来计算生物荧光分子团衰减动力过程,该方法能有效地建立生物荧光分子团衰减动力过程的非线性模型,并且具有处理非线性模型能力强、鲁棒性好、拟合精度高和所需计算时间少等优点。通过计算证明,相对于单参量指数与多参量指数衰减函数,这种数据拟合方法对于某些荧光分子团的多槽基面效价测定样品(multi-well plate assays)的数据有更好的一致性和更小的计算量。同时在文章中讨论了将该拟合算法应用于荧光寿命成像的前景。     

From Enzyme Kinetics to Metabolic Network Modeling – Visualization Tool for Enhanced Kinetic Analysis of Biochemical Network Models

Model‐based analysis of enzyme kinetics allows the determination of optimal conditions for their use in biocatalysis. For biotransformations or fermentative approaches the modeling of metabolic pathways or complex metabolic networks is necessary to obtain model‐based predictions of steps which limit product formation within the network. To set up adequate kinetic models, relevant mechanistic information about enzyme properties is required and can be taken from in vitro studies with isolated enzymes or from in vivo investigations using stimulus‐response experiments which provide a lot of kinetic information about the metabolic network. But with increasing number of reaction steps and regulatory interdependencies in the network structure the amount of simulation data dramatically increases and the simulation results from the dynamic models become difficult to analyze and interpret. Demonstrated for an Escherichia coli model of the central carbon metabolism, methods for visualization and animation of simulation data were applied and extended to facilitate model analysis and biological interpretation. The dynamic metabolite pool and metabolic flux changes were visualized simultaneously by a software tool. In addition, a new quantification method for enzyme activation/inhibition was proposed, and this information was implemented in the metabolic visualization.     

An error model for protein quantification

MOTIVATION: Quantitative experimental data is the critical bottleneck in the modeling of dynamic cellular processes in systems biology. Here, we present statistical approaches improving reproducibility of protein quantification by immunoprecipitation and immunoblotting. RESULTS: Based on a large data set with more than 3600 data points, we unravel that the main sources of biological variability and experimental noise are multiplicative and log-normally distributed. Therefore, we suggest a log-transformation of the data to obtain additive normally distributed noise. After this transformation, common statistical procedures can be applied to analyze the data. An error model is introduced to account for technical as well as biological variability. Elimination of these systematic errors decrease variability of measurements and allow for a more precise estimation of underlying dynamics of protein concentrations in cellular signaling. The proposed error model is relevant for simulation studies, parameter estimation and model selection, basic tools of systems biology. AVAILABILITY: Matlab and R code is available from the authors on request. The data can be downloaded from our website www.fdm.uni-freiburg.de/~ckreutz/data.