Speeding up the core algorithm for the dual calculation of minimal cut sets in large metabolic networks.

ABSTRACT:

Background

The concept of minimal cut sets (MCS) has become an important mathematical framework for analyzing and (re)designing metabolic networks. However, the calculation of MCS in genome-scale metabolic models is a complex computational problem. The development of duality-based algorithms in the last years allowed the enumeration of thousands of MCS in genome-scale networks by solving mixed-integer linear problems (MILP). A recent advancement in this field was the introduction of the MCS² approach. In contrast to the Farkas-lemma-based dual system used in earlier studies, the MCS² approach employs a more condensed representation of the dual system based on the nullspace of the stoichiometric matrix, which, due to its reduced dimension, holds promise to furt

SUBMITTER: Klamt S 

PROVIDER: S-EPMC7654042 | biostudies-literature | 2020 Nov

REPOSITORIES: biostudies-literature