Hierarchical Cluster-based Partial Least Squares Regression (HC-PLSR) is an efficient tool for metamodelling of nonlinear dynamic models

Background

Network inference methods reconstruct mathematical models of molecular or genetic networks directly from experimental data sets. We have previously reported a mathematical method which is exclusively data-driven, does not involve any heuristic decisions within the reconstruction process, and deliveres all possible alternative minimal networks in terms of simple place/transition Petri nets that are consistent with a given discrete time series data set.

Results

We fundamentally extended the previously published algorithm to consider catalysis and inhibition of the reactions that occur in the underlying network. The results of the reconstruction algorithm are encoded in the form of an extended Petri net involving control arcs. This allows the consideration of processes involving mass flow and/or regulatory interactions. As a non-trivial test case, the phosphate regulatory network of enterobacteria was reconstructed using in silico-generated time-series data sets on wild-type and in silico mutants.

Conclusions

The new exact algorithm reconstructs extended Petri nets from time series data sets by finding all alternative minimal networks that are consistent with the data. It suggested alternative molecular mechanisms for certain reactions in the network. The algorithm is useful to combine data from wild-type and mutant cells and may potentially integrate physiological, biochemical, pharmacological, and genetic data in the form of a single model.     

STEPP--Search Tool for Exploration of Petri net Paths: a new tool for Petri net-based path analysis in biochemical networks

To understand biochemical processes caused by, e. g., mutations or deletions in the genome, the knowledge of possible alternative paths between two arbitrary chemical compounds is of increasing interest for biotechnology, pharmacology, medicine, and drug design. With the steadily increasing amount of data from high-throughput experiments new biochemical networks can be constructed and existing ones can be extended, which results in many large metabolic, signal transduction, and gene regulatory networks. The search for alternative paths within these complex and large networks can provide a huge amount of solutions, which can not be handled manually. Moreover, not all of the alternative paths are generally of interest. Therefore, we have developed and implemented a method, which allows us to define constraints to reduce the set of all structurally possible paths to the truly interesting path set. The paper describes the search algorithm and the constraints definition language. We give examples for path searches using this dedicated special language for a Petri net model of the sucrose-to-starch breakdown in the potato tuber.     

Reconstruction of extended Petri nets from time-series data by using logical control functions

The aim of this work is to extend a previously presented algorithm (Durzinsky et al. 2008b in Computational methods in systems biology, LNCS, vol 5307. Springer, Heidelberg, pp 328–346; Marwan et al. 2008 in Math Methods Oper Res 67:117–132) for the reconstruction of standard place/transition Petri nets from time-series of experimental data sets. This previously reported method finds provably all networks capable to reproduce the experimental observations. In this paper we enhance this approach to generate extended Petri nets involving mechanisms formally corresponding to catalytic or inhibitory dependencies that mediate the involved reactions. The new algorithm delivers the set of all extended Petri nets being consistent with the time-series data used for reconstruction. It is illustrated using the phosphate regulatory network of enterobacteria as a case study.     

Colored Petri net modeling and simulation of signal transduction pathways

Presented herein is a methodology for quantitatively analyzing the complex signaling network by resorting to colored Petri nets (CPN). The mathematical as well as Petri net models for two basic reaction types were established, followed by the extension to a large signal transduction system stimulated by epidermal growth factor (EGF) in an application study. The CPN models based on the Petri net representation and the conservation and kinetic equations were used to examine the dynamic behavior of the EGF signaling pathway. The usefulness of Petri nets is demonstrated for the quantitative analysis of the signal transduction pathway. Moreover, the trade-offs between modeling capability and simulation efficiency of this pathway are explored, suggesting that the Petri net model can be invaluable in the initial stage of building a dynamic model.     

Hyperdigraph-theoretic analysis of the EGFR signaling network: initial steps leading to GTP:Ras complex formation.

