Ionophore-induced oscillations in erythrocytes. A kinetic model

The kinetic model for K+, H+, Ca2+ concentrational self-oscillations in erythrocytes induced by A23187 and FCCP ionophores are considered. The model is based on the experimental data available and contains the minimal number of essential variables. The model was analysed by the method based on the graph representation of kinetic equations. The critical graph fragments provoking self-oscillatory trajectories in the system were revealed. It is shown that self-oscillatory behaviour is basically induced by conjugated processes produced by A23187. The parameter domain for self-oscillations is estimated including parameters of Ca2+-induced (through K+-channels) proton transport with FCCP participation. Numerical integration of kinetic equations was performed. The results obtained are in a good qualitative agreement with experimental data.     

A probabilistic methodology for integrating knowledge and experiments on biological networks.

Biological systems are traditionally studied by focusing on a specific subsystem, building an intuitive model for it, and refining the model using results from carefully designed experiments. Modern experimental techniques provide massive data on the global behavior of biological systems, and systematically using these large datasets for refining existing knowledge is a major challenge. Here we introduce an extended computational framework that combines formalization of existing qualitative models, probabilistic modeling, and integration of high-throughput experimental data. Using our methods, it is possible to interpret genomewide measurements in the context of prior knowledge on the system, to assign statistical meaning to the accuracy of such knowledge, and to learn refined models with improved fit to the experiments. Our model is represented as a probabilistic factor graph, and the framework accommodates partial measurements of diverse biological elements. We study the performance of several probabilistic inference algorithms and show that hidden model variables can be reliably inferred even in the presence of feedback loops and complex logic. We show how to refine prior knowledge on combinatorial regulatory relations using hypothesis testing and derive p-values for learned model features. We test our methodology and algorithms on a simulated model and on two real yeast models. In particular, we use our method to explore uncharacterized relations among regulators in the yeast response to hyper-osmotic shock and in the yeast lysine biosynthesis system. Our integrative approach to the analysis of biological regulation is demonstrated to synergistically combine qualitative and quantitative evidence into concrete biological predictions.     

Meanfield approach to the thermodynamics of protein-solvent systems with application to p53

We present a meanfield theoretical approach for studying protein-solvent interactions. Starting with the partition function of the system, we develop a field theory by introducing densities for the different components of the system. At this point, protein-solvent interactions are introduced following the inhomogeneous Flory-Huggins model for polymers. Finally, we calculate the free energy in a meanfield approximation. We apply this method to study the stability of the tetramerization domain of the tumor suppressor protein p53 when subjected to site-directed mutagenesis. The four chains of this protein are held together by hydrophobic interactions, and some mutations can weaken this bond while preserving the secondary structure of the single protein chains. We find good qualitative agreement between our numerical results and experimental data, thus encouraging the use of this method as a guide in designing experiments.     

Detecting and Removing Inconsistencies between Experimental Data and Signaling Network Topologies Using Integer Linear Programming on Interaction Graphs

Cross-referencing experimental data with our current knowledge of signaling network topologies is one central goal of mathematical modeling of cellular signal transduction networks. We present a new methodology for data-driven interrogation and training of signaling networks. While most published methods for signaling network inference operate on Bayesian, Boolean, or ODE models, our approach uses integer linear programming (ILP) on interaction graphs to encode constraints on the qualitative behavior of the nodes. These constraints are posed by the network topology and their formulation as ILP allows us to predict the possible qualitative changes (up, down, no effect) of the activation levels of the nodes for a given stimulus. We provide four basic operations to detect and remove inconsistencies between measurements and predicted behavior: (i) find a topology-consistent explanation for responses of signaling nodes measured in a stimulus-response experiment (if none exists, find the closest explanation); (ii) determine a minimal set of nodes that need to be corrected to make an inconsistent scenario consistent; (iii) determine the optimal subgraph of the given network topology which can best reflect measurements from a set of experimental scenarios; (iv) find possibly missing edges that would improve the consistency of the graph with respect to a set of experimental scenarios the most. We demonstrate the applicability of the proposed approach by interrogating a manually curated interaction graph model of EGFR/ErbB signaling against a library of high-throughput phosphoproteomic data measured in primary hepatocytes. Our methods detect interactions that are likely to be inactive in hepatocytes and provide suggestions for new interactions that, if included, would significantly improve the goodness of fit. Our framework is highly flexible and the underlying model requires only easily accessible biological knowledge. All related algorithms were implemented in a freely available toolbox SigNetTrainer making it an appealing approach for various applications.     

