A graph-based reflexive artificial chemistry

The conceptual divide between formal systems of computation and abstract models of chemistry is considered. As an attempt to concretely bridge this divide, a formalism is proposed that describes a constructive artificial chemistry on a space of directed graph structures. The idea for the formalism originates in computer science theory, with the traditional abstraction of a physical machine, the finite-state machine (FSM). In the FSM, the machine (state-transition graph) and input string (series of binary digits) are fundamentally distinct objects, separated by nature of the underlying formalism. This distinction is dissolved in the proposed system, resulting in a construction process that is reflexive: graphs interact with their own topological structure to generate a product. It is argued that this property of reflexivity is a key element missing from earlier model chemistries. Examples demonstrate the continuous emergence complex self-similar topologies, novel reaction pathways, and seemingly open-ended diversity. Implications of these findings are discussed.     

Network Reconstruction Based on Proteomic Data and Prior Knowledge of Protein Connectivity Using Graph Theory

Modeling of signal transduction pathways is instrumental for understanding cells’ function. People have been tackling modeling of signaling pathways in order to accurately represent the signaling events inside cells’ biochemical microenvironment in a way meaningful for scientists in a biological field. In this article, we propose a method to interrogate such pathways in order to produce cell-specific signaling models. We integrate available prior knowledge of protein connectivity, in a form of a Prior Knowledge Network (PKN) with phosphoproteomic data to construct predictive models of the protein connectivity of the interrogated cell type. Several computational methodologies focusing on pathways’ logic modeling using optimization formulations or machine learning algorithms have been published on this front over the past few years. Here, we introduce a light and fast approach that uses a breadth-first traversal of the graph to identify the shortest pathways and score proteins in the PKN, fitting the dependencies extracted from the experimental design. The pathways are then combined through a heuristic formulation to produce a final topology handling inconsistencies between the PKN and the experimental scenarios. Our results show that the algorithm we developed is efficient and accurate for the construction of medium and large scale signaling networks. We demonstrate the applicability of the proposed approach by interrogating a manually curated interaction graph model of EGF/TNFA stimulation against made up experimental data. To avoid the possibility of erroneous predictions, we performed a cross-validation analysis. Finally, we validate that the introduced approach generates predictive topologies, comparable to the ILP formulation. Overall, an efficient approach based on graph theory is presented herein to interrogate protein–protein interaction networks and to provide meaningful biological insights.     

A structured approach for the engineering of biochemical network models, illustrated for signalling pathways

Quantitative models of biochemical networks (signal transduction cascades, metabolic pathways, gene regulatory circuits) are a central component of modern systems biology. Building and managing these complex models is a major challenge that can benefit from the application of formal methods adopted from theoretical computing science. Here we provide a general introduction to the field of formal modelling, which emphasizes the intuitive biochemical basis of the modelling process, but is also accessible for an audience with a background in computing science and/or model engineering. We show how signal transduction cascades can be modelled in a modular fashion, using both a qualitative approach--qualitative Petri nets, and quantitative approaches--continuous Petri nets and ordinary differential equations (ODEs). We review the major elementary building blocks of a cellular signalling model, discuss which critical design decisions have to be made during model building, and present a number of novel computational tools that can help to explore alternative modular models in an easy and intuitive manner. These tools, which are based on Petri net theory, offer convenient ways of composing hierarchical ODE models, and permit a qualitative analysis of their behaviour. We illustrate the central concepts using signal transduction as our main example. The ultimate aim is to introduce a general approach that provides the foundations for a structured formal engineering of large-scale models of biochemical networks.     

A rule-based model of barley morphogenesis, with special respect to shading and gibberellic acid signal transduction

BACKGROUND AND AIMS: Functional-structural plant models (FSPM) constitute a paradigm in plant modelling that combines 3D structural and graphical modelling with the simulation of plant processes. While structural aspects of plant development could so far be represented using rule-based formalisms such as Lindenmayer systems, process models were traditionally written using a procedural code. The faithful representation of structures interacting with functions across scales, however, requires a new modelling formalism. Therefore relational growth grammars (RGG) were developed on the basis of Lindenmayer systems. METHODS: In order to implement and test RGG, a new modelling language, the eXtended L-system language (XL) was created. Models using XL are interpreted by the interactive, Java-based modelling platform GroIMP. Three models, a semi-quantitative gibberellic acid (GA) signal transduction model, and a phytochrome-based shade detection and object avoidance model, both coupled to an existing morphogenetic structural model of barley (Hordeum vulgare L.), serve as examples to demonstrate the versatility and suitability of RGG and XL to represent the interaction of diverse biological processes across hierarchical scales. KEY RESULTS: The dynamics of the concentrations in the signal transduction network could be modelled qualitatively and the phenotypes of GA-response mutants faithfully reproduced. The light model used here was simple to use yet effective enough to carry out local measurement of red:far-red ratios. Suppression of tillering at low red:far-red ratios could be simulated. CONCLUSIONS: The RGG formalism is suitable for implementation of multi-scaled FSPM of plants interacting with their environment via hormonal control. However, their ensuing complexity requires careful design. On the positive side, such an FSPM displays knowledge gaps better thereby guiding future experimental design.     