We construct an algebraic-combinatorial model of the SOS compartment of the EGFR biochemical network. A Petri net is used to construct an initial representation of the biochemical decision making network, which in turn defines a hyperdigraph. We observe that the linear algebraic structure of each hyperdigraph admits a canonical set of algebraic-combinatorial invariants that correspond to the information flow conservation laws governing a molecular kinetic reaction network. The linear algebraic structure of the hyperdigraph and its sets of invariants can be generalized to define a discrete algebraic-geometric structure, which is referred to as an oriented matroid. Oriented matroids define a polyhedral optimization geometry that is used to determine optimal subpaths that span the nullspace of a set of kinetic chemical reaction equations. Sets of constrained submodular path optimizations on the hyperdigraph are objectively obtained as a spanning tree of minimum cycle paths. This complete set of subcircuits is used to identify the network pinch points and invariant flow subpaths. We demonstrate that this family of minimal circuits also characteristically identifies additional significant biochemical reaction pattern features. We use the SOS Compartment A of the EGFR biochemical pathway to develop and demonstrate the application of our algebraic-combinatorial mathematical modeling methodology.     

Qualitatively modelling and analysing genetic regulatory networks: a Petri net approach

MOTIVATION: New developments in post-genomic technology now provide researchers with the data necessary to study regulatory processes in a holistic fashion at multiple levels of biological organization. One of the major challenges for the biologist is to integrate and interpret these vast data resources to gain a greater understanding of the structure and function of the molecular processes that mediate adaptive and cell cycle driven changes in gene expression. In order to achieve this biologists require new tools and techniques to allow pathway related data to be modelled and analysed as network structures, providing valuable insights which can then be validated and investigated in the laboratory. RESULTS: We propose a new technique for constructing and analysing qualitative models of genetic regulatory networks based on the Petri net formalism. We take as our starting point the Boolean network approach of treating genes as binary switches and develop a new Petri net model which uses logic minimization to automate the construction of compact qualitative models. Our approach addresses the shortcomings of Boolean networks by providing access to the wide range of existing Petri net analysis techniques and by using non-determinism to cope with incomplete and inconsistent data. The ideas we present are illustrated by a case study in which the genetic regulatory network controlling sporulation in the bacterium Bacillus subtilis is modelled and analysed. AVAILABILITY: The Petri net model construction tool and the data files for the B. subtilis sporulation case study are available at http://bioinf.ncl.ac.uk/gnapn.     

Structural Analysis to Determine the Core of Hypoxia Response Network

The advent of sophisticated molecular biology techniques allows to deduce the structure of complex biological networks. However, networks tend to be huge and impose computational challenges on traditional mathematical analysis due to their high dimension and lack of reliable kinetic data. To overcome this problem, complex biological networks are decomposed into modules that are assumed to capture essential aspects of the full network''s dynamics. The question that begs for an answer is how to identify the core that is representative of a network''s dynamics, its function and robustness. One of the powerful methods to probe into the structure of a network is Petri net analysis. Petri nets support network visualization and execution. They are also equipped with sound mathematical and formal reasoning based on which a network can be decomposed into modules. The structural analysis provides insight into the robustness and facilitates the identification of fragile nodes. The application of these techniques to a previously proposed hypoxia control network reveals three functional modules responsible for degrading the hypoxia-inducible factor (HIF). Interestingly, the structural analysis identifies superfluous network parts and suggests that the reversibility of the reactions are not important for the essential functionality. The core network is determined to be the union of the three reduced individual modules. The structural analysis results are confirmed by numerical integration of the differential equations induced by the individual modules as well as their composition. The structural analysis leads also to a coarse network structure highlighting the structural principles inherent in the three functional modules. Importantly, our analysis identifies the fragile node in this robust network without which the switch-like behavior is shown to be completely absent.     

Application of Petri net theory for modelling and validation of the sucrose breakdown pathway in the potato tuber

MOTIVATION: Because of the complexity of metabolic networks and their regulation, formal modelling is a useful method to improve the understanding of these systems. An essential step in network modelling is to validate the network model. Petri net theory provides algorithms and methods, which can be applied directly to metabolic network modelling and analysis in order to validate the model. The metabolism between sucrose and starch in the potato tuber is of great research interest. Even if the metabolism is one of the best studied in sink organs, it is not yet fully understood. RESULTS: We provide an approach for model validation of metabolic networks using Petri net theory, which we demonstrate for the sucrose breakdown pathway in the potato tuber. We start with hierarchical modelling of the metabolic network as a Petri net and continue with the analysis of qualitative properties of the network. The results characterize the net structure and give insights into the complex net behaviour.     