Unravelling the functional interaction structure of a cellular network from temporal slope information of experimental data

Due to the unavoidable nonbiological variations accompanying many experiments, it is imperative to consider a way of unravelling the functional interaction structure of a cellular network (e.g. signalling cascades or gene networks) by using the qualitative information of time-series experimental data instead of computation through the measured absolute values. In this spirit, we propose a very simple but effective method of identifying the functional interaction structure of a cellular network based on temporal ascending or descending slope information from given time-series measurements. From this method, we can gain insight into the acceptable measurement error ranges in order to estimate the correct functional interaction structure and we can also find guidance for a new experimental design to complement the insufficient information of a given experimental dataset. We developed experimental sign equations, making use of the temporal slope sign information from time-series experimental data, without a specific assumption on parameter perturbations for each network node. Based on these equations, we further describe the available specific information from each part of experimental data in detail and show the functional interaction structure obtained by integrating such information. In this procedure, we use only simple algebra on sign changes without complicated computations on the measured absolute values of the experimental data. The result is, however, verified through rigorous mathematical definitions and proofs. The present method provides us with information about the acceptable measurement error ranges for correct estimation of the functional interaction structure and it further leads to a new experimental design to complement the given experimental data by informing us about additional specific sampling points to be chosen for further required information.     

The Logic of EGFR/ErbB Signaling: Theoretical Properties and Analysis of High-Throughput Data

The epidermal growth factor receptor (EGFR) signaling pathway is probably the best-studied receptor system in mammalian cells, and it also has become a popular example for employing mathematical modeling to cellular signaling networks. Dynamic models have the highest explanatory and predictive potential; however, the lack of kinetic information restricts current models of EGFR signaling to smaller sub-networks. This work aims to provide a large-scale qualitative model that comprises the main and also the side routes of EGFR/ErbB signaling and that still enables one to derive important functional properties and predictions. Using a recently introduced logical modeling framework, we first examined general topological properties and the qualitative stimulus-response behavior of the network. With species equivalence classes, we introduce a new technique for logical networks that reveals sets of nodes strongly coupled in their behavior. We also analyzed a model variant which explicitly accounts for uncertainties regarding the logical combination of signals in the model. The predictive power of this model is still high, indicating highly redundant sub-structures in the network. Finally, one key advance of this work is the introduction of new techniques for assessing high-throughput data with logical models (and their underlying interaction graph). By employing these techniques for phospho-proteomic data from primary hepatocytes and the HepG2 cell line, we demonstrate that our approach enables one to uncover inconsistencies between experimental results and our current qualitative knowledge and to generate new hypotheses and conclusions. Our results strongly suggest that the Rac/Cdc42 induced p38 and JNK cascades are independent of PI3K in both primary hepatocytes and HepG2. Furthermore, we detected that the activation of JNK in response to neuregulin follows a PI3K-dependent signaling pathway.     

An integrative and practical evolutionary optimization for a complex, dynamic model of biological networks

Computer simulation is an important technique to capture the dynamics of biochemical networks. Numerical optimization is the key to estimate the values of kinetic parameters so that the dynamic model reproduces the behaviors of the existing experimental data. It is required to develop general strategies for the optimization of complex biochemical networks with a huge space of search parameters, under the condition that kinetic and quantitative data are hardly available. We propose an integrative and practical strategy for optimizing a complex dynamic model by using qualitative and incomplete experimental data. The key technologies are the divide and conquer method for reducing the search space, handling of multiple objective functions representing different types of biological behaviors, and design of rule-based objective functions that are suitable for qualitative and error-prone experimental data. This strategy is applied to optimizing a dynamic model of the yeast cell cycle to demonstrate the feasibility of it.     

Graph theoretical model of a sensorimotor connectome in zebrafish

