Anzeige
Erschienen in:
2005 | OriginalPaper | Buchkapitel
Finding Feasible Pathways in Metabolic Networks
verfasst von : Esa Pitkänen, Ari Rantanen, Juho Rousu, Esko Ukkonen
Erschienen in: Advances in Informatics
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Recent small-world studies of the global structure of metabolic networks have been based on the shortest-path distance. In this paper, we propose new distance measures that are based on the structure of feasible metabolic pathways between metabolites. We argue that these distances capture the complexity of the underlying biochemical processes more accurately than the shortest-path distance. To test our approach in practice, we calculated our distances and shortest-path distances in two microbial organisms,
S. cerevisiae
and
E. coli
. The results show that metabolite interconversion is significantly more complex than was suggested in previous small-world studies. We also studied the effect of reaction removals (gene knock-outs) on the connectivity of the
S. cerevisiae
network and found out that the network is not particularly robust against such mutations.