Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
- 1 July 2007
- journal article
- research article
- Published by Mary Ann Liebert Inc in Journal of Computational Biology
- Vol. 14 (6) , 747-764
- https://doi.org/10.1089/cmb.2007.r014
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.Keywords
This publication has 35 references indexed in Scilit:
- Detecting Conserved Interaction Patterns in Biological NetworksJournal of Computational Biology, 2006
- Local modeling of global interactome networksBioinformatics, 2005
- Effect of sampling on topology predictions of protein-protein interaction networksNature Biotechnology, 2005
- Conserved patterns of protein interaction in multiple speciesProceedings of the National Academy of Sciences, 2005
- Cytoscape: A Software Environment for Integrated Models of Biomolecular Interaction NetworksGenome Research, 2003
- Protein complexes and functional modules in molecular networksProceedings of the National Academy of Sciences, 2003
- Conserved pathways within bacteria and yeast as revealed by global protein network alignmentProceedings of the National Academy of Sciences, 2003
- Detection of functional modules from protein interaction networksProteins-Structure Function and Bioinformatics, 2003
- Image segmentation with ratio cutPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- A clustering algorithm based on graph connectivityInformation Processing Letters, 2000