Metabolic networks are NP-hard to reconstruct.
High-throughput data from various omics and sequencing techniques have rendered the automated metabolic network reconstruction a highly relevant problem. Our approach reflects the inherent probabilistic nature of the steps involved in metabolic network reconstruction. Here, the goal is to arrive at networks which combine probabilistic information with the possibility to obtain a small number of disconnected network constituents by reduction of a given preliminary probabilistic metabolic network. We define automated metabolic network reconstruction as an optimization problem on four-partite graph (nodes representing genes, enzymes, reactions, and metabolites) which integrates: (1) probabilistic information obtained from the existing process for metabolic reconstruction from a given genome, (2) connectedness of the raw metabolic network, and (3) clustering of components in the reconstructed metabolic network. The practical implications of our theoretical analysis refer to the quality of reconstructed metabolic networks and shed light on the problem of finding more efficient and effective methods for automated reconstruction. Our main contributions include: a completeness result for the defined problem, polynomial-time approximation algorithm, and an optimal polynomial-time algorithm for trees. Moreover, we exemplify our approach by the reconstruction of the sucrose biosynthesis pathway in Chlamydomonas reinhardtii.
Nikoloski
Zoran
Z
Institute of Biochemistry and Biology, University of Potsdam, Karl-Liebknecht-Str. 24-25, Haus 20, 14476 Potsdam, Germany. nikoloski@mpimp-golm.mpg.de
Grimbs
Sergio
S
May
Patrick
P
Selbig
Joachim
J
D000818:Animals; D019295:Computational Biology / Q000379:methods*; D030562:Databases, Protein; D004798:Enzymes / Q000378:metabolism; D016678:Genome; D053858:Metabolic Networks and Pathways; D010363:Pattern Recognition, Automated; D011336:Probability; D025941:Protein Interaction Mapping
D004798:Enzymes