Predicting Metabolic Pathways from Metabolic Networks with Limited Biological Knowledge

被引:0
作者
Leung, S. Y. [1 ]
Leung, Henry C. M. [1 ]
Xiang, Carlos L. [1 ]
Yiu, S. M. [1 ]
Chin, Francis Y. L. [1 ]
机构
[1] Univ Hong Kong, Dept Comp Sci, Pokfulam, Hong Kong, Peoples R China
来源
2010 IEEE INTERNATIONAL CONFERENCE ON BIOINFORMATICS AND BIOMEDICINE WORKSHOPS (BIBMW) | 2010年
关键词
Metabolic Network; Conseved Metabolic Pathways; Building Block; PROTEIN-INTERACTION; COMPLEXES; ALIGNMENT; EVOLUTION;
D O I
暂无
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Understanding the metabolism of new species (e.g. endophytic fungi that produce fuel) have tremendous impact on human lives. Based on predicted proteins and existing reaction databases, one can construct the metabolic network for the species. Next is to identify critical metabolic pathways from the network. Existing computational techniques identify conserved pathways based on multiple networks of related species, but have the following drawbacks. Some do not rely on additional information, so only locate short (of length at most 5), but not necessarily interesting, conserved paths. The others require extensive information (the complete pathway on one species). In reality, researchers usually know only partial information of a metabolic pathway and may not have a conserved pathway in a related species. The Conserved Metabolic Pathway (CMP) problem is to find conserved pathways from the networks with partial information on the initial substrates and final products of the target pathways. Experimental results show that our algorithm CMPFinder can predict useful metabolic pathways with acceptable accuracy.
引用
收藏
页码:7 / 12
页数:6
相关论文
共 24 条
[1]   CFinder:: locating cliques and overlapping modules in biological networks [J].
Adamcsek, B ;
Palla, G ;
Farkas, IJ ;
Derényi, I ;
Vicsek, T .
BIOINFORMATICS, 2006, 22 (08) :1021-1023
[2]   An automated method for finding molecular complexes in large protein interaction networks [J].
Bader, GD ;
Hogue, CW .
BMC BIOINFORMATICS, 2003, 4 (1)
[3]   Cross-species analysis of biological networks by Bayesian alignment [J].
Berg, Johannes ;
Lassig, Michael .
PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2006, 103 (29) :10967-10972
[4]  
Clemente Jose C, 2006, Genome Inform, V17, P46
[5]   MATRIX MULTIPLICATION VIA ARITHMETIC PROGRESSIONS [J].
COPPERSMITH, D ;
WINOGRAD, S .
JOURNAL OF SYMBOLIC COMPUTATION, 1990, 9 (03) :251-280
[6]   Metabolic PathFinding: inferring relevant pathways in biochemical networks [J].
Croes, D ;
Couche, F ;
Wodak, SJ ;
van Helden, J .
NUCLEIC ACIDS RESEARCH, 2005, 33 :W326-W330
[7]  
Flannick J, 2008, LECT N BIOINFORMAT, V4955, P214
[8]   Graemlin: General and robust alignment of multiple large interaction networks [J].
Flannick, Jason ;
Novak, Antal ;
Srinivasan, Balaji S. ;
McAdams, Harley H. ;
Batzoglou, Serafim .
GENOME RESEARCH, 2006, 16 (09) :1169-1181
[9]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345
[10]  
Harrigan G.G. Goodacre., 2003, METABOLIC PROFILING