Topological analysis of metabolic networks based on Petri net theory

Petri net concepts provide additional tools for the modelling of metabolic networks. Here, the similarities between the counterparts in traditional biochemical modelling and Petri net theory are discussed. For example the stoichiometry matrix of a metabolic network corresponds to the incidence matrix of the Petri net. The flux modes and conservation relations have the T-invariants, respectively, P-invariants as counterparts. We reveal the biological meaning of some notions specific to the Petri net framework (traps, siphons, deadlocks, liveness). We focus on the topological analysis rather than on the analysis of the dynamic behaviour. The treatment of external metabolites is discussed. Some simple theoretical examples are presented for illustration. Also the Petri nets corresponding to some biochemical networks are built to support our results. For example, the role of triose phosphate isomerase (TPI) in Trypanosoma brucei metabolism is evaluated by detecting siphons and traps. All Petri net properties treated in this contribution are exemplified on a system extracted from nucleotide metabolism.     

Algebraic properties of automata associated to Petri nets and applications to computation in biological systems

Biochemical and genetic regulatory networks are often modeled by Petri nets. We study the algebraic structure of the computations carried out by Petri nets from the viewpoint of algebraic automata theory. Petri nets comprise a formalized graphical modeling language, often used to describe computation occurring within biochemical and genetic regulatory networks, but the semantics may be interpreted in different ways in the realm of automata. Therefore, there are several different ways to turn a Petri net into a state-transition automaton. Here, we systematically investigate different conversion methods and describe cases where they may yield radically different algebraic structures. We focus on the existence of group components of the corresponding transformation semigroups, as these reflect symmetries of the computation occurring within the biological system under study. Results are illustrated by applications to the Petri net modelling of intermediary metabolism. Petri nets with inhibition are shown to be computationally rich, regardless of the particular interpretation method. Along these lines we provide a mathematical argument suggesting a reason for the apparent all-pervasiveness of inhibitory connections in living systems.     

Validation of Inference Procedures for Gene Regulatory Networks

The availability of high-throughput genomic data has motivated the development of numerous algorithms to infer gene regulatory networks. The validity of an inference procedure must be evaluated relative to its ability to infer a model network close to the ground-truth network from which the data have been generated. The input to an inference algorithm is a sample set of data and its output is a network. Since input, output, and algorithm are mathematical structures, the validity of an inference algorithm is a mathematical issue. This paper formulates validation in terms of a semi-metric distance between two networks, or the distance between two structures of the same kind deduced from the networks, such as their steady-state distributions or regulatory graphs. The paper sets up the validation framework, provides examples of distance functions, and applies them to some discrete Markov network models. It also considers approximate validation methods based on data for which the generating network is not known, the kind of situation one faces when using real data.Key Words: Epistemology, gene network, inference, validation.     

A computational model for the identification of biochemical pathways in the krebs cycle.

We have applied an algorithmic methodology which provably decomposes any complex network into a complete family of principal subcircuits to study the minimal circuits that describe the Krebs cycle. Every operational behavior that the network is capable of exhibiting can be represented by some combination of these principal subcircuits and this computational decomposition is linearly efficient. We have developed a computational model that can be applied to biochemical reaction systems which accurately renders pathways of such reactions via directed hypergraphs (Petri nets). We have applied the model to the citric acid cycle (Krebs cycle). The Krebs cycle, which oxidizes the acetyl group of acetyl CoA to CO(2) and reduces NAD and FAD to NADH and FADH(2), is a complex interacting set of nine subreaction networks. The Krebs cycle was selected because of its familiarity to the biological community and because it exhibits enough complexity to be interesting in order to introduce this novel analytic approach. This study validates the algorithmic methodology for the identification of significant biochemical signaling subcircuits, based solely upon the mathematical model and not upon prior biological knowledge. The utility of the algebraic-combinatorial model for identifying the complete set of biochemical subcircuits as a data set is demonstrated for this important metabolic process.     

