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. © 2008 Springer-Verlag Berlin Heidelberg.
|Title of host publication||Proceedings of the 8th International Workshop on Algorithms in Bioinformatics, Lecture Notes in Computer Science, 5151, WABI|
|Place of Publication||Berlin|
|Publication status||Published - 2008|
|Event||8th Internatiional Workshop on Algorithms in Bioinformatics (WABI) - Berlin|
Duration: 15 Sep 2008 → 17 Sep 2008
|Conference||8th Internatiional Workshop on Algorithms in Bioinformatics (WABI)|
|Period||15/09/08 → 17/09/08|