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

Design of Optimally Constructed Metabolic Networks of Minimal Functionality

Author

Listed:
  • David E Ruckerbauer
  • Christian Jungreuthmayer
  • Jürgen Zanghellini

Abstract

Background: Metabolic engineering aims to design microorganisms that will generate a product of interest at high yield. Thus, a variety of in silico modeling strategies has been applied successfully, including the concepts of elementary flux modes (EFMs) and constrained minimal cut sets (cMCSs). The EFMs (minimal, steady state pathways through the system) can be calculated given a metabolic model. cMCSs are sets of reaction deletions in such a network that will allow desired pathways to survive and disable undesired ones (e.g., those with low product secretion or low growth rates). Grouping the modes into desired and undesired categories had to be done manually until now. Results: Although the optimal solution for a given set of pathways will always be found with the currently available tools, manual selection may lead to a sub-optimal solution with respect to a metabolic engineering target. A small change in the selection of modes can reduce the number of necessary deletions while only slightly reducing production. Based on our recently introduced formulation of cut set calculations using binary linear programming, we suggest an algorithm that does not require manual selection of the desired pathways. Conclusions: We demonstrated the principle of our algorithm with the help of a small toy network and applied it to a model of E. coli using different design objectives. Furthermore we validated our method by reproducing previously obtained results without requiring manual grouping of modes.

Suggested Citation

  • David E Ruckerbauer & Christian Jungreuthmayer & Jürgen Zanghellini, 2014. "Design of Optimally Constructed Metabolic Networks of Minimal Functionality," PLOS ONE, Public Library of Science, vol. 9(3), pages 1-10, March.
  • Handle: RePEc:plo:pone00:0092583
    DOI: 10.1371/journal.pone.0092583
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0092583
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0092583&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0092583?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
    ---><---

    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:pone00:0092583. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    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.