Mapping the detailed connectivity patterns (connectomes) of neural circuits is a central goal of neuroscience. The best quantitative approach to analyzing connectome data is still unclear but graph theory has been used with success. We present a graph theoretical model of the posterior lateral line sensorimotor pathway in zebrafish. The model includes 2,616 neurons and 167,114 synaptic connections. Model neurons represent known cell types in zebrafish larvae, and connections were set stochastically following rules based on biological literature. Thus, our model is a uniquely detailed computational representation of a vertebrate connectome. The connectome has low overall connection density, with 2.45% of all possible connections, a value within the physiological range. We used graph theoretical tools to compare the zebrafish connectome graph to small-world, random and structured random graphs of the same size. For each type of graph, 100 randomly generated instantiations were considered. Degree distribution (the number of connections per neuron) varied more in the zebrafish graph than in same size graphs with less biological detail. There was high local clustering and a short average path length between nodes, implying a small-world structure similar to other neural connectomes and complex networks. The graph was found not to be scale-free, in agreement with some other neural connectomes. An experimental lesion was performed that targeted three model brain neurons, including the Mauthner neuron, known to control fast escape turns. The lesion decreased the number of short paths between sensory and motor neurons analogous to the behavioral effects of the same lesion in zebrafish. This model is expandable and can be used to organize and interpret a growing database of information on the zebrafish connectome.     

GINsim: a software suite for the qualitative modelling, simulation and analysis of regulatory networks

This paper presents GINsim, a Java software suite devoted to the qualitative modelling, analysis and simulation of genetic regulatory networks. Formally, our approach leans on discrete mathematical and graph-theoretical concepts. GINsim encompasses an intuitive graph editor, enabling the definition and the parameterisation of a regulatory graph, as well as a simulation engine to compute the corresponding qualitative dynamical behaviour. Our computational approach is illustrated by a preliminary model analysis of the inter-cellular regulatory network activating Notch at the dorsal-ventral boundary in the wing imaginal disc of Drosophila. We focus on the cross-regulations between five genes (within and between two cells), which implements the dorsal-ventral border in the developing imaginal disc. Our simulations qualitatively reproduce the wild-type developmental pathway, as well as the outcome of various types of experimental perturbations, such as loss-of-function mutations or ectopically induced gene expression.     

Inferring proteolytic processes from mass spectrometry time series data using degradation graphs

Background

Proteases play an essential part in a variety of biological processes. Besides their importance under healthy conditions they are also known to have a crucial role in complex diseases like cancer. In recent years, it has been shown that not only the fragments produced by proteases but also their dynamics, especially ex vivo, can serve as biomarkers. But so far, only a few approaches were taken to explicitly model the dynamics of proteolysis in the context of mass spectrometry.

Results

We introduce a new concept to model proteolytic processes, the degradation graph. The degradation graph is an extension of the cleavage graph, a data structure to reconstruct and visualize the proteolytic process. In contrast to previous approaches we extended the model to incorporate endoproteolytic processes and present a method to construct a degradation graph from mass spectrometry time series data. Based on a degradation graph and the intensities extracted from the mass spectra it is possible to estimate reaction rates of the underlying processes. We further suggest a score to rate different degradation graphs in their ability to explain the observed data. This score is used in an iterative heuristic to improve the structure of the initially constructed degradation graph.

Conclusion

We show that the proposed method is able to recover all degraded and generated peptides, the underlying reactions, and the reaction rates of proteolytic processes based on mass spectrometry time series data. We use simulated and real data to demonstrate that a given process can be reconstructed even in the presence of extensive noise, isobaric signals and false identifications. While the model is currently only validated on peptide data it is also applicable to proteins, as long as the necessary time series data can be produced.     

Adapting genetic regulatory models by genetic programming

In this paper, we focus on the task of adapting genetic regulatory models based on gene expression data from microarrays. Our approach aims at automatic revision of qualitative regulatory models to improve their fit to expression data. We describe a type of regulatory model designed for this purpose, a method for predicting the quality of such models, and a method for adapting the models by means of genetic programming. We also report experimental results highlighting the ability of the methods to infer models on a number of artificial data sets. In closing, we contrast our results with those of alternative methods, after which we give some suggestions for future work.     

An efficient randomized algorithm for contact-based NMR backbone resonance assignment

