Modeling Cell Signaling Networks with Prize-Collecting Subhypernetworks

被引:0
|
作者
Potter, Barney [1 ,2 ]
Fix, James [2 ]
Ritz, Anna [1 ]
机构
[1] Reed Coll, Dept Biol, 3203 SE Woodstock Blvd, Portland, OR 97202 USA
[2] Reed Coll, Dept Math, 3203 SE Woodstock Blvd, Portland, OR 97202 USA
关键词
hypergraphs; cell signaling networks; cancer; BCC;
D O I
10.1145/2975167.2985655
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Cell signaling pathways are important tools used by biologists to model how signals are transduced through cells. Though signaling pathways can be (and often are) modeled using graphs, we instead use a generalization known as directed hypergraphs. We find directed hypergraphs to be a useful alternative to standard graphs, because hypergraphs give us a way to represent complex biological reactions that may have more than one reactant or product. Prior work analyzing cell signaling as hypergraphs sought structures called hyperpaths. We develop the notion of a hy-pershrub, a multi-source, multi-target generalization of a hyperpath. We create a formulation that finds specific, prize-dense hypershrubs that may be representative of biological phenomena that went previously unnoticed in standard graph representations of the same signaling pathways. To build our graphs, we introduce a weighting scheme that uses differential expression data to assign weights to nodes, representative of proteins and protein complexes, based on confidence that a given node is differentially regulated between conditions. This method is agnostic about whether or not a node is up-regulated or down-regulated between conditions, allowing us to find pathways that may involve both positive and negative regulation. We apply this formulation to the human Hedgehog signaling pathway, using data from Basal Cell carcinoma (BCC), to analyze the effectiveness of our algorithm on real data.
引用
收藏
页码:503 / 504
页数:2
相关论文
共 50 条
  • [41] Efficient cost-sharing mechanisms for prize-collecting problems
    Gupta, A.
    Koenemann, J.
    Leonardi, S.
    Ravi, R.
    Schaefer, G.
    MATHEMATICAL PROGRAMMING, 2015, 152 (1-2) : 147 - 188
  • [42] Approximation Algorithm for Stochastic Prize-Collecting Steiner Tree Problem
    Sun, Jian
    Sheng, Haiyun
    Sun, Yuefang
    Zhang, Xiaoyan
    ALGORITHMIC ASPECTS IN INFORMATION AND MANAGEMENT, AAIM 2019, 2019, 11640 : 261 - 271
  • [43] An approximation algorithm for the prize-collecting connected dominating set problem
    Zhang, Yaoyao
    Zhang, Zhao
    Du, Ding-Zhu
    OPTIMIZATION LETTERS, 2024,
  • [44] Algorithms for the Prize-Collecting k-Steiner Tree Problem
    Lu Han
    Changjun Wang
    Dachuan Xu
    Dongmei Zhang
    TsinghuaScienceandTechnology, 2022, 27 (05) : 785 - 792
  • [45] A firefly algorithm for the environmental prize-collecting vehicle routing problem
    Trachanatzi, Dimitra
    Rigakis, Manousos
    Marinaki, Magdalene
    Marinakis, Yannis
    SWARM AND EVOLUTIONARY COMPUTATION, 2020, 57
  • [46] A Memetic Algorithm for the Prize-collecting Traveling Car Renter Problem
    Menezes, Matheus da Silva
    Goldbarg, Marco Cesar
    Goldbarg, Elizabeth F. G.
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 3258 - 3265
  • [47] A Tabu Search Heuristic for the Prize-collecting Rural Postman Problem
    Palma, Guillermo
    ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2011, 281 : 85 - 100
  • [48] A firefly algorithm for the environmental prize-collecting vehicle routing problem
    Trachanatzi, Dimitra
    Rigakis, Manousos
    Marinaki, Magdalene
    Marinakis, Yannis
    Swarm and Evolutionary Computation, 2020, 57
  • [49] The time-dependent prize-collecting arc routing problem
    Black, Dan
    Eglese, Richard
    Wohlk, Sanne
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (02) : 526 - 535
  • [50] Approximation algorithm for the stochastic prize-collecting set multicover problem
    Takazawa, Yotaro
    OPERATIONS RESEARCH LETTERS, 2022, 50 (02) : 224 - 228