%0 Journal Article %1 KSG:07 %A Mehmet Koyuturk, Wojciech Szpankowski, Ananth Grama %D 2007 %I Mary Ann Liebert, Inc. %J Journal of Computational Biology %K assessment density sna socialnetworks %N 6 %P 747-764 %T Assessing Significance of Connectivity and Conservation in Protein Interaction Networks %V 14 %X Comparative analyses of cellular interaction networks enable understanding of the cell's modular organization through identification of functional modules and complexes. These techniques often rely on topological features such as connectedness and density, based on the premise that functionally related proteins are likely to interact densely and that these interactions follow similar evolutionary trajectories. Significant recent work has focused on efficient algorithms for identification of such functional modules and their conservation. In spite of algorithmic advances, development of a comprehensive infrastructure for interaction databases is in relative infancy compared to corresponding sequence analysis tools. One critical, and as yet unresolved aspect of this infrastructure is a measure of the statistical significance of a match, or a dense subcomponent. In the absence of analytical measures, conventional methods rely on computationally expensive simulations based on ad-hoc models for quantifying significance. In this paper, we present techniques for analytically quantifying statistical significance of dense components in reference model graphs. We consider two reference models—a G(n, p) model in which each pair of nodes in a graph has an identical likelihood, p, of sharing an edge, and a two-level G(n, p) model, which accounts for high-degree hub nodes generally observed in interaction networks. Experiments performed on a rich collection of protein interaction (PPI) networks show that the proposed model provides a reliable means of evaluating statistical significance of dense patterns in these networks. We also adapt existing state-of-the-art network clustering algorithms by using our statistical significance measure as an optimization criterion. Comparison of the resulting module identification algorithm, SIDES, with existing methods shows that SIDES outperforms existing algorithms in terms of sensitivity and specificity of identified clusters with respect to available GO annotations.

@article{KSG:07, abstract = {Comparative analyses of cellular interaction networks enable understanding of the cell's modular organization through identification of functional modules and complexes. These techniques often rely on topological features such as connectedness and density, based on the premise that functionally related proteins are likely to interact densely and that these interactions follow similar evolutionary trajectories. Significant recent work has focused on efficient algorithms for identification of such functional modules and their conservation. In spite of algorithmic advances, development of a comprehensive infrastructure for interaction databases is in relative infancy compared to corresponding sequence analysis tools. One critical, and as yet unresolved aspect of this infrastructure is a measure of the statistical significance of a match, or a dense subcomponent. In the absence of analytical measures, conventional methods rely on computationally expensive simulations based on ad-hoc models for quantifying significance. In this paper, we present techniques for analytically quantifying statistical significance of dense components in reference model graphs. We consider two reference models—a G(n, p) model in which each pair of nodes in a graph has an identical likelihood, p, of sharing an edge, and a two-level G(n, p) model, which accounts for high-degree hub nodes generally observed in interaction networks. Experiments performed on a rich collection of protein interaction (PPI) networks show that the proposed model provides a reliable means of evaluating statistical significance of dense patterns in these networks. We also adapt existing state-of-the-art network clustering algorithms by using our statistical significance measure as an optimization criterion. Comparison of the resulting module identification algorithm, SIDES, with existing methods shows that SIDES outperforms existing algorithms in terms of sensitivity and specificity of identified clusters with respect to available GO annotations.}, added-at = {2012-03-05T11:08:23.000+0100}, affiliation = {Purdue University}, author = {{Mehmet Koyuturk, Wojciech Szpankowski}, Ananth Grama}, biburl = {https://www.bibsonomy.org/bibtex/24e1d42d2d50b1aa5b38f1822551a6469/atzmueller}, interhash = {8704ee866109ee266aaf292bb298574e}, intrahash = {4e1d42d2d50b1aa5b38f1822551a6469}, journal = {Journal of Computational Biology}, keywords = {assessment density sna socialnetworks}, number = 6, pages = {747-764}, publisher = {Mary Ann Liebert, Inc.}, timestamp = {2012-03-05T11:08:23.000+0100}, title = {{Assessing Significance of Connectivity and Conservation in Protein Interaction Networks}}, volume = 14, year = 2007 }