Computing optimal factories in metabolic networks with negative regulation
Affiliation
Department of Computer Science, University of ArizonaIssue Date
2022
Metadata
Show full item recordPublisher
Oxford AcademicCitation
Krieger, S., & Kececioglu, J. (2022). Computing optimal factories in metabolic networks with negative regulation. Bioinformatics (Oxford, England), 38(1), i369–i377.Journal
Bioinformatics (Oxford, England)Rights
Copyright © The Author(s) 2022. Published by Oxford University Press.This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/).Collection Information
This item from the UA Faculty Publications collection is made available by the University of Arizona with support from the University of Arizona Libraries. If you have questions, please contact us at repository@u.library.arizona.edu.Abstract
MOTIVATION: A factory in a metabolic network specifies how to produce target molecules from source compounds through biochemical reactions, properly accounting for reaction stoichiometry to conserve or not deplete intermediate metabolites. While finding factories is a fundamental problem in systems biology, available methods do not consider the number of reactions used, nor address negative regulation. METHODS: We introduce the new problem of finding optimal factories that use the fewest reactions, for the first time incorporating both first- and second-order negative regulation. We model this problem with directed hypergraphs, prove it is NP-complete, solve it via mixed-integer linear programming, and accommodate second-order negative regulation by an iterative approach that generates next-best factories. RESULTS: This optimization-based approach is remarkably fast in practice, typically finding optimal factories in a few seconds, even for metabolic networks involving tens of thousands of reactions and metabolites, as demonstrated through comprehensive experiments across all instances from standard reaction databases. AVAILABILITY AND IMPLEMENTATION: Source code for an implementation of our new method for optimal factories with negative regulation in a new tool called Odinn, together with all datasets, is available free for non-commercial use at http://odinn.cs.arizona.edu. © The Author(s) 2022. Published by Oxford University Press.Note
Open access articleISSN
1367-4811PubMed ID
35758789Version
Final published versionae974a485f413a2113503eed53cd6c53
10.1093/bioinformatics/btac231
Scopus Count
Collections
Except where otherwise noted, this item's license is described as Copyright © The Author(s) 2022. Published by Oxford University Press.This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0/).
Related articles
- Shortest Hyperpaths in Directed Hypergraphs for Reaction Pathway Inference.
- Authors: Krieger S, Kececioglu J
- Issue date: 2023 Nov
- Heuristic shortest hyperpaths in cell signaling hypergraphs.
- Authors: Krieger S, Kececioglu J
- Issue date: 2022 May 26
- Sequential computation of elementary modes and minimal cut sets in genome-scale metabolic networks using alternate integer linear programming.
- Authors: Song HS, Goldberg N, Mahajan A, Ramkrishna D
- Issue date: 2017 Aug 1
- Fast-SNP: a fast matrix pre-processing algorithm for efficient loopless flux optimization of metabolic models.
- Authors: Saa PA, Nielsen LK
- Issue date: 2016 Dec 15
- AFP: Finding pathways accounting for stoichiometry along with atom group tracking in metabolic network.
- Authors: Huang Y, Ma T, Wan Z, Zhong C, Wang J
- Issue date: 2024 Sep 10