Identifying functional modules in protein-protein interaction networks: an integrated exact approach

@article{dittrich_08_identifying, abstract = {Motivation: With the exponential growth of expression and protein-protein interaction (PPI) data, the frontier of research in systems biology shifts more and more to the integrated analysis of these large datasets. Of particular interest is the identification of functional modules in PPI networks, sharing common cellular function beyond the scope of classical pathways, by means of detecting differentially expressed regions in PPI networks. This requires on the one hand an adequate scoring of the nodes in the network to be identified and on the other hand the availability of an effective algorithm to find the maximally scoring network regions. Various heuristic approaches have been proposed in the literature. Results: Here we present the first exact solution for this problem, which is based on integer-linear programming and its connection to the well-known prize-collecting Steiner tree problem from Operations Research. Despite the NP-hardness of the underlying combinatorial problem, our method typically computes provably optimal subnetworks in large PPI networks in a few minutes. An essential ingredient of our approach is a scoring function defined on network nodes. We propose a new additive score with two desirable properties: (i) it is scalable by a statistically interpretable parameter and (ii) it allows a smooth integration of data from various sources. We apply our method to a well-established lymphoma microarray dataset in combination with associated survival data and the large interaction network of HPRD to identify functional modules by computing optimal-scoring subnetworks. In particular, we find a functional interaction module associated with proliferation over-expressed in the aggressive ABC subtype as well as modules derived from non-malignant by-stander cells. Availability: Our software is available freely for non-commercial purposes at http://www.planet-lisa.net. Contact: tobias.mueller@biozentrum.uni-wuerzburg.de 10.1093/bioinformatics/btn161}, author = {Dittrich, Marcus T. and Klau, Gunnar W. and Rosenwald, Andreas and Dandekar, Thomas and Muller, Tobias }, citeulike-article-id = {2937533}, doi = {http://dx.doi.org/10.1093/bioinformatics/btn161}, journal = {Bioinformatics}, keywords = {algorithm, binding, clustering, networks, proj\_assembly}, month = {July}, number = {13}, pages = {i223--231}, posted-at = {2008-07-05 16:07:16}, priority = {2}, title = {Identifying functional modules in protein-protein interaction networks: an integrated exact approach}, url = {http://dx.doi.org/10.1093/bioinformatics/btn161}, volume = {24}, year = {2008} }

TY - JOUR ID - dittrich_08_identifying L3 - citeulike-article-id:2937533 TI - Identifying functional modules in protein-protein interaction networks: an integrated exact approach JF - Bioinformatics VL - 24 IS - 13 SP - i223 EP - 231 N2 - Motivation: With the exponential growth of expression and protein-protein interaction (PPI) data, the frontier of research in systems biology shifts more and more to the integrated analysis of these large datasets. Of particular interest is the identification of functional modules in PPI networks, sharing common cellular function beyond the scope of classical pathways, by means of detecting differentially expressed regions in PPI networks. This requires on the one hand an adequate scoring of the nodes in the network to be identified and on the other hand the availability of an effective algorithm to find the maximally scoring network regions. Various heuristic approaches have been proposed in the literature. Results: Here we present the first exact solution for this problem, which is based on integer-linear programming and its connection to the well-known prize-collecting Steiner tree problem from Operations Research. Despite the NP-hardness of the underlying combinatorial problem, our method typically computes provably optimal subnetworks in large PPI networks in a few minutes. An essential ingredient of our approach is a scoring function defined on network nodes. We propose a new additive score with two desirable properties: (i) it is scalable by a statistically interpretable parameter and (ii) it allows a smooth integration of data from various sources. We apply our method to a well-established lymphoma microarray dataset in combination with associated survival data and the large interaction network of HPRD to identify functional modules by computing optimal-scoring subnetworks. In particular, we find a functional interaction module associated with proliferation over-expressed in the aggressive ABC subtype as well as modules derived from non-malignant by-stander cells. Availability: Our software is available freely for non-commercial purposes at http://www.planet-lisa.net. Contact: tobias.mueller@biozentrum.uni-wuerzburg.de 10.1093/bioinformatics/btn161 KW - algorithm KW - binding KW - clustering KW - networks KW - proj_assembly AU - Dittrich, Marcus AU - Klau, Gunnar AU - Rosenwald, Andreas AU - Dandekar, Thomas AU - Muller, Tobias PY - 2008/July/01/ UR - http://dx.doi.org/10.1093/bioinformatics/btn161 ER -