Abstract
Selecting a connected subnetwork enriched in individually important vertices is an approach commonly used in many areas of bioinformatics, including analysis of gene expression data, mutations, metabolomic profiles and others. It can be formulated as a recovery of an active module from which an experimental signal is generated. Commonly, methods for solving this problem result in a single subnetwork that is considered to be a good candidate. However, it is usually useful to consider not one but multiple candidate modules at different significance threshold levels. Therefore, in this paper we suggest to consider a problem of finding a vertex ranking instead of finding a single module. We also propose two algorithms for solving this problem: one that we consider to be optimal but computationally expensive for real-world networks and one that works close to the optimal in practice and is also able to work with big networks.
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
References
Alcaraz, N., Friedrich, T., Kotzing, T., Krohmer, A., Muller, J., Pauling, J., Baumbach, J.: Efficient key pathway mining: combining networks and OMICS data. Integr. Biol. 4(7), 756–764 (2012)
Beisser, D., Klau, G.W., Dandekar, T., Muller, T., Dittrich, M.T.: BioNet: an R-package for the functional analysis of biological networks. Bioinformatics 26(8), 1129–1130 (2010)
Dittrich, M.T., Klau, G.W., Rosenwald, A., Dandekar, T., Müller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 24(13), i223–i231 (2008)
El-Kebir, M., Klau, G.W.: Solving the maximum-weight connected subgraph problem to optimality (2014). arXiv:1409.5308
Hofree, M., Shen, J.P., Carter, H., Gross, A., Ideker, T.: Network-based stratification of tumor mutations. Nat. Methods 10(11), 1108–1115 (2013)
Ideker, T., Ozier, O., Schwikowski, B., Siegel, A.F.: Discovering regulatory and signalling circuits in molecular interaction networks. Bioinformatics 18(Suppl 1), S233–S240 (2002)
Jha, A.K., Huang, S.C., Sergushichev, A., Lampropoulou, V., Ivanova, Y., Loginicheva, E., Chmielewski, K., Stewart, K.M., Ashall, J., Everts, B., Pearce, E.J., Driggers, E.M., Artyomov, M.N.: Network integration of parallel metabolic and transcriptional data reveals metabolic modules that regulate macrophage polarization. Immunity 42(3), 419–430 (2015)
Langfelder, P., Horvath, S.: WGCNA: an R package for weighted correlation network analysis. BMC Bioinformatics 9(1), 559 (2008)
Loboda, A.A., Artyomov, M.N., Sergushichev, A.A.: Solving generalized maximum-weight connected subgraph problem for network enrichment analysis. In: Frith, M., Storm Pedersen, C.N. (eds.) WABI 2016. LNCS, vol. 9838, pp. 210–221. Springer, Cham (2016). doi:10.1007/978-3-319-43681-4_17
Patil, K.R., Nielsen, J.: Uncovering transcriptional regulation of metabolism by using metabolic network topology. Proc. Nat. Acad. Sci. 102(8), 2685–2689 (2005)
Sergushichev, A.A., Loboda, A.A., Jha, A.K., Vincent, E.E., Driggers, E.M., Jones, R.G., Pearce, E.J., Artyomov, M.N.: GAM: a web-service for integrated transcriptional and metabolic network analysis. Nucleic Acids Res. 44(W1), 194–200 (2016)
Acknowledgements
This work was supported by the Ministry of Education and Science of the Russian Federation (agreement 2.3300.2017).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Isomurodov, J.E., Loboda, A.A., Sergushichev, A.A. (2017). Ranking Vertices for Active Module Recovery Problem. In: Figueiredo, D., MartÃn-Vide, C., Pratas, D., Vega-RodrÃguez, M. (eds) Algorithms for Computational Biology. AlCoB 2017. Lecture Notes in Computer Science(), vol 10252. Springer, Cham. https://doi.org/10.1007/978-3-319-58163-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-58163-7_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-58162-0
Online ISBN: 978-3-319-58163-7
eBook Packages: Computer ScienceComputer Science (R0)