Finding feasible pathways in metabolic networks

8Citations
Citations of this article
23Readers
Mendeley users who have this article in their library.
Get full text

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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Pitkänen, E., Rantanen, A., Rousu, J., & Ukkonen, E. (2005). Finding feasible pathways in metabolic networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3746 LNCS, pp. 123–133). Springer Verlag. https://doi.org/10.1007/11573036_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free