2006
DOI: 10.1093/bioinformatics/btl370
|View full text |Cite
|
Sign up to set email alerts
|

Detecting functional modules in the yeast protein–protein interaction network

Abstract: Supplementary data are available at Bioinformatics online.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
246
3
4

Year Published

2007
2007
2015
2015

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 384 publications
(255 citation statements)
references
References 33 publications
2
246
3
4
Order By: Relevance
“…The data integration approach was used in some early works on predicting protein-protein interactions (10,11) and more recently by Qiu and Noble (12), but these studies focus only on predicting pairs of proteins in the same complex and not on reconstructing entire complexes. Many recent studies (13)(14)(15)(16)(17)(18)(19)(20)(21) have successfully integrated multiple types of data to predict functional linkage between proteins, constructing a graph whose pairwise affinity score summarizes the information from different sources of data. However, because the data integration is not trained toward predicting complexes, the high affinity pairs contain transient binding partners and even protein pairs that never interact directly but merely function in the same pathways.…”
mentioning
confidence: 99%
“…The data integration approach was used in some early works on predicting protein-protein interactions (10,11) and more recently by Qiu and Noble (12), but these studies focus only on predicting pairs of proteins in the same complex and not on reconstructing entire complexes. Many recent studies (13)(14)(15)(16)(17)(18)(19)(20)(21) have successfully integrated multiple types of data to predict functional linkage between proteins, constructing a graph whose pairwise affinity score summarizes the information from different sources of data. However, because the data integration is not trained toward predicting complexes, the high affinity pairs contain transient binding partners and even protein pairs that never interact directly but merely function in the same pathways.…”
mentioning
confidence: 99%
“…The Girvan-Newman algorithm has also been modified so that shortest paths are computed on weighted networks. In one approach, instead of counting the total number of shortest paths through an edge, the total number of "non-redundant" shortest paths through an edge are counted by considering paths that do not share an endpoint [16]. Edge weights are also considered by this method; in this case, weights correspond to dissimilarities between endpoints, rather than similarities or edge reliabilities.…”
Section: |mentioning
confidence: 99%
“…Network-based hierarchical clustering Apply Girvan-Newman (GN) algorithm, building a hierarchical clustering by removing edges with highest edge-betweenness [27]; extend the GN algorithm to weighted graphs and modify to consider non-redundant paths [16]; extend the GN algorithm to additionally consider local measure (edge commonality) [75]; perform agglomerative clustering in the reverse order of the GN edge removal [50].…”
Section: Local Graph Clusteringmentioning
confidence: 99%
“…Expression data have been clustered (Prelić et al 2006;Segal et al, 2004), or transformed to a graph and analyzed with topological methods (Chen and Yuan, 2006;Voy et al, 2006). Similarly, protein protein interaction (PPI) data have been transformed into an association matrix and clustered (Rives and Galitski, 2003), or analyzed with topological meth ods (Pereira Leal et al, 2004;Spirin and Mirny, 2003).…”
Section: Introductionmentioning
confidence: 99%