# An analytic approximation of the feasible space of metabolic networks

## TL;DR

This paper introduces an efficient analytic method based on Expectation Propagation for approximating the feasible flux space in metabolic networks, outperforming existing methods in accuracy and computational speed.

## Contribution

The authors develop a novel Expectation Propagation-based analytic approach for estimating flux distributions in metabolic networks, eliminating the need for sampling.

## Key findings

- The method provides more accurate flux distribution predictions than existing analytic techniques.
- It significantly reduces computation time compared to Monte Carlo sampling.
- The approach effectively incorporates empirical flux distribution data.

## Abstract

Assuming a steady-state condition within a cell, metabolic fluxes satisfy an under-determined linear system of stoichiometric equations. Characterizing the space of fluxes that satisfy such equations along with given bounds (and possibly additional relevant constraints) is considered of utmost importance for the understanding of cellular metabolism. Extreme values for each individual flux can be computed with Linear Programming (as Flux Balance Analysis), and their marginal distributions can be approximately computed with Monte-Carlo sampling. Here we present an approximate analytic method for the latter task based on Expectation Propagation equations that does not involve sampling and can achieve much better predictions than other existing analytic methods. The method is iterative, and its computation time is dominated by one matrix inversion per iteration. With respect to sampling, we show through extensive simulation that it has some advantages including computation time, and the ability to efficiently fix empirically estimated distributions of fluxes.