Algorithms for evaluation of minimal cut sets

被引:0
|
作者
Radom, Marcin [1 ,2 ]
Rybarczyk, Agnieszka [1 ,2 ,3 ]
Piekarz, Igor [1 ]
Formanowicz, Piotr [1 ]
机构
[1] Poznan Univ Tech, Inst Comp Sci, Piotrowo 2, PL-60965 Poznan, Poland
[2] Polish Acad Sci, Inst Bioorgan Chem, Z Noskowskiego 12-14, PL-61704 Poznan, Poland
[3] Gdyn Maritime Univ, Fac Elect Engn, PL-81225 Gdynia, Poland
关键词
Minimal cut sets; Petri nets; Biological systems; Modeling; Knockout; MODES;
D O I
10.1016/j.jbi.2024.104740
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Objective: We propose away to enhance the evaluation of minimal cut sets (MCSs) in biological systems modeled by Petri nets, by providing criteria and methodology for determining their optimality in disabling specific processes without affecting critical system components. Methods: This study concerns Petri nets to model biological systems and utilizes two primary approaches for MCS evaluation. First is the analyzing impact on t-invariants to identify structural dependencies. Second is assessing the impact on potentially starved transitions caused by the inactivity of specific MCSs. This approach deal with net dynamics. These methodologies aim to offer practical tools for assessing the quality and effectiveness of MCSs. Results: The proposed methodologies were applied to two case studies. In the first case, a cholesterol metabolism network was analyzed to investigate how local inflammation and oxidative stress, in conjunction with cholesterol imbalances, influence the progression of atherosclerosis. The MCSs were ranked, with the top sets presented, focusing on those that disabled the fewest number of t-invariants. In the second case, a carbohydrate metabolism disorder model was examined to understand its impact on atherosclerosis progression. The analysis aimed to identify MCSs that could inhibit the atherosclerosis process by targeting specific transitions. Both studies utilized the Holmes software for calculations, demonstrating the effectiveness of the proposed evaluation methodologies in ranking MCSs for practical biological applications. Conclusion: The algorithms proposed in this paper offer an analytical approach for evaluating the quality of MCSs in biological systems. By providing criteria for MCS optimality, these approaches have potential to enhance the utility of MCS analysis in systems biology, aiding in the understanding and manipulation of complex biological networks. Algorithm are implemented within Holmes software, an open-source project available at https://github. com/bszawulak/HolmesPN.
引用
收藏
页数:19
相关论文
共 50 条
  • [1] Comparison and improvement of algorithms for computing minimal cut sets
    Jungreuthmayer, Christian
    Nair, Govind
    Klamt, Steffen
    Zanghellini, Juergen
    BMC BIOINFORMATICS, 2013, 14
  • [2] Comparison and improvement of algorithms for computing minimal cut sets
    Christian Jungreuthmayer
    Govind Nair
    Steffen Klamt
    Jürgen Zanghellini
    BMC Bioinformatics, 14
  • [3] RELATIONSHIP BETWEEN MINIMAL PATH SETS AND CUT SETS
    LOCKS, MO
    IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (02) : 106 - 106
  • [4] Automatic Generation of Minimal Cut Sets
    Kromodimoeljo, Sentot
    Lindsay, Peter A.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2015, (184): : 33 - 47
  • [5] Computerized algorithm for deducing the minimal cut sets used in substation reliability evaluation
    Hajian-Hoseinabadi, Hamze
    INTERNATIONAL TRANSACTIONS ON ELECTRICAL ENERGY SYSTEMS, 2015, 25 (04): : 573 - 588
  • [6] DECOMPOSITION ALGORITHMS FOR MINIMAL CUT PROBLEMS
    TUFEKCI, S
    NAVAL RESEARCH LOGISTICS, 1981, 28 (03) : 431 - 445
  • [7] RELATIONSHIP BETWEEN MINIMAL PATH SETS AND CUT SETS - REPLY
    BIEGEL, JE
    IEEE TRANSACTIONS ON RELIABILITY, 1978, 27 (02) : 152 - 152
  • [8] Diagnosis approach based on minimal cut sets and minimal path sets of fault tree
    Wang, Wei
    Cui, Haiying
    Huang, Wenhu
    Shu Ju Cai Ji Yu Chu Li/Journal of Data Acquisition & Processing, 1999, 14 (01): : 26 - 29
  • [9] Minimal cut sets in biochemical reaction networks
    Klamt, S
    Gilles, ED
    BIOINFORMATICS, 2004, 20 (02) : 226 - 234
  • [10] FINDING MINIMAL CUT SETS IN A FAULT TREE
    VATN, J
    RELIABILITY ENGINEERING & SYSTEM SAFETY, 1992, 36 (01) : 59 - 62