Inferring Meaningful Pathways in Weighted Metabolic Networks

摘要: An approach is presented for computing meaningful pathways in the network of small molecule metabolism comprising chemical reactions characterized all organisms. The metabolic described as a weighted graph which compounds are included, but each compound assigned weight equal to number it participates. Path finding performed this by searching one or more paths with lowest weight. Performance evaluated systematically between first and last annotated pathways, comparing intermediate computed those ones. For sake comparison, also un-weighted raw (all reactions) filtered (highly connected pool metabolites removed) graphs, respectively. correspondence very poor ( We suggest that success our simplistic rooted high degree specificity presumably reflecting thermodynamic constraints operating these pathways. expect find useful applications inferring newly sequenced genomes.