Name
Abstract | ||
|---|---|---|
We introduce a graph-theoretic formalism suitable for modeling biochemical networks marked by combinatorial complexity, such as signal-transduction systems, in which protein-protein interactions play a prominent role. This development extends earlier work by allowing for explicit representation of the connectivity of a protein complex. Within the formalism, typed attributed graphs are used to represent proteins and their functional components, complexes, conformations, and states of post-translational covalent modification. Graph transformation rules are used to represent protein-protein interactions and their effects. Each rule defines a generalized reaction, i.e., a class of potential reactions that are logically consistent with knowledge or assumptions about the represented biomolecular interaction. A model is specified by defining 1) molecular-entity graphs, which delimit the molecular entities and material components of a system and their possible states, 2) graph transformation rules, and 3) a seed set of graphs representing chemical species, such as the initial species present before introduction of a signal. A reaction network is generated iteratively through application of the graph transformation rules. The rules are first applied to the seed graphs and then to any and all new graphs that subsequently arise as a result of graph transformation. This procedure continues until no new graphs are generated or a specified termination condition is satisfied. The formalism supports the generation of a list of reactions in a system, which can be used to derive different types of physicochemical models, which can be simulated and analyzed in different ways. The processes of generating and simulating the network may be combined so that species are generated only as needed. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/11905455_5 | T. Comp. Sys. Biology |
Keywords | Field | DocType |
biochemical network,chemical species,molecular-entity graph,protein-protein interaction,new graph,seed graph,graph theory,graph transformation rule,different type,initial species present,graph transformation,rule-based modeling,signal transduction,satisfiability,protein complex,protein protein interaction,rule based | Graph theory,Rule-based modeling,Discrete mathematics,Modular decomposition,Graph isomorphism,Theoretical computer science,Implicit graph,Graph rewriting,Graph product,Clique-width,Mathematics | Journal |
Volume | ISSN | ISBN |
4230 | 0302-9743 | 3-540-48837-5 |
Citations | PageRank | References |
30 | 2.45 | 23 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael L. Blinov | 1 | 193 | 18.13 |
| Jin Yang | 2 | 30 | 2.45 |
| James R Faeder | 3 | 409 | 31.02 |
| William S. Hlavacek | 4 | 277 | 24.15 |