2006
DOI: 10.1016/j.compbiolchem.2006.10.001
|View full text |Cite
|
Sign up to set email alerts
|

Identification of functional modules in a PPI network by clique percolation clustering

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
40
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
5
2
2

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(41 citation statements)
references
References 24 publications
1
40
0
Order By: Relevance
“…A unique feature of the clique percolation clustering method (CPM) is that it can uncover the overlapping community structure of complex networks, i.e., one node can belong to several communities[37]. In order to detect the densely connected regions in network with possible overlap and their functions in the network, the PPI information data were imported into CFinder-2.0.6 (an open source software platform in CPM method), and the clustering analysis was easily performed.…”
Section: Methodsmentioning
confidence: 99%
“…A unique feature of the clique percolation clustering method (CPM) is that it can uncover the overlapping community structure of complex networks, i.e., one node can belong to several communities[37]. In order to detect the densely connected regions in network with possible overlap and their functions in the network, the PPI information data were imported into CFinder-2.0.6 (an open source software platform in CPM method), and the clustering analysis was easily performed.…”
Section: Methodsmentioning
confidence: 99%
“…P overlap ðX ¼ kÞ represents the probability of a random overlap between the predicted modules and experimentally determined modules (i.e. either protein complexes or functional modules; Spirin and Mirny 2003;Zhang et al 2006). The random variable X in P overlap ðX ¼ kÞ follows the hypergeometric distribution with parameters N; n1 and n2.…”
Section: Modules Found In the Yeast Protein Interaction Datamentioning
confidence: 99%
“…2) Choice Seeds From Weighted PIN: Various approaches have been developed to identify the seeds of communities [14]- [17], Baumes et al. [20], [21]'s Iterative Scan algorithm selects edges as seeds randomly and expands seeds until the new seeds produce communities that are duplicates of previously-found communities.…”
Section: ) Utilize Available Data For Building Weighted Pinmentioning
confidence: 99%