MOTIVATION: Backbone resonance assignment is a critical bottleneck in studies of protein structure, dynamics and interactions by nuclear magnetic resonance (NMR) spectroscopy. A minimalist approach to assignment, which we call 'contact-based', seeks to dramatically reduce experimental time and expense by replacing the standard suite of through-bond experiments with the through-space (nuclear Overhauser enhancement spectroscopy, NOESY) experiment. In the contact-based approach, spectral data are represented in a graph with vertices for putative residues (of unknown relation to the primary sequence) and edges for hypothesized NOESY interactions, such that observed spectral peaks could be explained if the residues were 'close enough'. Due to experimental ambiguity, several incorrect edges can be hypothesized for each spectral peak. An assignment is derived by identifying consistent patterns of edges (e.g. for alpha-helices and beta-sheets) within a graph and by mapping the vertices to the primary sequence. The key algorithmic challenge is to be able to uncover these patterns even when they are obscured by significant noise. RESULTS: This paper develops, analyzes and applies a novel algorithm for the identification of polytopes representing consistent patterns of edges in a corrupted NOESY graph. Our randomized algorithm aggregates simplices into polytopes and fixes inconsistencies with simple local modifications, called rotations, that maintain most of the structure already uncovered. In characterizing the effects of experimental noise, we employ an NMR-specific random graph model in proving that our algorithm gives optimal performance in expected polynomial time, even when the input graph is significantly corrupted. We confirm this analysis in simulation studies with graphs corrupted by up to 500% noise. Finally, we demonstrate the practical application of the algorithm on several experimental beta-sheet datasets. Our approach is able to eliminate a large majority of noise edges and to uncover large consistent sets of interactions. AVAILABILITY: Our algorithm has been implemented in the platform-independent Python code. The software can be freely obtained for academic use by request from the authors.     

Protein model discrimination attempts using mutational sensitivity,predicted secondary structure,and model quality information

Structure prediction methods often generate a large number of models for a target sequence. Even if the correct fold for the target sequence is sampled in this dataset, it is difficult to distinguish it from other decoy structures. An attempt to solve this problem using experimental mutational sensitivity data for the CcdB protein was described previously by exploiting the correlation of residue depth with mutational sensitivity (r ~ 0.6). We now show that such a correlation extends to four other proteins with localized active sites, and for which saturation mutagenesis datasets exist. We also examine whether incorporation of predicted secondary structure information and the DOPE model quality assessment score, in addition to mutational sensitivity, improves the accuracy of model discrimination using a decoy dataset of 163 targets from CASP. Although most CASP models would have been subjected to model quality assessment prior to submission, we find that the DOPE score makes a substantial contribution to the observed improvement. We therefore also applied the approach to CcdB and four other proteins for which reliable experimental mutational data exist and observe that inclusion of experimental mutational data results in a small qualitative improvement in model discrimination relative to that seen with just the DOPE score. This is largely because of our limited ability to quantitatively predict effects of point mutations on in vivo protein activity. Further improvements in the methodology are required to facilitate improved utilization of single mutant data.     

An artificial neural network approach for glomerular activity pattern prediction using the graph kernel method and the gaussian mixture functions

This paper proposes a neural network model for prediction of olfactory glomerular activity aimed at future application to the evaluation of odor qualities. The model's input is the structure of an odorant molecule expressed as a labeled graph, and it employs the graph kernel method to quantify structural similarities between odorants and the function of olfactory receptor neurons. An artificial neural network then converts odorant molecules into glomerular activity expressed in Gaussian mixture functions. The authors also propose a learning algorithm that allows adjustment of the parameters included in the model using a learning data set composed of pairs of odorants and measured glomerular activity patterns. We observed that the defined similarity between odorant structure has correlation of 0.3-0.9 with that of glomerular activity. Glomerular activity prediction simulation showed a certain level of prediction ability where the predicted glomerular activity patterns also correlate the measured ones with middle to high correlation in average for data sets containing 363 odorants.     

Optimization of 3D Poisson–Nernst‐Planck model for fast evaluation of diverse protein channels

