Name
Title | ||
|---|---|---|
Integration of topological measures for eliminating non-specific interactions in protein interaction networks |
Abstract | ||
|---|---|---|
High-throughput protein interaction assays aim to provide a comprehensive list of interactions that govern the biological processes in a cell. These large-scale sets of interactions, represented as protein-protein interaction networks, are often analyzed by computational methods for detailed biological interpretation. However, as a result of the tradeoff between speed and accuracy, the interactions reported by high-throughput techniques occasionally include non-specific (i.e., false-positive) interactions. Unfortunately, many computational methods are sensitive to noise in protein interaction networks; and therefore they are not able to make biologically accurate inferences. In this article, we propose a novel technique based on integration of topological measures for removing non-specific interactions in a large-scale protein-protein interaction network. After transforming a given protein interaction network using line graph transformation, we compute clustering coefficient and betweenness centrality measures for all the edges in the network. Motivated by the modular organization of specific protein interactions in a cell, we remove edges with low clustering coefficient and high betweenness centrality values. We also utilize confidence estimates that are provided by probabilistic interaction prediction techniques. We validate our proposed method by comparing the results of a molecular complex detection algorithm (MCODE) to a ground truth set of known Saccharomyces cerevisiae complexes in the MIPS complex catalogue database. Our results show that, by removing false-positive interactions in the S. cerevisiae network, we can significantly increase the biological accuracy of the complexes reported by MCODE. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1016/j.dam.2008.06.034 | Discrete Applied Mathematics |
Keywords | Field | DocType |
specific protein interaction,line graph transformation,protein interaction network,computational method,non-specific interaction,betweenness centrality,high-throughput protein interaction assay,clustering coefficient,probabilistic interaction prediction technique,graph clustering,protein-protein interaction network,s. cerevisiae network,topological measure,large-scale protein-protein interaction network,false-positive interaction,protein interaction networks,high throughput,ground truth,false positive,biological process,line graph | Topology,Line graph,Protein–protein interaction,Interaction network,Betweenness centrality,Graph rewriting,Probabilistic logic,Clustering coefficient,Cluster analysis,Mathematics | Journal |
Volume | Issue | ISSN |
157 | 10 | Discrete Applied Mathematics |
Citations | PageRank | References |
5 | 0.45 | 14 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Murat Ali Bayir | 1 | 184 | 13.46 |
| Tacettin Dogacan Guney | 2 | 5 | 0.45 |
| Tolga Can | 3 | 268 | 16.39 |