Please use this identifier to cite or link to this item:
|Title:||Graph theory augmented math programming approach to identify minimal reaction sets in metabolic networks|
|Keywords:||Flux Balance Analysis|
|Citation:||Jonnalagadda, S., Balagurunathan, B., Srinivasan, R. (2011-11-15). Graph theory augmented math programming approach to identify minimal reaction sets in metabolic networks. Computers and Chemical Engineering 35 (11) : 2366-2377. ScholarBank@NUS Repository. https://doi.org/10.1016/j.compchemeng.2011.05.006|
|Abstract:||Bioprocesses are of growing importance as an avenue to produce chemicals. Microorganisms containing only desired catalytic and replication capabilities in their metabolic pathways are expected to offer efficient processes for chemical production. Realizing such minimal cells is the holy grail of metabolic engineering. In this paper, we propose a new method that combines graph-theoretic approaches with mixed-integer liner programming (MILP) to design metabolic networks with minimal reactions. Existing MILP based computational approaches are computationally complex especially for large networks. The proposed graph-theoretic approach offers an efficient divide-and-conquer strategy using the MILP formulation on sub-networks rather than considering the whole network monolithically. In addition to the resulting improvement in computational complexity, the proposed method also aids in identifying the key reactions to be knocked-out in order to achieve the minimal cell. The efficacy of the proposed approach is demonstrated using three case studies from two organisms, Escherichia coli and Saccharomyces cerevisiae. © 2011 Elsevier Ltd.|
|Source Title:||Computers and Chemical Engineering|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 14, 2019
WEB OF SCIENCETM
checked on Feb 5, 2019
checked on Feb 2, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.