We show the accuracy and applicability of our fast algorithmic implementation of a three‐dimensional Poisson–Nernst–Planck (3D‐PNP) flow model for characterizing different protein channels. Due to its high computational efficiency, our model can predict the full current‐voltage characteristics of a channel within minutes, based on the experimental 3D structure of the channel or its computational model structure. Compared with other methods, such as Brownian dynamics, which currently needs a few weeks of the computational time, or even much more demanding molecular dynamics modeling, 3D‐PNP is the only available method for a function‐based evaluation of very numerous tentative structural channel models. Flow model tests of our algorithm and its optimal parametrization are provided for five native channels whose experimental structures are available in the protein data bank (PDB) in an open conductive state, and whose experimental current‐voltage characteristics have been published. The channels represent very different geometric and structural properties, which makes it the widest test to date of the accuracy of 3D‐PNP on real channels. We test whether the channel conductance, rectification, and charge selectivity obtained from the flow model, could be sufficiently sensitive to single‐point mutations, related to unsignificant changes in the channel structure. Our results show that the classical 3D‐PNP model, under proper parametrization, is able to achieve a qualitative agreement with experimental data for a majority of the tested characteristics and channels, including channels with narrow and irregular conductivity pores. We propose that although the standard PNP model cannot provide insight into complex physical phenomena due to its intrinsic limitations, its semiquantitative agreement is achievable for rectification and selectivity at a level sufficient for the bioinformatical purpose of selecting the best structural models with a great advantage of a very short computational time. Proteins 2013; 81:1802–1822. © 2013 Wiley Periodicals, Inc.     

Graph-based deconvolution analysis of multiplex sandwich microarray immunoassays: applications for environmental monitoring

The sandwich microarray immunoassay (SMI) is a powerful technique for the analysis and characterization of environmental samples, from the identification of microorganisms to specific bioanalytes. As the number of antibodies increases, however, unspecific binding and cross-reactivity can become a problem. To cope with such difficulties, we present here the concept of antibody graph associated to a sandwich antibody microarray. Antibody graphs give valuable information about the antibody cross-reactivity network and all the players involved in the sandwich format: capturing and tracer antibodies, the antigenic sample and the degree of cross-reactivity between antibodies. Making use of the information contained in the antibody graph, we have developed a deconvolution method that disentangles the antibody cross-reactivity events and gives qualitative information about the composition of the experimental sample under study. We have validated the method by using a 66 antibody-containing microarray to describe known antigenic mixtures as well as natural environmental samples characterized by 16S-RNA gene phylogenetic analysis. The application of our antibody graph and deconvolution method allowed us to discriminate between true specific antigen-antibody reactions and spurious signals on a microarray designed for environmental monitoring.     

A Bayesian framework for inference of the genotype-phenotype map for segregating populations

Complex genetic interactions lie at the foundation of many diseases. Understanding the nature of these interactions is critical to developing rational intervention strategies. In mammalian systems hypothesis testing in vivo is expensive, time consuming, and often restricted to a few physiological endpoints. Thus, computational methods that generate causal hypotheses can help to prioritize targets for experimental intervention. We propose a Bayesian statistical method to infer networks of causal relationships among genotypes and phenotypes using expression quantitative trait loci (eQTL) data from genetically randomized populations. Causal relationships between network variables are described with hierarchical regression models. Prior distributions on the network structure enforce graph sparsity and have the potential to encode prior biological knowledge about the network. An efficient Monte Carlo method is used to search across the model space and sample highly probable networks. The result is an ensemble of networks that provide a measure of confidence in the estimated network topology. These networks can be used to make predictions of system-wide response to perturbations. We applied our method to kidney gene expression data from an MRL/MpJ × SM/J intercross population and predicted a previously uncharacterized feedback loop in the local renin-angiotensin system.     

Using formal concept analysis for microarray data comparison

Microarray technologies, which can measure tens of thousands of gene expression values simultaneously in a single experiment, have become a common research method for biomedical researchers. Computational tools to analyze microarray data for biological discovery are needed. In this paper, we investigate the feasibility of using formal concept analysis (FCA) as a tool for microarray data analysis. The method of FCA builds a (concept) lattice from the experimental data together with additional biological information. For microarray data, each vertex of the lattice corresponds to a subset of genes that are grouped together according to their expression values and some biological information related to gene function. The lattice structure of these gene sets might reflect biological relationships in the dataset. Similarities and differences between experiments can then be investigated by comparing their corresponding lattices according to various graph measures. We apply our method to microarray data derived from influenza-infected mouse lung tissue and healthy controls. Our preliminary results show the promise of our method as a tool for microarray data analysis.