Parameterized Complexity of Finding Elementary Modes in Metabolic Networks

被引：0
|
作者：
Liu, Hong [1 ]
Feng, Haodi [1 ]
Zhu, Darning [1 ]
机构：
[1] Shandong Univ, Sch Comp Sci, Jinan 250100, Peoples R China
来源：
2009 INTERNATIONAL JOINT CONFERENCE ON BIOINFORMATICS, SYSTEMS BIOLOGY AND INTELLIGENT COMPUTING, PROCEEDINGS | 2009年
关键词：
D O I：
10.1109/IJCBS.2009.121
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
The concept of elementary (flux) modes provides a rigorous description of pathways in metabolic networks. Finding the elementary modes with minimum number of reactions (shortest elementary modes) is an interesting problem and has potential uses in various applications. However, this problem is NP-hard. This work is an initial step to analyze this problem from a parameterized computation view. With the number of reactions in elementary modes as natural parameter, we prove that finding the shortest elementary modes in metabolic networks is W[1]-hard.
引用
收藏
页码：479 / 482
页数：4
相关论文
共 50 条
  • [31] Finding elementary flux modes in metabolic networks based on flux balance analysis and flux coupling analysis: application to the analysis of Escherichia coli metabolism
    Shayan Tabe-Bordbar
    Sayed-Amir Marashi
    [J]. Biotechnology Letters, 2013, 35 : 2039 - 2044
  • [32] Parameterized Algorithmics for Finding Connected Motifs in Biological Networks
    Betzler, Nadja
    van Bevern, Rene
    Fellows, Michael R.
    Komusiewicz, Christian
    Niedermeier, Rolf
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2011, 8 (05) : 1296 - 1308
  • [33] Decomposing flux distributions into elementary flux modes in genome-scale metabolic networks
    Chan, Siu Hung Joshua
    Ji, Ping
    [J]. BIOINFORMATICS, 2011, 27 (16) : 2256 - 2262
  • [34] Enzyme allocation problems in kinetic metabolic networks: Optimal solutions are elementary flux modes
    Mueller, Stefan
    Regensburger, Georg
    Steuer, Ralf
    [J]. JOURNAL OF THEORETICAL BIOLOGY, 2014, 347 : 182 - 190
  • [35] Finding MEMo: minimum sets of elementary flux modes
    Roehl, Annika
    Bockmayr, Alexander
    [J]. JOURNAL OF MATHEMATICAL BIOLOGY, 2019, 79 (05) : 1749 - 1777
  • [36] Finding MEMo: minimum sets of elementary flux modes
    Annika Röhl
    Alexander Bockmayr
    [J]. Journal of Mathematical Biology, 2019, 79 : 1749 - 1777
  • [37] Parameterized complexity of finding a spanning tree with minimum reload cost diameter
    Baste, Julien
    Gozupek, Didem
    Paul, Christophe
    Sau, Ignasi
    Shalom, Mordechai
    Thilikos, Dimitrios M.
    [J]. NETWORKS, 2020, 75 (03) : 259 - 277
  • [38] Parameterized Complexity of Finding Subgraphs with Hereditary Properties on Hereditary Graph Classes
    Eppstein, David
    Gupta, Siddharth
    Havvaei, Elham
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, FCT 2021, 2021, 12867 : 217 - 229
  • [39] PARAMETERIZED COMPLEXITY FOR FINDING A PERFECT PHYLOGENY FROM MIXED TUMOR SAMPLES
    Sheu, Wen-Horng
    Wang, Biing-Feng
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (03) : 2049 - 2071
  • [40] Approximate inference in Bayesian networks: Parameterized complexity results
    Kwisthout, Johan
    [J]. INTERNATIONAL JOURNAL OF APPROXIMATE REASONING, 2018, 93 : 119 - 131
12345