Hypothesis generation in signaling networks.
Biological signaling networks comprise the chemical processes by which cells detect and respond to changes in their environment. Such networks have been implicated in the regulation of important cellular activities, including cellular reproduction, mobility, and death. Though technological and scientific advances have facilitated the rapid accumulation of information about signaling networks, utilizing these massive information resources has become infeasible except through computational methods and computer-based tools. To date, visualization and simulation tools have received significant emphasis. In this paper, we present a graph-theoretic formalization of biological signaling network models that are in wide but informal use, and formulate two problems on the graph: the Constrained Downstream and Minimum Knockout Problems. Solutions to these problems yield qualitative tools for generating hypotheses about the networks, which can then be experimentally tested in a laboratory setting. Using established graph algorithms, we provide a solution to the Constrained Downstream Problem. We also show that the Minimum Knockout Problem is NP-Hard, propose a heuristic, and assess its performance. In tests on the Epidermal Growth Factor Receptor (EGFR) network, we find that our heuristic reports the correct solution to the problem in seconds. Source code for the implementations of both solutions is available from the authors upon request.
Ruths
Derek A
DA
Department of Computer Science, Rice University, Houston, Texas 77005, USA.
Nakhleh
Luay
L
Iyengar
M Sriram
MS
Reddy
Shrikanth A G
SA
Ram
Prahlad T
PT
D000465:Algorithms; D001699:Biometry; D066246:ErbB Receptors / Q000378:metabolism; D006801:Humans; D008954:Models, Biological; D015233:Models, Statistical; D015398:Signal Transduction
D066246:ErbB Receptors