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 条
  • [1] Prize-Collecting Steiner Networks via Iterative Rounding
    Hajiaghayi, MohammadTaghi
    Nasri, Arefeh A.
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 515 - +
  • [2] Euclidean Prize-Collecting Steiner Forest
    Bateni, MohammadHossein
    Hajiaghayi, MohammadTaghi
    ALGORITHMICA, 2012, 62 (3-4) : 906 - 929
  • [3] Euclidean Prize-Collecting Steiner Forest
    Bateni, MohammadHossein
    Hajiaghayi, MohammadTaghi
    LATIN 2010: THEORETICAL INFORMATICS, 2010, 6034 : 503 - 514
  • [4] Euclidean Prize-Collecting Steiner Forest
    MohammadHossein Bateni
    MohammadTaghi Hajiaghayi
    Algorithmica, 2012, 62 : 906 - 929
  • [5] Prize-Collecting Steiner Network Problems
    Hajiaghayi, MohammadTaghi
    Khandekar, Rohit
    Kortsarz, Guy
    Nutov, Zeev
    INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, PROCEEDINGS, 2010, 6080 : 71 - 84
  • [6] Prize-Collecting Steiner Network Problems
    Hajiaghayi, Mohammadtaghi
    Khandekar, Rohit
    Kortsarz, Guy
    Nutov, Zeev
    ACM TRANSACTIONS ON ALGORITHMS, 2012, 9 (01)
  • [7] Solving the Prize-collecting Rural Postman Problem
    Araoz, Julian
    Fernandez, Elena
    Meza, Oscar
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (03) : 886 - 896
  • [8] Prize-collecting Steiner Problems on Planar Graphs
    Bateni, M.
    Chekuri, C.
    Ene, A.
    Hajiaghayi, M. T.
    Korula, N.
    Marx, D.
    PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2011, : 1028 - 1049
  • [9] Prize-Collecting Steiner Tree: A 1.79 Approximation
    Ahmadi, Ali
    Gholami, Iman
    Hajiaghayi, MohammadTaghi
    Jabbarzade, Peyman
    Mahdavi, Mohammad
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1641 - 1652
  • [10] Variations of the prize-collecting Steiner tree problem
    Chapovska, Olena
    Punnen, Abraham P.
    NETWORKS, 2006, 47 (04) : 199 - 205