{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:54:31Z","timestamp":1758264871462,"version":"3.41.0"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319436807"},{"type":"electronic","value":"9783319436814"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-43681-4_3","type":"book-chapter","created":{"date-parts":[[2016,8,5]],"date-time":"2016-08-05T14:51:35Z","timestamp":1470408695000},"page":"27-39","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Branch and Cut Algorithm to Find Frequently Mutated Subnetworks in Cancer"],"prefix":"10.1007","author":[{"given":"Anna","family":"Bomersbach","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Chiarandini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabio","family":"Vandin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,6]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/978-3-642-38189-8_11","volume-title":"Facets of Combinatorial Optimization","author":"E \u00c1lvarez-Miranda","year":"2013","unstructured":"\u00c1lvarez-Miranda, E., Ljubi\u0107, I., Mutzel, P.: The maximum weight connected subgraph problem. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 245\u2013270. Springer, Heidelberg (2013)"},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s00018-013-1426-x","volume":"71","author":"L Benetatos","year":"2014","unstructured":"Benetatos, L., Vartholomatos, G., Hatzimichael, E.: Polycomb group proteins and MYC: the cancer connection. Cell. Mol. Life Sci. 71(2), 257\u2013269 (2014)","journal-title":"Cell. Mol. Life Sci."},{"issue":"3","key":"3_CR3","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1089\/cmb.2009.0170","volume":"17","author":"S Bruckner","year":"2010","unstructured":"Bruckner, S., H\u00fcffner, F., Karp, R.M., et al.: Topology-free querying of protein interaction networks. J. Comput. Biol. 17(3), 237\u2013252 (2010)","journal-title":"J. Comput. Biol."},{"issue":"7","key":"3_CR4","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1038\/nmeth.3440","volume":"12","author":"P Creixell","year":"2015","unstructured":"Creixell, P., Reimand, J., Haider, S., et al.: Pathway and network analysis of cancer genomes. Nat. Methods 12(7), 615\u2013621 (2015)","journal-title":"Nat. Methods"},{"issue":"8","key":"3_CR5","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1038\/nrg3767","volume":"15","author":"L Ding","year":"2014","unstructured":"Ding, L., Wendl, M.C., McMichael, J.F., et al.: Expanding the computational toolbox for mining cancer genomes. Nat. Rev. Genet. 15(8), 556\u2013570 (2014)","journal-title":"Nat. Rev. Genet."},{"key":"3_CR6","unstructured":"El-Kebir, M., Klau, G.W.: Solving the maximum-weight connected subgraph problem to optimality. CoRR abs\/1409.5308 (2014)"},{"issue":"3","key":"3_CR7","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1109\/MC.2012.71","volume":"45","author":"F Vandin","year":"2012","unstructured":"Vandin, F., Upfal, E., Raphael, B.J.: Algorithms and genome sequencing: identifying driver pathways in cancer. Computer 45(3), 39\u201346 (2012)","journal-title":"Computer"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Fischetti, M., Leitner, M., Ljubic, I., et al.: Thinning out steiner trees: a node based model for uniform edge costs. Math. Progr. Comput. (2015, submitted)","DOI":"10.1007\/s12532-016-0111-0"},{"issue":"1","key":"3_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.cell.2013.03.002","volume":"153","author":"LA Garraway","year":"2013","unstructured":"Garraway, L.A., Lander, E.S.: Lessons from the cancer genome. Cell 153(1), 17\u201337 (2013)","journal-title":"Cell"},{"issue":"5","key":"3_CR10","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1016\/j.cell.2011.02.013","volume":"144","author":"D Hanahan","year":"2011","unstructured":"Hanahan, D., Weinberg, R.A.: Hallmarks of cancer: the next generation. Cell 144(5), 646\u2013674 (2011)","journal-title":"Cell"},{"key":"3_CR11","volume-title":"Approximation Algorithms for NP-hard Problems","author":"DS Hochbaum","year":"1996","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston (1996)"},{"issue":"7291","key":"3_CR12","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1038\/nature08987","volume":"464","author":"TJ Hudson","year":"2010","unstructured":"Hudson, T.J., Anderson, W., Aretz, A., et al.: International network of cancer genome projects. Nature 464(7291), 993\u2013998 (2010)","journal-title":"Nature"},{"key":"3_CR13","unstructured":"Johnson, D.S., Koch, T., Werneck, R.F., et al.: The eleventh dimacs implementation challenge. http:\/\/dimacs11.cs.princeton.edu\/home.html"},{"issue":"12","key":"3_CR14","doi-asserted-by":"crossref","first-page":"i284","DOI":"10.1093\/bioinformatics\/btv247","volume":"31","author":"YA Kim","year":"2015","unstructured":"Kim, Y.A., Cho, D.Y., Dao, P., et al.: Memcover: integrated analysis of mutual exclusivity and functional network reveals dysregulated pathways across multiple cancer types. Bioinformatics 31(12), i284\u2013i292 (2015)","journal-title":"Bioinformatics"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Kim, Y.A., Salari, R., Wuchty, S., et al.: Module cover-a new approach to genotype-phenotype studies. Pac. Symp. Biocomput. 135\u2013146 (2013)","DOI":"10.1142\/9789814447973_0014"},{"issue":"2","key":"3_CR16","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TNET.2014.2301816","volume":"23","author":"TW Kuo","year":"2015","unstructured":"Kuo, T.W., Lin, K.C.J., Tsai, M.J.: Maximizing submodular set function with connectivity constraint: theory and application to networks. IEEE\/ACM Trans. Netw. 23(2), 533\u2013546 (2015)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"7457","key":"3_CR17","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1038\/nature12213","volume":"499","author":"MS Lawrence","year":"2013","unstructured":"Lawrence, M.S., Stojanov, P., Polak, P., et al.: Mutational heterogeneity in cancer and the search for new cancer-associated genes. Nature 499(7457), 214\u2013218 (2013)","journal-title":"Nature"},{"issue":"2","key":"3_CR18","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1038\/ng.3168","volume":"47","author":"MD Leiserson","year":"2015","unstructured":"Leiserson, M.D., Vandin, F., Wu, H.T., et al.: Pan-cancer network analysis identifies combinations of rare somatic mutations across pathways and protein complexes. Nat. Genet. 47(2), 106\u2013114 (2015)","journal-title":"Nat. Genet."},{"issue":"2\u20133","key":"3_CR19","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107, I., Weiskircher, R., Pferschy, U., et al.: An algorithmic framework for the exact solution of the prize-collecting steiner tree problem. Math. Program. 105(2\u20133), 427\u2013449 (2006)","journal-title":"Math. Program."},{"issue":"7418","key":"3_CR20","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1038\/nature11412","volume":"490","author":"TCGA Network","year":"2012","unstructured":"TCGA Network: Comprehensive molecular portraits of human breast tumours. Nature 490(7418), 61\u201370 (2012)","journal-title":"Nature"},{"issue":"1","key":"3_CR21","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1186\/gm524","volume":"6","author":"BJ Raphael","year":"2014","unstructured":"Raphael, B.J., Dobson, J.R., Oesper, L., et al.: Identifying driver mutations in sequenced cancer genomes: computational approaches to enable precision medicine. Genome Med. 6(1), 5 (2014)","journal-title":"Genome Med."},{"issue":"2","key":"3_CR22","doi-asserted-by":"crossref","first-page":"e31826","DOI":"10.1371\/journal.pone.0031826","volume":"7","author":"MH Schaefer","year":"2012","unstructured":"Schaefer, M.H., Fontaine, J.F., Vinayagam, A., et al.: Hippie: integrating protein interaction networks with experiment based quality scores. PLoS One 7(2), e31826 (2012)","journal-title":"PLoS One"},{"key":"3_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-319-05269-4_23","volume-title":"Research in Computational Molecular Biology","author":"R Shrestha","year":"2014","unstructured":"Shrestha, R., et al.: HIT\u2019nDRIVE: multi-driver gene prioritization based on hitting time. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 293\u2013306. Springer, Heidelberg (2014)"},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Bioinformatics)","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-3-540-78839-3_30","volume-title":"Research in Computational Molecular Biology","author":"I Ulitsky","year":"2008","unstructured":"Ulitsky, I., Karp, R.M., Shamir, R.: Detecting disease-specific dysregulated pathways via analysis of clinical expression profiles. In: Vingron, M., Wong, L. (eds.) RECOMB 2008. LNCS (LNBI), vol. 4955, pp. 347\u2013359. Springer, Heidelberg (2008)"},{"issue":"3","key":"3_CR25","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1089\/cmb.2010.0265","volume":"18","author":"F Vandin","year":"2011","unstructured":"Vandin, F., Upfal, E., Raphael, B.J.: Algorithms for detecting significantly mutated pathways in cancer. J. Comput. Biol. 18(3), 507\u2013522 (2011)","journal-title":"J. Comput. Biol."},{"issue":"8","key":"3_CR26","doi-asserted-by":"crossref","first-page":"789","DOI":"10.1038\/nm1087","volume":"10","author":"B Vogelstein","year":"2004","unstructured":"Vogelstein, B., Kinzler, K.W.: Cancer genes and the pathways they control. Nat. Med. 10(8), 789\u2013799 (2004)","journal-title":"Nat. Med."},{"issue":"6127","key":"3_CR27","doi-asserted-by":"crossref","first-page":"1546","DOI":"10.1126\/science.1235122","volume":"339","author":"B Vogelstein","year":"2013","unstructured":"Vogelstein, B., Papadopoulos, N., Velculescu, V.E.: Cancer genome landscapes. Science 339(6127), 1546\u20131558 (2013)","journal-title":"Science"},{"issue":"10","key":"3_CR28","doi-asserted-by":"crossref","first-page":"1113","DOI":"10.1038\/ng.2764","volume":"45","author":"JN Weinstein","year":"2013","unstructured":"Weinstein, J.N., Collisson, E.A., Mills, G.B., et al.: The cancer genome atlas pan-cancer analysis project. Nat. Genet. 45(10), 1113\u20131120 (2013)","journal-title":"Nat. Genet."},{"key":"3_CR29","unstructured":"Wang, Y., Buchanan, A., Butenko, S.: On imposing connectivity constraints in integer programs (2015). http:\/\/www.optimization-online.org\/DB_HTML\/2015\/02\/4768.html"}],"container-title":["Lecture Notes in Computer Science","Algorithms in Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-43681-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,4]],"date-time":"2025-06-04T15:25:02Z","timestamp":1749050702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-43681-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319436807","9783319436814"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-43681-4_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}