Inferring branching pathways in genome-scale metabolic networks.

ABSTRACT:

Background

A central problem in computational metabolic modelling is how to find biochemically plausible pathways between metabolites in a metabolic network. Two general, complementary frameworks have been utilized to find metabolic pathways: constraint-based modelling and graph-theoretical path finding approaches. In constraint-based modelling, one aims to find pathways where metabolites are balanced in a pseudo steady-state. Constraint-based methods, such as elementary flux mode analysis, have typically a high computational cost stemming from a large number of steady-state pathways in a typical metabolic network. On the other hand, graph-theoretical approaches avoid the computational complexity of constraint-based methods by solving a simpler problem of finding shortest paths. Ho

SUBMITTER: Pitkanen E 

PROVIDER: S-EPMC2791103 | biostudies-literature | 2009 Oct

REPOSITORIES: biostudies-literature