Metabolic reconstruction using shortest paths

被引：42

作者：

Arita, M ^{[1
]}

机构：

[1] Electrotech Lab, Tsukuba, Ibaraki 3058568, Japan

来源：

SIMULATION PRACTICE AND THEORY | 2000年 / 8卷 / 1-2期

关键词：

metabolism; graph-oriented approach; shortest path algorithm; knowledge representation;

D O I：

10.1016/S0928-4869(00)00006-9

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

This paper introduces a graph-oriented representation of metabolism, and shows how to apply the shortest path algorithm to reconstruct metabolic pathways. Our metabolic model is constructed from molecular structures of compounds and reaction formulas of enzymes, and its output is all the logically possible pathways consisting of input reactions. We also show how to integrate putative reactions in the model. (C) 2000 Elsevier Science B.V. All rights reserved.

引用

页码：109 / 125

页数：17

共 20 条

[1]

ARITA M, 1999, THESIS U TOKYO JAPAN

[2]

ARITA M, IN PRESS J JPN SOC A, V15

[3] LINEAR-TIME COMPUTATION OF OPTIMAL SUBGRAPHS OF DECOMPOSABLE GRAPHS [J].