An efficient branch and cut algorithm to find frequently mutated subnetworks in cancer

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 9838 LNCS, Issue , 2016, Pages 27-39

  Bomersbach, Anna ^a   Chiarandini, Marco ^a   Vandin, Fabio ^a,b,c  

^a UNIVERSITY OF SOUTHERN DENMARK   (Denmark)

^b UNIVERSITY OF PADOVA   (Italy)

^c Brown Univerity   (United States)

Author keywords

Branch and cut; Cancer mutations; Combinatorial optimization; Network analysis

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; BIOINFORMATICS; COMBINATORIAL OPTIMIZATION; ELECTRIC NETWORK ANALYSIS; GENES; INTEGER PROGRAMMING; OPTIMIZATION;

BRANCH AND CUT; BRANCH-AND-CUT ALGORITHMS; CANCER MUTATIONS; CANCER PATIENTS; COMBINATORIAL PROBLEM; ILP FORMULATION; INTERACTION NETWORKS; SOMATIC MUTATION;

DISEASES;

EID: 84984973530     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-43681-4_3     Document Type: Conference Paper

References (29)

1. Álvarez-Miranda, E., Ljubić, I., Mutzel, P.: The maximum weight connected subgraph problem. In: Jünger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 245–270. Springer, Heidelberg (2013)
2. Benetatos, L., Vartholomatos, G., Hatzimichael, E.: Polycomb group proteins and MYC: the cancer connection. Cell. Mol. Life Sci. 71(2), 257–269 (2014)
3. Bruckner, S., Hüffner, F., Karp, R.M., et al.: Topology-free querying of protein interaction networks. J. Comput. Biol. 17(3), 237–252 (2010)
4. Creixell, P., Reimand, J., Haider, S., et al.: Pathway and network analysis of cancer genomes. Nat. Methods 12(7), 615–621 (2015)
5. Ding, L., Wendl, M.C., McMichael, J.F., et al.: Expanding the computational toolbox for mining cancer genomes. Nat. Rev. Genet. 15(8), 556–570 (2014)
6. El-Kebir, M., Klau, G.W.: Solving the maximum-weight connected subgraph problem to optimality. CoRR abs/1409.5308 (2014)
7. Vandin, F., Upfal, E., Raphael, B.J.: Algorithms and genome sequencing: identifying driver pathways in cancer. Computer 45(3), 39–46 (2012)
8. 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)
9. Garraway, L.A., Lander, E.S.: Lessons from the cancer genome. Cell 153(1), 17–37 (2013)
10. Hanahan, D., Weinberg, R.A.: Hallmarks of cancer: the next generation. Cell 144(5), 646–674 (2011)
11. Hochbaum, D.S.: Approximation Algorithms for NP-hard Problems. PWS Publishing Co., Boston (1996)
12. Hudson, T.J., Anderson, W., Aretz, A., et al.: International network of cancer genome projects. Nature 464(7291), 993–998 (2010)
13. Johnson, D.S., Koch, T., Werneck, R.F., et al.: The eleventh dimacs implementation challenge. http://dimacs11.cs.princeton.edu/home.html
14. 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–i292 (2015)
15. Kim, Y.A., Salari, R., Wuchty, S., et al.: Module cover-a new approach to genotypephenotype studies. Pac. Symp. Biocomput. 135–146 (2013)
16. 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–546 (2015)
17. 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–218 (2013)
18. 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–114 (2015)
19. Ljubić, 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–3), 427–449 (2006)
20. TCGA Network: Comprehensive molecular portraits of human breast tumours. Nature 490(7418), 61–70 (2012)
21. 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)
22. 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)
23. Shrestha, R., et al.: HIT’nDRIVE: multi-driver gene prioritization based on hitting time. In: Sharan, R. (ed.) RECOMB 2014. LNCS, vol. 8394, pp. 293–306. Springer, Heidelberg (2014)
24. 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–359. Springer, Heidelberg (2008)
25. Vandin, F., Upfal, E., Raphael, B.J.: Algorithms for detecting significantly mutated pathways in cancer. J. Comput. Biol. 18(3), 507–522 (2011)
26. Vogelstein, B., Kinzler, K.W.: Cancer genes and the pathways they control. Nat. Med. 10(8), 789–799 (2004)
27. Vogelstein, B., Papadopoulos, N., Velculescu, V.E.: Cancer genome landscapes. Science 339(6127), 1546–1558 (2013)
28. Weinstein, J.N., Collisson, E.A., Mills, G.B., et al.: The cancer genome atlas pancancer analysis project. Nat. Genet. 45(10), 1113–1120 (2013)
29. 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