An algebraic-combinatorial model for the identification and mapping of biochemical pathways

We develop the mathematical machinery for the construction of an algebraic-combinatorial model using Petri nets to construct an oriented matroid representation of biochemical pathways. For demonstration purposes, we use a model metabolic pathway example from the literature to derive a general biochemical reaction network model. The biomolecular networks define a connectivity matrix that identifies a linear representation of a Petri net. The sub-circuits that span a reaction network are subject to flux conservation laws. The conservation laws correspond to algebraic-combinatorial dual invariants, that are called S-(state) and T-(transition) invariants. Each invariant has an associated minimum support. We show that every minimum support of a Petri net invariant defines a unique signed sub-circuit representation. We prove that the family of signed sub-circuits has an implicit order that defines an oriented matroid. The oriented matroid is then used to identify the feasible sub-circuit pathways that span the biochemical network as the positive cycles in a hyper-digraph.     

Petri net modeling of high-order genetic systems using grammatical evolution

Understanding how DNA sequence variations impact human health through a hierarchy of biochemical and physiological systems is expected to improve the diagnosis, prevention, and treatment of common, complex human diseases. We have previously developed a hierarchical dynamic systems approach based on Petri nets for generating biochemical network models that are consistent with genetic models of disease susceptibility. This modeling approach uses an evolutionary computation approach called grammatical evolution as a search strategy for optimal Petri net models. We have previously demonstrated that this approach routinely identifies biochemical network models that are consistent with a variety of genetic models in which disease susceptibility is determined by nonlinear interactions between two DNA sequence variations. In the present study, we evaluate whether the Petri net approach is capable of identifying biochemical networks that are consistent with disease susceptibility due to higher order nonlinear interactions between three DNA sequence variations. The results indicate that our model-building approach is capable of routinely identifying good, but not perfect, Petri net models. Ideas for improving the algorithm for this high-dimensional problem are presented.     

The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration

Subgraph matching algorithms are used to find and enumerate specific interconnection structures in networks. By enumerating these specific structures/subgraphs, the fundamental properties of the network can be derived. More specifically in biological networks, subgraph matching algorithms are used to discover network motifs, specific patterns occurring more often than expected by chance. Finding these network motifs yields information on the underlying biological relations modelled by the network. In this work, we present the Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS), an improved version of the Index-based Subgraph Matching Algorithm (ISMA). ISMA quickly finds all instances of a predefined motif in a network by intelligently exploring the search space and taking into account easily identifiable symmetric structures. However, more complex symmetries (possibly involving switching multiple nodes) are not taken into account, resulting in superfluous output. ISMAGS overcomes this problem by using a customised symmetry analysis phase to detect all symmetric structures in the network motif subgraphs. These structures are then converted to symmetry-breaking constraints used to prune the search space and speed up calculations. The performance of the algorithm was tested on several types of networks (biological, social and computer networks) for various subgraphs with a varying degree of symmetry. For subgraphs with complex (multi-node) symmetric structures, high speed-up factors are obtained as the search space is pruned by the symmetry-breaking constraints. For subgraphs with no or simple symmetric structures, ISMAGS still reduces computation times by optimising set operations. Moreover, the calculated list of subgraph instances is minimal as it contains no instances that differ by only a subgraph symmetry. An implementation of the algorithm is freely available at https://github.com/mhoubraken/ISMAGS.     

Modeling of Cell-to-Cell Communication Processes with Petri Nets Using the Example of Quorum Sensing

