Solving Generalized Maximum-Weight Connected Subgraph Problem for Network Enrichment Analysis
Network enrichment analysis methods allow to identify active modules without being biased towards a priori defined pathways. One of mathematical formulations of such analysis is a reduction to a maximum-weight connected subgraph problem. In particular, in analysis of metabolic networks a generalized maximum-weight connected subgraph (GMWCS) problem, where both nodes and edges are scored, naturally arises. Here we present the first to our knowledge practical exact GMWCS solver. We have tested it on real-world instances and compared to similar solvers. First, the results show that on node-weighted instances GMWCS solver has a similar performance to the best solver for that problem. Second, GMWCS solver is faster compared to the closest analogue when run on GMWCS instances with edge weights.
KeywordsNetwork enrichment Maximum weight connected subgraph problem Exact solver Mixed integer programming
- 7.El-Kebir, M., Klau, G.W.: Solving the maximum-weight connected subgraph problem to optimality (2014). arXiv:1409.5308
- 11.Sergushichev, A., Loboda, A., Jha, A., Vincent, E., Driggers, E., Jones, R., Pearce, E., Artyomov, M.: GAM: a web-service for integrated transcriptional and metabolic network analysis. Nucleic Acids Res. (2016). http://nar.oxfordjournals.org/citmgr?type=bibtex&gca=nar%3Bgkw266v1
- 12.Ulyantsev, V., Zakirzyanov, I., Shalyto, A.: BFS-based symmetry breaking predicates for DFA identification. In: Dediu, A.-H., Formenti, E., Martín-Vide, C., Truthe, B. (eds.) LATA 2015. LNCS, vol. 8977, pp. 611–622. Springer, Heidelberg (2015)Google Scholar