The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Strong lower bounds for the prize collecting Steiner problem in graphs
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
| Hi-index | 0.00 |
Into the cell, information from the environment is mainly propagated via signaling pathways which form a transduction network. Here we propose a new algorithm to infer transduction networks from heterogeneous data, using both the protein interaction network and expression datasets. We formulate the inference problem as an optimization task, and develop a message-passing, probabilistic and distributed formalism to solve it. We apply our algorithm to the pheromone response in the baker's yeast S. cerevisiae . We are able to find the backbone of the known structure of the MAPK cascade of pheromone response, validating our algorithm. More importantly, we make biological predictions about some proteins whose role could be at the interface between pheromone response and other cellular functions.