Abstract
In a maximum sign assignment problem one is given an undirected graph and a set of signed source-target vertex pairs. The goal is to assign signs to the graph’s edges so that a maximum number of pairs admit a source-to-target path whose aggregate sign (product of its edge signs) equals the pair’s sign. This problem arises in the annotation of physical interaction networks with activation/repression signs. It is known to be NP-complete and most previous approaches to tackle it were limited to considering very short paths in the network. Here we provide a sign assignment algorithm that solves the problem to optimality by reformulating it as an integer program. We apply our algorithm to sign physical interactions in yeast and measure our performance using edges whose activation/repression signs are known. We find that our algorithm achieves high accuracy (89%), outperforming a state-of-the-art method by a significant margin.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Breitkreutz, A., Choi, H., Sharom, J.R., Boucher, L., Neduva, V., Larsen, B., Lin, Z., Breitkreutz, B., Stark, C., Liu, G., Ahn, J., Dewar-Darch, D., Reguly, T., Tang, X., Almeida, R., Qin, Z.S., Pawson, T., Gingras, A., Nesvizhskii, A.I., Tyers, M.: A global protein kinase and phosphatase interaction network in yeast. Science 328(5981), 1043–1046 (2010)
Goemans, M., Williamson, D.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115–1145 (1995)
MacIsaac, K., Wang, T., Gordon, D.B., Gifford, D., Stormo, G., Fraenkel, E.: An improved map of conserved regulatory sites for saccharomyces cerevisiae. BMC Bioinformatics 7(1), 113 (2006)
Ourfali, O., Shlomi, T., Ideker, T., Ruppin, E., Sharan, R.: SPINE: a framework for signaling-regulatory pathway inference from cause-effect experiments. Bioinformatics 23(13), i359–i366 (2007)
Peleg, T., Yosef, N., Ruppin, E., Sharan, R.: Network-free inference of knockout effects in yeast. PLoS Computational Biology 6(1), e1000635 (2010), PMID: 20066032
Reimand, J., Vaquerizas, J.M., Todd, A.E., Vilo, J., Luscombe, N.M.: Comprehensive reanalysis of transcription factor knockout expression data in saccharomyces cerevisiae reveals many new targets. Nucleic Acids Research 38(14), 4768–4777 (2010)
Yeang, C., Ideker, T., Jaakkola, T.: Physical network models. Journal of Computational Biology 11(2-3), 243–262 (2004)
Yu, H., Braun, P., Yildirim, M.A., Lemmens, I., Venkatesan, K., Sahalie, J., Hirozane-Kishikawa, T., Gebreab, F., Li, N., Simonis, N., Hao, T., Rual, J., Dricot, A., Vazquez, A., Murray, R.R., Simon, C., Tardivo, L., Tam, S., Svrzikapa, N., Fan, C., de Smet, A., Motyl, A., Hudson, M.E., Park, J., Xin, X., Cusick, M.E., Moore, T., Boone, C., Snyder, M., Roth, F.P., Barabasi, A., Tavernier, J., Hill, D.E., Vidal, M.: High-Quality binary protein interaction map of the yeast interactome network. Science 322(5898), 104–110 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Houri, S., Sharan, R. (2012). Sign Assignment Problems on Protein Networks. In: Raphael, B., Tang, J. (eds) Algorithms in Bioinformatics. WABI 2012. Lecture Notes in Computer Science(), vol 7534. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33122-0_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-33122-0_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33121-3
Online ISBN: 978-3-642-33122-0
eBook Packages: Computer ScienceComputer Science (R0)