2013
DOI: 10.1093/bib/bbt039
|View full text |Cite
|
Sign up to set email alerts
|

Identifying protein complexes and functional modules--from static PPI networks to dynamic PPI networks

Abstract: Cellular processes are typically carried out by protein complexes and functional modules. Identifying them plays an important role for our attempt to reveal principles of cellular organizations and functions. In this article, we review computational algorithms for identifying protein complexes and/or functional modules from protein-protein interaction (PPI) networks. We first describe issues and pitfalls when interpreting PPI networks. Then based on types of data used and main ideas involved, we briefly descri… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
92
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 150 publications
(93 citation statements)
references
References 104 publications
1
92
0
Order By: Relevance
“…. , ; (9) while iter ≤ maxiter do (10) for = 1 to (11) Generation cuckoos : each V ∈ , if V ∉ Nest(:, :, ) then insert V into Cuckoo end if (12) for each cuckoo ∈ Cuckoo do (13) for each nest ∈ Nest(:, :, ) do (14) Calculate closeness(cuckoo , nest ); (15) if closeness(cuckoo , nest ) > 0 then (16) Roulette wheel selection , set nest = union(nest , cuckoo ); (17) Calculate objective function (nest ); (18) if (nest ) > (nest ) then (19) insert cuckoo into nest ; (20) end if (21) end if (22) end for (23) end for (24) Calculate the objective function (Nest(:, :, )) (25) end for (26) Find the largest objective function max = max( (Nest(:, :, ))), = 1, 2, . .…”
Section: The Icsc Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…. , ; (9) while iter ≤ maxiter do (10) for = 1 to (11) Generation cuckoos : each V ∈ , if V ∉ Nest(:, :, ) then insert V into Cuckoo end if (12) for each cuckoo ∈ Cuckoo do (13) for each nest ∈ Nest(:, :, ) do (14) Calculate closeness(cuckoo , nest ); (15) if closeness(cuckoo , nest ) > 0 then (16) Roulette wheel selection , set nest = union(nest , cuckoo ); (17) Calculate objective function (nest ); (18) if (nest ) > (nest ) then (19) insert cuckoo into nest ; (20) end if (21) end if (22) end for (23) end for (24) Calculate the objective function (Nest(:, :, )) (25) end for (26) Find the largest objective function max = max( (Nest(:, :, ))), = 1, 2, . .…”
Section: The Icsc Algorithmmentioning
confidence: 99%
“…The biological processes are dynamic and PPIs are changing over time [14]. Therefore, it is necessary to shift the study of protein complexes from static PPI networks to the dynamic characteristics of PPI networks [15]. Wang et al constructed dynamic PPI network based on time series gene expression data to detect protein complexes [16].…”
Section: Introductionmentioning
confidence: 99%
“…In (Chen et al, 2014;Wu et al, 2009), a detected cluster is assumed to match a known complex if its overlapping score is at least 0.2, which is also adopted in this study. For comparison, recall, precision and f-measure are adopted, recall and precision Lin, 1998;project;Wu et al, 2009) are defined in (10) and (11):…”
Section: Evaluation Criteriamentioning
confidence: 99%
“…F-measure (Chen et al, 2014;Li et al, 2010), as the harmonic mean of precision and recall, can be used to evaluate the overall performance in (12):…”
Section: Evaluation Criteriamentioning
confidence: 99%
See 1 more Smart Citation