Please use this identifier to cite or link to this item: https://doi.org/10.1186/1752-0509-8-28
Title: An efficient graph theory based method to identify every minimal reaction set in a metabolic network
Authors: Jonnalagadda, S.
Srinivasan, R. 
Keywords: Minimal cell
Mixed-Integer Linear Program (MILP)
Multiple solutions
Strain development
Systems biotechnology
Issue Date: 4-Mar-2014
Source: Jonnalagadda, S., Srinivasan, R. (2014-03-04). An efficient graph theory based method to identify every minimal reaction set in a metabolic network. BMC Systems Biology 8 (1) : -. ScholarBank@NUS Repository. https://doi.org/10.1186/1752-0509-8-28
Abstract: Background: Development of cells with minimal metabolic functionality is gaining importance due to their efficiency in producing chemicals and fuels. Existing computational methods to identify minimal reaction sets in metabolic networks are computationally expensive. Further, they identify only one of the several possible minimal reaction sets.Results: In this paper, we propose an efficient graph theory based recursive optimization approach to identify all minimal reaction sets. Graph theoretical insights offer systematic methods to not only reduce the number of variables in math programming and increase its computational efficiency, but also provide efficient ways to find multiple optimal solutions. The efficacy of the proposed approach is demonstrated using case studies from Escherichia coli and Saccharomyces cerevisiae. In case study 1, the proposed method identified three minimal reaction sets each containing 38 reactions in Escherichia coli central metabolic network with 77 reactions. Analysis of these three minimal reaction sets revealed that one of them is more suitable for developing minimal metabolism cell compared to other two due to practically achievable internal flux distribution. In case study 2, the proposed method identified 256 minimal reaction sets from the Saccharomyces cerevisiae genome scale metabolic network with 620 reactions. The proposed method required only 4.5 hours to identify all the 256 minimal reaction sets and has shown a significant reduction (approximately 80%) in the solution time when compared to the existing methods for finding minimal reaction set.Conclusions: Identification of all minimal reactions sets in metabolic networks is essential since different minimal reaction sets have different properties that effect the bioprocess development. The proposed method correctly identified all minimal reaction sets in a both the case studies. The proposed method is computationally efficient compared to other methods for finding minimal reaction sets and useful to employ with genome-scale metabolic networks. © 2014 Jonnalagadda and Srinivasan; licensee BioMed Central Ltd.
Source Title: BMC Systems Biology
URI: http://scholarbank.nus.edu.sg/handle/10635/88529
ISSN: 17520509
DOI: 10.1186/1752-0509-8-28
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

2
checked on Mar 27, 2018

WEB OF SCIENCETM
Citations

3
checked on Mar 27, 2018

Page view(s)

22
checked on Apr 20, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.