The understanding of the molecular mechanism of cell-to-cell communication is fundamental for system biology. Up to now, the main objectives of bioinformatics have been reconstruction, modeling and analysis of metabolic, regulatory and signaling processes, based on data generated from high-throughput technologies. Cell-to-cell communication or quorum sensing (QS), the use of small molecule signals to coordinate complex patterns of behavior in bacteria, has been the focus of many reports over the past decade. Based on the quorum sensing process of the organism Aliivibrio salmonicida, we aim at developing a functional Petri net, which will allow modeling and simulating cell-to-cell communication processes. Using a new editor-controlled information system called VANESA (http://vanesa.sf.net), we present how to combine different fields of studies such as life-science, database consulting, modeling, visualization and simulation for a semi-automatic reconstruction of the complex signaling quorum sensing network. We show how cell-to-cell communication processes and information-flow within a cell and across cell colonies can be modeled using VANESA and how those models can be simulated with Petri net network structures in a sophisticated way.     

基于Petri网的基因调控网络建模与分析

如何有效描述与分析复杂的基因调控网络(GRN)是生物学家研究基因表达调控机制的关键步骤.现有大部分方法在建模过程中忽略了生物中广泛存在的协同作用,模型预测结果与实际生物行为之间存在误差.基于混合函数Petri网(HFPN)理论提出了一种对基因调控网络进行定量分析的新方法.首先简要介绍GRN与HFPN的基础理论,然后为HFPN引入两类新元素:逻辑库所与逻辑变迁,描述基因调控网络的逻辑规则以及转录因子间的协同作用,最后构建海胆endo16基因调控网络的Petri网模型,并预测模型在不同位点发生突变时的基因表达水平变化.分析结果与文献实验数据相一致,验证了方法的正确性.     

Elucidating multi-input processing 3-node gene regulatory network topologies capable of generating striped gene expression patterns

A central problem in developmental and synthetic biology is understanding the mechanisms by which cells in a tissue or a Petri dish process external cues and transform such information into a coherent response, e.g., a terminal differentiation state. It was long believed that this type of positional information could be entirely attributed to a gradient of concentration of a specific signaling molecule (i.e., a morphogen). However, advances in experimental methodologies and computer modeling have demonstrated the crucial role of the dynamics of a cell’s gene regulatory network (GRN) in decoding the information carried by the morphogen, which is eventually translated into a spatial pattern. This morphogen interpretation mechanism has gained much attention in systems biology as a tractable system to investigate the emergent properties of complex genotype-phenotype maps. In this study, we apply a Markov chain Monte Carlo (MCMC)-like algorithm to probe the design space of three-node GRNs with the ability to generate a band-like expression pattern (target phenotype) in the middle of an arrangement of 30 cells, which resemble a simple (1-D) morphogenetic field in a developing embryo. Unlike most modeling studies published so far, here we explore the space of GRN topologies with nodes having the potential to perceive the same input signal differently. This allows for a lot more flexibility during the search space process, and thus enables us to identify a larger set of potentially interesting and realizable morphogen interpretation mechanisms. Out of 2061 GRNs selected using the search space algorithm, we found 714 classes of network topologies that could correctly interpret the morphogen. Notably, the main network motif that generated the target phenotype in response to the input signal was the type 3 Incoherent Feed-Forward Loop (I3-FFL), which agrees with previous theoretical expectations and experimental observations. Particularly, compared to a previously reported pattern forming GRN topologies, we have uncovered a great variety of novel network designs, some of which might be worth inquiring through synthetic biology methodologies to test for the ability of network design with minimal regulatory complexity to interpret a developmental cue robustly.     

Approximate multiple protein structure alignment using the sum-of-pairs distance.

An algorithm is presented to compute a multiple structure alignment for a set of proteins and to generate a consensus (pseudo) protein for the set. The algorithm is a heuristic in that it computes an approximation to the optimal multiple structure alignment that minimizes the sum of the pairwise distances between the protein structures. The algorithm chooses an input protein as the initial consensus and computes a correspondence between the protein structures (which are represented as sets of unit vectors) using an approach analogous to the center-star method for multiple sequence alignment. From this correspondence, a set of rotation matrices (optimal for the given correspondence) is derived to align the structures and derive the new consensus. The process is iterated until the sum of pairwise distances converges. The computation of the optimal rotations is itself an iterative process that both makes use of the current consensus and generates simultaneously a new one. This approach is based on an interesting result that allows the sum of all pairwise distances to be represented compactly as distances to the consensus. Experimental results on several protein families are presented, showing that the algorithm converges quite rapidly.