IDEAS home Printed from https://ideas.repec.org/a/plo/pcbi00/1002562.html
   My bibliography  Save this article

A Scalable Algorithm to Explore the Gibbs Energy Landscape of Genome-Scale Metabolic Networks

Author

Listed:
  • Daniele De Martino
  • Matteo Figliuzzi
  • Andrea De Martino
  • Enzo Marinari

Abstract

The integration of various types of genomic data into predictive models of biological networks is one of the main challenges currently faced by computational biology. Constraint-based models in particular play a key role in the attempt to obtain a quantitative understanding of cellular metabolism at genome scale. In essence, their goal is to frame the metabolic capabilities of an organism based on minimal assumptions that describe the steady states of the underlying reaction network via suitable stoichiometric constraints, specifically mass balance and energy balance (i.e. thermodynamic feasibility). The implementation of these requirements to generate viable configurations of reaction fluxes and/or to test given flux profiles for thermodynamic feasibility can however prove to be computationally intensive. We propose here a fast and scalable stoichiometry-based method to explore the Gibbs energy landscape of a biochemical network at steady state. The method is applied to the problem of reconstructing the Gibbs energy landscape underlying metabolic activity in the human red blood cell, and to that of identifying and removing thermodynamically infeasible reaction cycles in the Escherichia coli metabolic network (iAF1260). In the former case, we produce consistent predictions for chemical potentials (or log-concentrations) of intracellular metabolites; in the latter, we identify a restricted set of loops (23 in total) in the periplasmic and cytoplasmic core as the origin of thermodynamic infeasibility in a large sample () of flux configurations generated randomly and compatibly with the prior information available on reaction reversibility. Author Summary: The operation of biological systems is constrained under all circumstances by the laws of physics. Thermodynamics, in particular, dictates preferential directions in which biochemical reactions should flow at stationarity. When applied to cellular reaction systems (like metabolic networks), it favors the emergence of some (thermodynamically feasible) ways to organize the flow of matter while prohibiting others. The development of detailed predictive models for the biochemical activity of a cell relies on the possibility to integrate the laws of thermodynamics in genome-scale reconstructions of cellular metabolic networks. In this work we have devised an efficient relaxation algorithm to implement thermodynamic constraints in genome-scale models. Besides allowing to check for thermodynamic feasibility of reaction flow configurations, it is also capable of providing information on other relevant physico-chemical quantities. We have applied it to two cellular metabolic networks of different complexity, namely that of human red blood cells and that of the bacterium Escherichia coli. In the former case, we have obtained predictions for the intracellular chemical state (in terms of metabolite concentrations and reaction free energies) consistent with empirical knowledge; in the latter, we have effectively corrected thermodynamically infeasible flux configurations.

Suggested Citation

  • Daniele De Martino & Matteo Figliuzzi & Andrea De Martino & Enzo Marinari, 2012. "A Scalable Algorithm to Explore the Gibbs Energy Landscape of Genome-Scale Metabolic Networks," PLOS Computational Biology, Public Library of Science, vol. 8(6), pages 1-12, June.
  • Handle: RePEc:plo:pcbi00:1002562
    DOI: 10.1371/journal.pcbi.1002562
    as

    Download full text from publisher

    File URL: https://journals.plos.org/ploscompbiol/article?id=10.1371/journal.pcbi.1002562
    Download Restriction: no

    File URL: https://journals.plos.org/ploscompbiol/article/file?id=10.1371/journal.pcbi.1002562&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pcbi.1002562?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. J. L. Goffin, 1980. "The Relaxation Method for Solving Systems of Linear Inequalities," Mathematics of Operations Research, INFORMS, vol. 5(3), pages 388-414, August.
    2. Andrea De Martino & Matteo Marsili, 2005. "Typical properties of optimal growth in the Von Neumann expanding model for large random economies," Papers physics/0507032, arXiv.org.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. William R Cannon, 2014. "Simulating Metabolism with Statistical Thermodynamics," PLOS ONE, Public Library of Science, vol. 9(8), pages 1-16, August.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Epelman, Marina A., 1973-. & Freund, Robert Michael, 1997. "Condition number complexity of an elementary algorithm for resolving a conic linear system," Working papers WP 3942-97., Massachusetts Institute of Technology (MIT), Sloan School of Management.
    2. Amitabh Basu & Jesús A. De Loera & Mark Junod, 2014. "On Chubanov's Method for Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 26(2), pages 336-350, May.
    3. Annabella Astorino & Manlio Gaudioso & Alberto Seeger, 2016. "Central axes and peripheral points in high dimensional directional datasets," Computational Optimization and Applications, Springer, vol. 65(2), pages 313-338, November.
    4. Guo, Xue-Ping, 2016. "Convergence studies on block iterative algorithms for image reconstruction," Applied Mathematics and Computation, Elsevier, vol. 273(C), pages 525-534.
    5. Alberto Seeger & José Vidal -Nuñez, 2017. "Measuring centrality and dispersion in directional datasets: the ellipsoidal cone covering approach," Journal of Global Optimization, Springer, vol. 68(2), pages 279-306, June.
    6. Edoardo Amaldi & Raphael Hauser, 2005. "Boundedness Theorems for the Relaxation Method," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 939-955, November.
    7. Daniel Dadush & László A. Végh & Giacomo Zambelli, 2020. "Rescaling Algorithms for Linear Conic Feasibility," Mathematics of Operations Research, INFORMS, vol. 45(2), pages 732-754, May.
    8. Robert M. Freund & Fernando Ordóñez, 2005. "On an Extension of Condition Number Theory to Nonconic Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 30(1), pages 173-194, February.
    9. Minh N. Dao, & Hung M. Phan, 2019. "Linear Convergence of Projection Algorithms," Mathematics of Operations Research, INFORMS, vol. 44(2), pages 715-738, May.
    10. Freund, Robert & Ordonez, Fernando, 2003. "On an Extension of Condition Number Theory to Non-Conic Convex Optimization," Working papers 4286-03, Massachusetts Institute of Technology (MIT), Sloan School of Management.
    11. Cheung, Dennis & Cucker, Felipe & Pea, Javier, 2009. "On strata of degenerate polyhedral cones I: Condition and distance to strata," European Journal of Operational Research, Elsevier, vol. 198(1), pages 23-28, October.
    12. H. H. Bauschke & S. G. Kruk, 2004. "Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone," Journal of Optimization Theory and Applications, Springer, vol. 120(3), pages 503-531, March.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pcbi00:1002562. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: ploscompbiol (email available below). General contact details of provider: https://journals.plos.org/ploscompbiol/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.