Analysis of metabolic networks using a pathway distance metric through linear programming.
The solution of the shortest path problem in biochemical systems constitutes an important step for studies of their evolution. In this paper, a linear programming (LP) algorithm for calculating minimal pathway distances in metabolic networks is studied. Minimal pathway distances are identified as the smallest number of metabolic steps separating two enzymes in metabolic pathways. The algorithm deals effectively with circularity and reaction directionality. The applicability of the algorithm is illustrated by calculating the minimal pathway distances for Escherichia coli small molecule metabolism enzymes, and then considering their correlations with genome distance (distance separating two genes on a chromosome) and enzyme function (as characterised by enzyme commission number). The results illustrate the effectiveness of the LP model. In addition, the data confirm that propinquity of genes on the genome implies similarity in function (as determined by co-involvement in the same region of the metabolic network), but suggest that no correlation exists between pathway distance and enzyme function. These findings offer insight into the probable mechanism of pathway evolution. © 2003 Elsevier Inc. All rights reserved.
|Title:||Analysis of metabolic networks using a pathway distance metric through linear programming|
|UCL classification:||UCL > School of Life and Medical Sciences
UCL > School of Life and Medical Sciences > Faculty of Life Sciences
UCL > VP Research
Archive Staff Only