Unknown

Dataset Information

0

A depth-first search algorithm to compute elementary flux modes by linear programming.


ABSTRACT:

Background

The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand.

Results

Based on an alternative elementarity test, we developed a depth-first search algorithm using linear programming (LP) to enumerate EFMs in an exhaustive fashion. Constraints can be introduced to directly generate a subset of EFMs satisfying the set of constraints. The depth-first search algorithm has a constant memory overhead. Using flux constraints, a large LP problem can be massively divided and parallelized into independent sub-jobs for deployment into computing clusters. Since the sub-jobs do not overlap, the approach scales to utilize all available computing nodes with minimal coordination overhead or memory limitations.

Conclusions

The speed of the algorithm was comparable to efmtool, a mainstream Double Description method, when enumerating all EFMs; the attrition power gained from performing flux feasibility tests offsets the increased computational demand of running an LP solver. Unlike the Double Description method, the algorithm enables accelerated enumeration of all EFMs satisfying a set of constraints.

SUBMITTER: Quek LE 

PROVIDER: S-EPMC4236763 | biostudies-literature | 2014 Jul

REPOSITORIES: biostudies-literature

altmetric image

Publications

A depth-first search algorithm to compute elementary flux modes by linear programming.

Quek Lake-Ee LE   Nielsen Lars K LK  

BMC systems biology 20140730


<h4>Background</h4>The decomposition of complex metabolic networks into elementary flux modes (EFMs) provides a useful framework for exploring reaction interactions systematically. Generating a complete set of EFMs for large-scale models, however, is near impossible. Even for moderately-sized models (<400 reactions), existing approaches based on the Double Description method must iterate through a large number of combinatorial candidates, thus imposing an immense processor and memory demand.<h4>  ...[more]

Similar Datasets

| S-EPMC7390993 | biostudies-literature
| S-EPMC9720172 | biostudies-literature
| S-EPMC5319754 | biostudies-literature
| S-EPMC4029027 | biostudies-literature
| S-EPMC11322987 | biostudies-literature
| S-EPMC3296127 | biostudies-literature
| S-EPMC8579665 | biostudies-literature
| S-EPMC3812217 | biostudies-literature
| S-EPMC7074156 | biostudies-literature
| S-EPMC3148577 | biostudies-literature