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 条
  • [21] A new ILP formulation for 2-root-connected prize-collecting Steiner networks
    Chimani, Markus
    Kandyba, Maria
    Mutzel, Petra
    ALGORITHMS - ESA 2007, PROCEEDINGS, 2007, 4698 : 681 - 692
  • [22] A Matheuristic Algorithm for the Prize-collecting Steiner Tree Problem
    Akhmedov, Murodzhon
    Kwee, Ivo
    Montemanni, Roberto
    2015 3rd International Conference on Information and Communication Technology (ICoICT), 2015, : 408 - 412
  • [23] 2-Approximation for Prize-Collecting Steiner Forest
    Department of Computer Science, University of Maryland, United States
    Proc Annu ACM SIAM Symp Discrete Algorithms, (669-693):
  • [24] 2-Approximation for Prize-Collecting Steiner Forest
    Ahmadi, Ali
    Gholami, Iman
    Hajiaghayi, MohammadTaghi
    Jabbarzade, Peyman
    Mahdavi, Mohammad
    arXiv, 2023,
  • [25] On the prize-collecting generalized minimum spanning tree problem
    Pop, P. C.
    ANNALS OF OPERATIONS RESEARCH, 2007, 150 (01) : 193 - 204
  • [26] Online Constrained Forest and Prize-Collecting Network Design
    Jiawei Qian
    Seeun William Umboh
    David P. Williamson
    Algorithmica, 2018, 80 : 3335 - 3364
  • [27] Reactive GRASP for the Prize-collecting Covering Tour Problem
    Climaco, Glaubos
    Rosseti, Isabel
    Da Silva, Rogerio
    Guerine, Marcos
    RAIRO-OPERATIONS RESEARCH, 2021, 55 (03) : 1441 - 1457
  • [28] Algorithms for the Prize-Collecting $k$-Steiner Tree Problem
    Han, Lu
    Wang, Changjun
    Xu, Dachuan
    Zhang, Dongmei
    TSINGHUA SCIENCE AND TECHNOLOGY, 2022, 27 (05) : 785 - 792
  • [29] Spider Covers for Prize-Collecting Network Activation Problem
    Fukunaga, Takuro
    ACM TRANSACTIONS ON ALGORITHMS, 2017, 13 (04)
  • [30] Solving the prize-collecting Euclidean Steiner tree problem
    Whittle, David
    Brazil, Marcus
    Grossman, Peter A.
    Rubinstein, J. Hyam
    Thomas, Doreen A.
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (03) : 1479 - 1501