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 条
  • [1] A note on the complexity of finding and enumerating elementary modes
    Acuna, Vicente
    Marchetti-Spaccamela, Alberto
    Sagot, Marie-France
    Stougie, Leen
    [J]. BIOSYSTEMS, 2010, 99 (03) : 210 - 214
  • [2] Parameterized Complexity of Inverse Scope Problems in Metabolic Networks
    Liu, Hong
    Feng, Haodi
    Zhu, Daming
    [J]. 2009 WASE INTERNATIONAL CONFERENCE ON INFORMATION ENGINEERING, ICIE 2009, VOL II, 2009, : 394 - 397
  • [3] Modes and cuts in metabolic networks: Complexity and algorithms
    Acuna, Vicente
    Chierichetti, Flavio
    Lacroix, Vincent
    Marchetti-Spaccamela, Alberto
    Sagot, Marie-France
    Stougie, Leen
    [J]. BIOSYSTEMS, 2009, 95 (01) : 51 - 60
  • [4] Metabolic Networks, Elementary Flux Modes, and Polyhedral Cones
    Stroch, Joel A.
    [J]. IEEE CONTROL SYSTEMS MAGAZINE, 2021, 41 (06): : 110 - 110
  • [5] Parameterized complexity of finding subgraphs with hereditary properties
    Khot, S
    Raman, V
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 289 (02) : 997 - 1008
  • [6] Complementary elementary modes for fast and efficient analysis of metabolic networks
    Badsha, Md Bahadur
    Tsuboi, Ryo
    Kurata, Hiroyuki
    [J]. BIOCHEMICAL ENGINEERING JOURNAL, 2014, 90 : 121 - 130
  • [7] Parameterized complexity of finding regular induced subgraphs
    Moser, Hannes
    Thilikos, Dimitrios M.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2009, 7 (02) : 181 - 190
  • [8] Parameterized complexity of finding subgraphs with hereditary properties
    Khot, S
    Raman, V
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2000, 1858 : 137 - 147
  • [9] Parameterized complexity of finding connected induced subgraphs
    Cai, Leizhen
    Ye, Junjie
    [J]. THEORETICAL COMPUTER SCIENCE, 2015, 607 : 49 - 59
  • [10] The Parameterized Complexity of Finding Concise Local Explanations
    Ordyniak, Sebastian
    Paesani, Giacomo
    Szeider, Stefan
    [J]. PROCEEDINGS OF THE THIRTY-SECOND INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, IJCAI 2023, 2023, : 3312 - 3320
12345