We present the first exact method based on the topology of a metabolic network to find minimal sets of metabolites (called precursors) sufficient to produce a set of target metabolites. In contrast with previous proposals, our model takes into account self-regenerating metabolites involved in cycles, which may be used to generate target metabolites from potential precursors. We analyse the complexity of the problem and we propose an algorithm to enumerate all minimal precursor sets for a set of target metabolites. The algorithm can be applied to identify a minimal medium necessary for a cell to ensure some metabolic functions. It can be used also to check inconsistencies caused by misannotations in a metabolic network. We present two illustrations of these applications.
Springer
Lecture Notes in Computer Science
Combinatorial Algorithms in Bio-informatics
Workshop on Algorithms in Bioinformatics
Networks and Optimization

Cottret, L., Milreu, P., Acuña, V., Marchetti Spaccamela, A., Viduani Martinez, F., Sagot, M.-F., & Stougie, L. (2008). Enumerating precursor sets of target metabolites in a metabolic network. In Algorithms in Bioinformatics (pp. 233–244). Springer.