Mathematical simulation and analysis of cellular metabolism and regulation.

MOTIVATION: A better understanding of the biological phenomena observed in cells requires the creation and analysis of mathematical models of cellular metabolism and physiology. The formulation and study of such models must also be simplified as far as possible to cope with the increasing complexity demanded and exponential accumulation of the metabolic reconstructions computed from sequenced genomes. RESULTS: A mathematical simulation workbench, DBsolve, has been developed to simplify the derivation and analysis of mathematical models. It combines: (i) derivation of large-scale mathematical models from metabolic reconstructions and other data sources; (ii) solving and parameter continuation of non-linear algebraic equations (NAEs), including metabolic control analysis; (iii) solving the non-linear stiff systems of ordinary differential equations (ODEs); (iv) bifurcation analysis of ODEs; (v) parameter fitting to experimental data or functional criteria based on constrained optimization. The workbench has been successfully used for dynamic metabolic modeling of some typical biochemical networks (Dolgacheva et al., Biochemistry (Moscow), 6, 1063-1068, 1996; Goldstein and Goryanin, Mol. Biol. (Moscow), 30, 976-983, 1996), including microbial glycolytic pathways, signal transduction pathways and receptor-ligand interactions. AVAILABILITY: DBsolve 5. 00 is freely available from http://websites.ntl.com/ approximately igor.goryanin. CONTACT: gzz78923@ggr.co.uk     

Modeling protein evolution with several amino Acid replacement matrices depending on site rates

Most protein substitution models use a single amino acid replacement matrix summarizing the biochemical properties of amino acids. However, site evolution is highly heterogeneous and depends on many factors that influence the substitution patterns. In this paper, we investigate the use of different substitution matrices for different site evolutionary rates. Indeed, the variability of evolutionary rates corresponds to one of the most apparent heterogeneity factors among sites, and there is no reason to assume that the substitution patterns remain identical regardless of the evolutionary rate. We first introduce LG4M, which is composed of four matrices, each corresponding to one discrete gamma rate category (of four). These matrices differ in their amino acid equilibrium distributions and in their exchangeabilities, contrary to the standard gamma model where only the global rate differs from one category to another. Next, we present LG4X, which also uses four different matrices, but leaves aside the gamma distribution and follows a distribution-free scheme for the site rates. All these matrices are estimated from a very large alignment database, and our two models are tested using a large sample of independent alignments. Detailed analysis of resulting matrices and models shows the complexity of amino acid substitutions and the advantage of flexible models such as LG4M and LG4X. Both significantly outperform single-matrix models, providing gains of dozens to hundreds of log-likelihood units for most data sets. LG4X obtains substantial gains compared with LG4M, thanks to its distribution-free scheme for site rates. Since LG4M and LG4X display such advantages but require the same memory space and have comparable running times to standard models, we believe that LG4M and LG4X are relevant alternatives to single replacement matrices. Our models, data, and software are available from http://www.atgc-montpellier.fr/models/lg4x.     

Review: To be or not to be an identifiable model. Is this a relevant question in animal science modelling?

