2010
DOI: 10.1186/1471-2164-11-s1-s3
|View full text |Cite
|
Sign up to set email alerts
|

Computational approaches for detecting protein complexes from protein interaction networks: a survey

Abstract: BackgroundMost proteins form macromolecular complexes to perform their biological functions. However, experimentally determined protein complex data, especially of those involving more than two protein partners, are relatively limited in the current state-of-the-art high-throughput experimental techniques. Nevertheless, many techniques (such as yeast-two-hybrid) have enabled systematic screening of pairwise protein-protein interactions en masse. Thus computational approaches for detecting protein complexes fro… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

6
287
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
4
3
1

Relationship

0
8

Authors

Journals

citations
Cited by 310 publications
(299 citation statements)
references
References 104 publications
(152 reference statements)
6
287
0
Order By: Relevance
“…the review [18]). Previous related works on multi resolution algorithms for clustering PPI networks either apply an algorithm multiple times with different values of the resolution parameter in order to investigate how proteins cluster at different resolution scales, e.g.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…the review [18]). Previous related works on multi resolution algorithms for clustering PPI networks either apply an algorithm multiple times with different values of the resolution parameter in order to investigate how proteins cluster at different resolution scales, e.g.…”
Section: Related Workmentioning
confidence: 99%
“…This latter investigation is motivated by the fact that PPI data are still not fully reliable, with the potential inclusion of both false positive and false negative interactions (see e.g. the discussion in [18]). Specifically, we consider fast greedy local search optimization of a clustering objective function with two different objective functions incorporating a resolution parameter: modularity [11] and a function we introduced in a recent work, called w-log-v [27].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Beginning from classical methods by Spirin & Mirny [11] and Bader & Hogue [12] that work primarily by clustering the network of protein interactions (PPI network), computational methods have come a long way, and current methods integrate diverse information with PPI networks to predict complexes. These methods have been tested extensively on data from model organisms [13,14], and are currently being extended to identify and catalogue complexes from less extensively mapped organisms including Homo sapiens [15].…”
Section: Introductionmentioning
confidence: 99%
“…The prediction of protein complexes from PPIs (see, for example, survey papers [1][2][3]) is one of the most challenging inference problems from PPIs because protein complexes are essential entities in the cell. Proteins' functions are manifested in the form of a protein *Correspondence: om@imi.kyushu-u.ac.jp 1 Institute of Mathematics for Industry, Kyushu University, 744 Motooka, Nishi-ku, 819-0395 Fukuoka, Japan Full list of author information is available at the end of the article complex.…”
Section: Introductionmentioning
confidence: 99%