Pith. sign in

REVIEW

An analytic approximation of the feasible space of metabolic networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1702.05400 v2 pith:CMO5MZXJ submitted 2017-02-17 physics.bio-ph cond-mat.stat-mechq-bio.MN

classification physics.bio-phcond-mat.stat-mechq-bio.MN
keywords analyticequationsfluxessamplingcomputationcomputeddistributionsflux
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Pith tools