What is a good (useful) mathematical model in animal science? For models constructed for prediction purposes, the question of model adequacy (usefulness) has been traditionally tackled by statistical analysis applied to observed experimental data relative to model-predicted variables. However, little attention has been paid to analytic tools that exploit the mathematical properties of the model equations. For example, in the context of model calibration, before attempting a numerical estimation of the model parameters, we might want to know if we have any chance of success in estimating a unique best value of the model parameters from available measurements. This question of uniqueness is referred to as structural identifiability; a mathematical property that is defined on the sole basis of the model structure within a hypothetical ideal experiment determined by a setting of model inputs (stimuli) and observable variables (measurements). Structural identifiability analysis applied to dynamic models described by ordinary differential equations (ODEs) is a common practice in control engineering and system identification. This analysis demands mathematical technicalities that are beyond the academic background of animal science, which might explain the lack of pervasiveness of identifiability analysis in animal science modelling. To fill this gap, in this paper we address the analysis of structural identifiability from a practitioner perspective by capitalizing on the use of dedicated software tools. Our objectives are (i) to provide a comprehensive explanation of the structural identifiability notion for the community of animal science modelling, (ii) to assess the relevance of identifiability analysis in animal science modelling and (iii) to motivate the community to use identifiability analysis in the modelling practice (when the identifiability question is relevant). We focus our study on ODE models. By using illustrative examples that include published mathematical models describing lactation in cattle, we show how structural identifiability analysis can contribute to advancing mathematical modelling in animal science towards the production of useful models and, moreover, highly informative experiments via optimal experiment design. Rather than attempting to impose a systematic identifiability analysis to the modelling community during model developments, we wish to open a window towards the discovery of a powerful tool for model construction and experiment design.     

Piecewise-linear Models of Genetic Regulatory Networks: Equilibria and their Stability

A formalism based on piecewise-linear (PL) differential equations, originally due to Glass and Kauffman, has been shown to be well-suited to modelling genetic regulatory networks. However, the discontinuous vector field inherent in the PL models raises some mathematical problems in defining solutions on the surfaces of discontinuity. To overcome these difficulties we use the approach of Filippov, which extends the vector field to a differential inclusion. We study the stability of equilibria (called singular equilibrium sets) that lie on the surfaces of discontinuity. We prove several theorems that characterize the stability of these singular equilibria directly from the state transition graph, which is a qualitative representation of the dynamics of the system. We also formulate a stronger conjecture on the stability of these singular equilibrium sets.     

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.     

Structures of mammalian cytosolic quinone reductases

The metabolism of quinone compounds presents one source of oxidative stress in mammals, as many pathways proceed by mechanisms that generate reactive oxygen species as by-products. One defense against quinone toxicity is the enzyme NAD(P)H:quinone oxidoreductase type 1 (QR1), which metabolizes quinones by a two-electron reduction mechanism, thus averting production of radicals. QR1 is expressed in the cytoplasm of many tissues, and is highly inducible. A closely related homologue, quinone reductase type 2 (QR2), has been identified in several mammalian species. QR2 is also capable of reducing quinones to hydroquinones, but unlike QR1, cannot use NAD(P)H. X-ray crystallographic studies of QR1 and QR2 illustrate that despite their different biochemical properties, these enzymes have very similar three-dimensional structures. In particular, conserved features of the active sites point to the close relationship between these two enzymes.     

Compound analysis via graph kernels incorporating chirality

High accuracy is paramount when predicting biochemical characteristics using Quantitative Structural-Property Relationships (QSPRs). Although existing graph-theoretic kernel methods combined with machine learning techniques are efficient for QSPR model construction, they cannot distinguish topologically identical chiral compounds which often exhibit different biological characteristics. In this paper, we propose a new method that extends the recently developed tree pattern graph kernel to accommodate stereoisomers. We show that Support Vector Regression (SVR) with a chiral graph kernel is useful for target property prediction by demonstrating its application to a set of human vitamin D receptor ligands currently under consideration for their potential anti-cancer effects.     

Investigating the two-moment characterisation of subcellular biochemical networks

While ordinary differential equations (ODEs) form the conceptual framework for modelling many cellular processes, specific situations demand stochastic models to capture the influence of noise. The most common formulation of stochastic models for biochemical networks is the chemical master equation (CME). While stochastic simulations are a practical way to realise the CME, analytical approximations offer more insight into the influence of noise. Towards that end, the two-moment approximation (2MA) is a promising addition to the established analytical approaches including the chemical Langevin equation (CLE) and the related linear noise approximation (LNA). The 2MA approach directly tracks the mean and (co)variance which are coupled in general. This coupling is not obvious in CME and CLE and ignored by LNA and conventional ODE models. We extend previous derivations of 2MA by allowing (a) non-elementary reactions and (b) relative concentrations. Often, several elementary reactions are approximated by a single step. Furthermore, practical situations often require the use of relative concentrations. We investigate the applicability of the 2MA approach to the well-established fission yeast cell cycle model. Our analytical model reproduces the clustering of cycle times observed in experiments. This is explained through multiple resettings of M-phase promoting factor (MPF), caused by the coupling between mean and (co)variance, near the G2/M transition.     

