English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

Released

Journal Article

Automatic decomposition of kinetic models of signaling networks minimizing the retroactivity among modules

MPS-Authors
/persons/resource/persons86220

Saez-Rodriguez,  J.
Systems Biology, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

/persons/resource/persons86169

Gayer,  S.
Systems Biology, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

/persons/resource/persons127401

Ginkel,  Martin
Systems Biology, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

/persons/resource/persons86172

Gilles,  E. D.
Systems Biology, Max Planck Institute for Dynamics of Complex Technical Systems, Max Planck Society;

External Ressource
No external resources are shared
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Saez-Rodriguez, J., Gayer, S., Ginkel, M., & Gilles, E. D. (2008). Automatic decomposition of kinetic models of signaling networks minimizing the retroactivity among modules. Bioinformatics, 24(16), i213-i219. doi:10.1093/bioinformatics/btn289.


Cite as: http://hdl.handle.net/11858/00-001M-0000-0013-950F-F
Abstract
Abstract: Motivation: The modularity of biochemical networks in general, and signaling networks in particular, has been extensively studied over the past few years. It has been proposed to be a useful property to analyze signaling networks: by decomposing the network into subsystems, more manageable units are obtained that are easier to analyze. While many powerful algorithms are available to identify modules in protein interaction networks, less attention has been paid to signaling networks defined as chemical systems. Such a decomposition would be very useful as most quantitative models are defined using the latter, more detailed formalism. Results: Here, we introduce a novel method to decompose biochemical networks into modules so that the bidirectional (retroactive) couplings among the modules are minimized. Our approach adapts a method to detect community structures, and applies it to the so-called retroactivity matrix that characterizes the couplings of the network. Only the structure of the network, e.g. in SBML format, is required. Furthermore, the modularized models can be loaded into ProMoT, a modeling tool which supports modular modeling. This allows visualization of the models, exploiting their modularity and easy generation of models of one or several modules for further analysis. The method is applied to several relevant cases, including an entangled model of the EGF-induced MAPK cascade and a comprehensive model of EGF signaling, demonstrating its ability to uncover meaningful modules. Our approach can thus help to analyze large networks, especially when little a priori knowledge on the structure of the network is available. © The Author 2008. Published by Oxford University Press. All rights reserved. [accessed October 30, 2008] Availability: The decomposition algorithms implemented in MATLAB (Mathworks, Inc.) are freely available upon request. ProMoT is freely available at http://www.mpi-magdeburg.mpg.de/projects/promot Supplementary information: Supplementary data are available at Bioinformatics online.