Finding feasible pathways in metabolic networks

  • Authors:
  • Esa Pitkänen;Ari Rantanen;Juho Rousu;Esko Ukkonen

  • Affiliations:
  • Department of Computer Science, University of Helsinki, Finland;Department of Computer Science, University of Helsinki, Finland;Royal Holloway, University of London, UK;Department of Computer Science, University of Helsinki, Finland

  • Venue:
  • PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.