Power-law models of signal transduction pathways

The mathematical modelling of signal transduction pathways has become a valuable aid to understanding the complex interactions involved in intracellular signalling mechanisms. An important aspect of the mathematical modelling process is the selection of the model type and structure. Until recently, the convention has been to use a standard kinetic model, often with the Michaelis-Menten steady state assumption. However this model form, although valuable, is only one of a number of choices, and the aim of this article is to consider the mathematical structure and essential features of an alternative model form--the power-law model. Specifically, we analyse how power-law models can be applied to increase our understanding of signal transduction pathways when there may be limited prior information. We distinguish between two kinds of power law models: a) Detailed power-law models, as a tool for investigating pathways when the structure of protein-protein interactions is completely known, and; b) Simplified power-law models, for the analysis of systems with incomplete structural information or insufficient quantitative data for generating detailed models. If sufficient data of high quality are available, the advantage of detailed power-law models is that they are more realistic representations of non-homogenous or crowded cellular environments. The advantages of the simplified power-law model formulation are illustrated using some case studies in cell signalling. In particular, the investigation on the effects of signal inhibition and feedback loops and the validation of structural hypotheses are discussed.     

Machine Learning Assisted Design of Highly Active Peptides for Drug Discovery

The discovery of peptides possessing high biological activity is very challenging due to the enormous diversity for which only a minority have the desired properties. To lower cost and reduce the time to obtain promising peptides, machine learning approaches can greatly assist in the process and even partly replace expensive laboratory experiments by learning a predictor with existing data or with a smaller amount of data generation. Unfortunately, once the model is learned, selecting peptides having the greatest predicted bioactivity often requires a prohibitive amount of computational time. For this combinatorial problem, heuristics and stochastic optimization methods are not guaranteed to find adequate solutions. We focused on recent advances in kernel methods and machine learning to learn a predictive model with proven success. For this type of model, we propose an efficient algorithm based on graph theory, that is guaranteed to find the peptides for which the model predicts maximal bioactivity. We also present a second algorithm capable of sorting the peptides of maximal bioactivity. Extensive analyses demonstrate how these algorithms can be part of an iterative combinatorial chemistry procedure to speed up the discovery and the validation of peptide leads. Moreover, the proposed approach does not require the use of known ligands for the target protein since it can leverage recent multi-target machine learning predictors where ligands for similar targets can serve as initial training data. Finally, we validated the proposed approach in vitro with the discovery of new cationic antimicrobial peptides. Source code freely available at http://graal.ift.ulaval.ca/peptide-design/.     

Explicit formulation of titration models for isothermal titration calorimetry

Isothermal titration calorimetry (ITC) produces a differential heat signal with respect to the total titrant concentration. This feature gives ITC excellent sensitivity for studying the thermodynamics of complex biomolecular interactions in solution. Currently, numerical methods for data fitting are based primarily on indirect approaches rooted in the usual practice of formulating biochemical models in terms of integrated variables. Here, a direct approach is presented wherein ITC models are formulated and solved as numerical initial value problems for data fitting and simulation purposes. To do so, the ITC signal is cast explicitly as a first-order ordinary differential equation (ODE) with total titrant concentration as independent variable and the concentration of a bound or free ligand species as dependent variable. This approach was applied to four ligand-receptor binding and homotropic dissociation models. Qualitative analysis of the explicit ODEs offers insights into the behavior of the models that would be inaccessible to indirect methods of analysis. Numerical ODEs are also highly compatible with regression analysis. Since solutions to numerical initial value problems are straightforward to implement on common computing platforms in the biochemical laboratory, this method is expected to facilitate the development of ITC models tailored to any experimental system of interest.     

Bridging from molecular simulation to biochemical networks

How can we make the connection between the three-dimensional structures of individual proteins and understanding how complex biological systems involving many proteins work? The modelling and simulation of protein structures can help to answer this question for systems ranging from multimacromolecular complexes to organelles and cells. On one hand, multiscale modelling and simulation techniques are advancing to permit the spatial and temporal properties of large systems to be simulated using atomic-detail structures. On the other hand, the estimation of kinetic parameters for the mathematical modelling of biochemical pathways using protein structure information provides a basis for iterative manipulation of biochemical pathways guided by protein structure. Recent advances include the structural modelling of protein complexes on the genomic level, novel coarse-graining strategies to increase the size of the system and the time span that can be simulated, and comparative molecular field analyses to estimate enzyme kinetic parameters.