Cargando…
An efficient graph theory based method to identify every minimal reaction set in a metabolic network
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...
Autores principales: | , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2014
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3995987/ https://www.ncbi.nlm.nih.gov/pubmed/24594118 http://dx.doi.org/10.1186/1752-0509-8-28 |
_version_ | 1782312966447693824 |
---|---|
author | Jonnalagadda, Sudhakar Srinivasan, Rajagopalan |
author_facet | Jonnalagadda, Sudhakar Srinivasan, Rajagopalan |
author_sort | Jonnalagadda, Sudhakar |
collection | PubMed |
description | 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. |
format | Online Article Text |
id | pubmed-3995987 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2014 |
publisher | BioMed Central |
record_format | MEDLINE/PubMed |
spelling | pubmed-39959872014-05-07 An efficient graph theory based method to identify every minimal reaction set in a metabolic network Jonnalagadda, Sudhakar Srinivasan, Rajagopalan BMC Syst Biol Research Article 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. BioMed Central 2014-03-04 /pmc/articles/PMC3995987/ /pubmed/24594118 http://dx.doi.org/10.1186/1752-0509-8-28 Text en Copyright © 2014 Jonnalagadda and Srinivasan; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly credited. |
spellingShingle | Research Article Jonnalagadda, Sudhakar Srinivasan, Rajagopalan An efficient graph theory based method to identify every minimal reaction set in a metabolic network |
title | An efficient graph theory based method to identify every minimal reaction set in a metabolic network |
title_full | An efficient graph theory based method to identify every minimal reaction set in a metabolic network |
title_fullStr | An efficient graph theory based method to identify every minimal reaction set in a metabolic network |
title_full_unstemmed | An efficient graph theory based method to identify every minimal reaction set in a metabolic network |
title_short | An efficient graph theory based method to identify every minimal reaction set in a metabolic network |
title_sort | efficient graph theory based method to identify every minimal reaction set in a metabolic network |
topic | Research Article |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3995987/ https://www.ncbi.nlm.nih.gov/pubmed/24594118 http://dx.doi.org/10.1186/1752-0509-8-28 |
work_keys_str_mv | AT jonnalagaddasudhakar anefficientgraphtheorybasedmethodtoidentifyeveryminimalreactionsetinametabolicnetwork AT srinivasanrajagopalan anefficientgraphtheorybasedmethodtoidentifyeveryminimalreactionsetinametabolicnetwork AT jonnalagaddasudhakar efficientgraphtheorybasedmethodtoidentifyeveryminimalreactionsetinametabolicnetwork AT srinivasanrajagopalan efficientgraphtheorybasedmethodtoidentifyeveryminimalreactionsetinametabolicnetwork |