Research Article  Open Access
Jun Ren, Wei Zhou, Jianxin Wang, "Identifying Hierarchical and Overlapping Protein Complexes Based on Essential ProteinProtein Interactions and “SeedExpanding” Method", BioMed Research International, vol. 2014, Article ID 838714, 12 pages, 2014. https://doi.org/10.1155/2014/838714
Identifying Hierarchical and Overlapping Protein Complexes Based on Essential ProteinProtein Interactions and “SeedExpanding” Method
Abstract
Many evidences have demonstrated that protein complexes are overlapping and hierarchically organized in PPI networks. Meanwhile, the large size of PPI network wants complex detection methods have low time complexity. Up to now, few methods can identify overlapping and hierarchical protein complexes in a PPI network quickly. In this paper, a novel method, called MCSE, is proposed based on module and “seedexpanding.” First, it chooses seeds as essential PPIs or edges with high edge clustering values. Then, it identifies protein complexes by expanding each seed to a module. MCSE is suitable for large PPI networks because of its low time complexity. MCSE can identify overlapping protein complexes naturally because a protein can be visited by different seeds. MCSE uses the parameter _th to control the range of seed expanding and can detect a hierarchical organization of protein complexes by tuning the value of _th. Experimental results of S. cerevisiae show that this hierarchical organization is similar to that of known complexes in MIPS database. The experimental results also show that MCSE outperforms other previous competing algorithms, such as CPM, CMC, CoreAttachment, Dpclus, HCPIN, MCL, and NFC, in terms of the functional enrichment and matching with known protein complexes.
1. Introduction
Highthroughput techniques, such as yeasttwohybrid [1], mass spectrometry [2], and protein chip technologies [3], have led to the emergence of large proteinprotein interaction (PPI) data sets. Such PPI data can be downloaded easily from public biological databases such as DIP [4], MIPS [5], and SGD [6]. They are naturally represented in the form of networks, where vertices are proteins and edges are protein interactions. As many evidences have indicated that PPI network is a “smallworld” network [7, 8] and dense subgraphs or modules in it generally correspond to protein complexes [9–13], a series of clustering methods are proposed to identify protein complexes in PPI network [12–31].
The most popular methods are densitybased methods, such as CPM [15, 16], CMC [17], CoreAttachment [18], Dpclus [19], and IPCA [20]. They identify protein complexes as dense subgraphs in PPI networks and usually have good performance because dense subgraphs in PPI networks generally correspond to protein complexes. Meanwhile, they can identify overlapping protein complexes naturally because dense subgraphs are overlapping. The main disadvantage of them is that they cannot detect the hierarchical organization of protein complexes. However, protein complexes in biological organisms are hierarchically organized [32–36]. For example, the GO annotation in GO database [32] and SGD database [36] are hierarchically organized. A more direct example is the hierarchical structure of known protein complexes of S. cerevisiae listed in the MIPS database [34].
To detect the hierarchical organization of protein complexes, hierarchical clustering algorithms, such as Monet [13] and HCPIN [21], are proposed. They start from a partition in which each node is its own community and merge clusters according to a topological measure of similarity between nodes. These methods can identify hierarchical organization of protein complexes naturally, but they cannot identify overlapping protein complexes because the initial clusters are unoverlapping nodes and the merging process cannot produce overlapping. However, many evidences have demonstrated that a protein can be in several protein complexes.
To identify both overlapping and hierarchical protein complexes in PPI network, algorithms proposed to detect the overlapping and hierarchical communities in complex networks, such as EAGLE [37] and NFC [38], can be used in PPI network. However, they both have limitations. EAGLE has high time complexity and is not suitable for large PPI networks [37]. NFC is a “seedexpanding” method and its seeds are selected randomly, which may results in the poor performance for detecting protein complexes [27, 38].
To identify both overlapping and hierarchical protein complexes in PPI network accurately and fast in large PPI networks, a novel algorithm, namely MCSE, is proposed based on “seedexpanding.” It first builds a weighted PPI network from the input PPI network according to edge clustering value. Then, it chooses essential PPIs and PPIs whose edge weights are more than average weight as seeds. At last, it identifies protein complexes by expanding each seed to a module in the weighted PPI network. MCSE runs fast and identifies overlapping protein complexes naturally because it is a “seedexpanding” method. The construction of weighted PPI network and the selection of seed in MCSE improve its efficiency. MCSE uses the parameter _th to control the expanding range and can detect protein complexes in different hierarchical levels by tuning _th value. Experimental results of S. cerevisiae show that the hierarchical structure of protein complexes identified by MCSE is approximately corresponding to that of known protein complexes in MIPS database. More importantly, MCSE can identify protein complexes more accurately than other competing algorithms, such as CPM [15, 16], CMC [17], CoreAttachment [18], Dpclus [19], HCPIN [21], MCL [31], and NFC [38].
2. Methods
To identify both overlapping and hierarchical protein complexes in PPI networks fast, we develop a novel protein complex detection method based on “seedexpanding”. Seedexpanding method is a local search method and has low time complexity. It can identify overlapping protein complexes naturally because a protein can be visited by different seeds. To develop a seedexpanding method, three issues should be solved: seed selection; rules for expanding, which decide which node can be added into the expanding cluster; finish conditions, which decide the end of an expansion from a seed. We explicate these three issues of our method as follows.
2.1. Seed Selecting
Many evidences have indicated that a PPI with high edge clustering value in a PPI network has high possibility to be in a protein complex [21, 24]. To verify whether it is true or not, Figure 1 shows the percentage of PPIs in protein complexes with respect to different range of edge clustering value (ECV). The PPI network is a PPI network of S. cerevisiae downloaded from DIP database (version 2010.6 http://dip.doembi.ucla.edu/dip/Download.cgi/) and named as YDIP [39]. The protein complex set of S. cerevisiae is the latest one provided by Pu et al. in [40], which includes 408 complexes and is named as CY408. The edge clustering value of an edge , namely, ECV, in a PPI network is calculated as [21], where is the weight of edge when is a weighted PPI network and is equal to 1 when is an unweighted PPI network, the and are the sets of neighbors of vertex and vertex , respectively, and denotes the set of common vertices in and (i.e., ).
As shown in Figure 1, it is obviously the PPI with high edge clustering value has high possibility to be in a protein complex. So, it is naturally to choose seeds as PPIs with high edge clustering value in a PPI network. According to Figure 1, we simply define the edge’s weight as an increasing function of its edge clustering value. The weight of an edge in a PPI network , namely, , is calculated as follows [24]: where ECV_{avg} is the average edge clustering value of the whole PPI network , is a given small constant reflecting the possibility of the PPI with in a protein complex. Its typical value is 0.2 [24].
According to formula (2), a weighted PPI network is created from the unweighted PPI network YDIP. This weighted PPI network has 15,166 PPIs and 2921 (19%) PPIs have weights not less than the average weight. Out of all 15,166 PPIs, only 2130 (14%) PPIs are in protein complexes of CY408. Meanwhile, out of 2921 PPIs whose weights are not less than the average weight, 1495 (51%) PPIs are in protein complexes of CY408. The possibility of a PPI whose weight is not less than the average weight to be in a protein complex is about 3.64 times of that of a PPI selected randomly. So, it is reasonable to choose PPIs with weight not less than the average weight as seed edges.
Besides topological properties of PPI network, other biological properties are also important prediction factors for protein complexes. For example, He and Zhang classified PPIs as essential PPIs and nonessential PPIs [41]. In recent years, many computational methods have been proposed to identify essential proteins in PPI networks [42–49]. An essential PPI is a PPI whose two proteins are both essential proteins [41]. Essential PPIs are more important than nonessential PPIs because they play more important role in the survival and propagation of living organisms [41]. Thus, it is reasonable to believe that an essential PPI is more likely to be in a protein complex than a nonessential PPI. For example, in all 3045 essential PPIs in the PPI network YDIP, 960 (31.5%) are in protein complexes of CY408, which is 2.24 times of that of a PPI selected randomly. So, it is reasonable to choose essential PPIs as seed edges.
The two kinds of seed edges are different. One is based on PPI’s essentiality. The other is based on PPI’s edge clustering value. They complement each other well. So, we assign the final seed set as the union set of both kinds of seed edges. We sort the seed edges by weight first, and by essentiality second, because the PPI with high weight is more likely (the possibility is 51%) to be in a protein complex than an essential PPI (the possibility is only 31.5%).
2.2. Rules for Expanding
To decide which node can be added into the expanding cluster, we define the cluster property of a node to a cluster to describe how compactly connected they are. Obviously, the more edges node has to connect to the cluster , the more compactly connected they are, and the more likely they are to belong to the same protein complex. So, in an unweighted PPI network, it is reasonable to define the cluster property of a node to a cluster as the number of edges connecting and . When a cluster is expanding, the node which has the highest value of cluster property to it will be added into it.
In our method, we first build a weighted PPI network to select seeds. In the weighted PPI network, the higher weight an edge has, the more likely it is to be in a protein complex. Evidences have demonstrated that performance of protein complex detection methods can be improved when they are applied to the weighted PPI network whose edge’s weight reflects the possibility of the edge in a protein complex [50–52]. So, it is reasonable to identify protein complexes in our weighted PPI network. In the weighted PPI network, if edges connecting a node and a cluster have higher weights, and are more likely to belong to the same protein complex. Based on it, in a weighted PPI network , we extend the definition of cluster property of a node to a cluster , namely, , as the sum of weights of edges connecting and . Consider where is the edge set of , is the weight of edge . When is an unweighted PPI network, all edges’ weights are equal to 1.
2.3. Finish Conditions
Many protein complex models, such as dense subgraph, maximum clique [11, 14], cliquecommunity [15], weak module and strong module [13, 26], and module [21], have been proposed for identifying protein complexes in PPI networks. We choose module as protein complex model and finish a seed’s expansion when the cluster expanding from the seed is a module. Wang et al. defined module as a subgraph whose value is not less than the given threshold [21]. The value of a subgraph in a PPI network , namely, , is defined as [21] where is the weighted indegree of in , which is defined as the sum of weights of edges connecting vertex to other vertices in and is the weighted outdegree of in , which is defined as the sum of weights of edges connecting vertex to vertices in . The reasons that we choose module as the protein complex model in our method are listed as follows.(1)In real biological organism, protein complexes frame a hierarchical organization. The larger protein complex is in higher level and includes (fully or partially) smaller protein complexes in lower levels [32–36]. When a seed edge is expanding, it first reaches a subgraph with small value, that is a module to a small threshold. Then, with the subgraph expanding, it become a subgraph with larger value, that is a module to a larger threshold. So, when given a smaller threshold, the expansion from a seed will be ended quickly and generate a smaller subgraph. When given a larger threshold, the expansion from the same seed will be ended later and generate a larger subgraph which includes that smaller subgraph corresponding to the smaller threshold. Thus, by tuning the value of threshold, we can identify protein complexes in different hierarchical levels.(2)With more and more protein complexes being known, researchers found that many protein complexes are not dense subgraphs in PPI networks [12, 13]. So, using dense subgraph or clique as protein complex model has its own limits. The basic idea behind using module as protein complex module is that researchers have found that many protein complexes are densely connected within themselves but sparsely connected with the rest of the PPI network [12, 13, 21]. Thus, our method can identify protein complexes with different density by using module as protein complex module.
2.4. Algorithm MCSE
Based on the decision of seed selection, rules for expanding, and finish conditions, a novel clustering algorithm based on “seedexpanding,” namely, Mining Complexes based on Seed Expanding (MCSE), is proposed to identify overlapping and hierarchical protein complexes in PPI networks. The detailed description of algorithm MCSE is shown in Algorithm 1. The input of algorithm MCSE is a given value of threshold _th, a set of essential PPIs , and a PPI network which is described as a simple undirected graph . The input PPI network can be weighted or unweighted PPI network. If it is an unweighted PPI network, all edges’ weights are set as 1.

Algorithm MCSE has four stages: weight calculating, seed selecting, seed expanding, and outputting. Firstly, algorithm MCSE calculate each edge’s weight by formula (2) and build the new weighted PPI network . Secondly, edges whose weights not less than average weight and edges in essential PPIs set are selected as seed edges. They are sorted into seed queue in nonincreasing order by the weight first and essentiality second. Thirdly, when the seed queue is not null, MCSE will always select the first edge in as the seed to expand to a module by gradually adding neighbor vertex with highest cluster property. The module is considered as an identified protein complex and its vertices are marked. Then, edges which include the marked vertices are removed from . The seed expanding will stop when the seed queue is null. Finally, MCSE outputs all identified protein complexes. To avoid identified protein complexes highly overlapping, the expansion of a seed will be ended and its expanding cluster will be abandoned if the cluster has more than half of vertices in other identified protein complexes.
3. Results
To evaluate the performance of our algorithm MCSE, we compare it with seven previous competing algorithms, CPM [15, 16], CMC [17], CoreAttachment [18], Dpclus [19], HCPIN [21], MCL [31], and NFC [38], for detecting protein complexes in an unweighted PPI network. Our method MCSE and the other seven algorithms except HCPIN can all identify overlapping protein complexes. HCPIN, NFC, and our method MCSE can all detect hierarchical organization of protein complexes. Dpclus, NFC, and our method MCSE are all seedexpanding method. In the experiments, the values of the parameters in each algorithm are selected from those recommended by the authors.
In Section 3, the datasets and evaluation methods used in the paper are described first. Then, performance of our method MCSE and the effect of parameter _th on clustering results are discussed. Thirdly, the comparison of the known hierarchical protein complexes and those identified by MCSE is studied. Fourthly, the comparison of the performance of MCSE and seven other algorithms is studied in terms of matching with the known protein complexes and functional enrichment. Finally, the effect of seed selection and weighted PPI network for identifying protein complexes is discussed.
3.1. Datasets and Evaluation Methods
To test the performance of MCSE, we apply MCSE and other seven algorithms to an unweighted PPI network of S. cerevisiae. The original network is downloaded from DIP database (version 2010.6 http://dip.doembi.ucla.edu/dip/Download.cgi/). By removing all the selfconnecting interactions and repeated interactions, the final network, named YDIP, includes 4,746 proteins and 15,166 interactions. To find the essential PPIs, a list of essential proteins is downloaded from MIPS database (http://dip.doembi.ucla.edu/dip/Download.cgi/), which contains 1,285 essential proteins.
Two kinds of known protein complex set are used in the paper. One is composed of hierarchical protein complexes of S. cerevisiae and downloaded from MIPS database [34]. These hierarchical protein complexes form a fivelayer forest. The first layer is composed of leafcomplexes which have no subcomplexes. The second layer is composed of the fathercomplexes of protein complexes in the first layer, and so on. In the five layers, the numbers of complexes are 256, 46, 17, 4, and 1, respectively. The complexes in the top three layers are few. So, to judge the performance for identifying complexes in different levels, we compare the identified complex sets only with the first layer and second layers, respectively. The other kind of protein complex set is provided by the literature published in [40]. It is the latest protein complex set of S. cerevisiae but cannot be used to estimate the performance for identifying hierarchical complexes because its protein complexes are all leafcomplexes.
Two kinds of criteria are used in the paper to evaluate the performance of algorithms for identifying protein complexes. One is matching the identified protein complex set with the known protein complex set directly. In the criterion, an identified complex and a known complex are considered as a match if their overlapping score is not less than a specific threshold. The overlapping score is calculated as [12, 19, 21] where and are the numbers of proteins in and , respectively. Based on the match of identified complexes and known complexes, three evaluation criteria are used to quantify the quality of protein complex detection methods:(1)Specificity (Sp) is defined as the fraction of identified complexes matched by known complexes among all identified complexes [12, 19].(2)Sensitivity (Sn) is defined as the fraction of known complexes matched by identified complexes among all known complexes [12, 19].(3)Fscore combines the sensitivity and specificity scores [21]. It is defined as
In the three evaluation criteria, sensitivity is susceptible to the number of identified complexes because the number of known complexes matched by identified complexes will increase with the increase of the number of identified complexes. So, it is not used in the paper as numbers of complexes identified by the eight methods are quite different.
The other criterion is the functional enrichment of the identified complexes. In the criterion, the value of a complex with a given GO term is used to estimate whether the proteins in the complex are enriched for the GO term with a statistically significant probability compared to what one would expect by chance. A complex can have various values for various GO terms. In the paper, the value of a complex defaults to its lowest value. For each identified complex, we use the GO AmiGO (http://amigo.geneontology.org/cgibin/amigo/go.cgi) to calculate its value. An identified complex with a smaller value indicates that it is accumulated at random with a smaller chance and is more biologically significant than one with a larger value [30].
3.2. Identification of Hierarchical and Overlapping Protein Complexes in the PPI Network of S. cerevisiae
Parameter _th is used to control the expand degree. To evaluate the effect of parameter _th on clustering results, we set the values of parameter _th as 0.25, 0.5, 1, 2, 4, 8, and 16 and achieve seven different output sets of identified complexes from YDIP. Characteristics of these seven output sets, such as the number of complexes, the average size of complexes, the average density and the minimum density of complexes, and overlapping rate of the complex set, are listed in Table 1. The overlapping rate of a complex set , , is used to evaluate the overlap of all complexes in and defined as follows [53]: where is a complex set, is the number of vertices in complex , and is the total number of vertices in .

As shown in Table 1, the number of identified complexes is decreasing and the average size of identified complexes is increasing quickly with the increase of _th value. The possible reason is the larger value of _th which lead to more nodes added into the cluster when it is expanding and results in larger size of identified complex. Meanwhile, when a seed is expanding to a larger cluster with _th increasing, more other seeds are included in the cluster and deleted from the seed queue, which results in the decrease of the number of identified complexes. Table 1 shows that the average density of identified complexes is high for each _th value. It is because when a cluster is expanding, the node added into it every time is the node with the highest cluster property to the cluster. So, MCSE is also a densitybased local search method and the protein complexes identified by it trend to dense subgraphs. However, as shown in Table 1, the minimum density of identified complexes in each output set is small, which means that unlike other methods based on dense subgraphs, such as CMC and MCSE, can also identify protein complexes with small density. The overlapping rates of all identified complex sets are more than 1, which means MCSE can identify overlapping protein complexes.
When a seed is expanding, more nodes will be added with _th increasing, which causes the identified protein complexes in the set of lager _th value to include (fully or partially) those in the set of smaller _th value. So, by tuning _th value, MCSE can identify protein complexes in different levels. For example, the seven output sets in the Table 1 are composed of a hierarchical organization of protein complexes and Figure 2 illustrates part of it.
As shown in Figure 2, the identified protein complex #35 in the layer of includes two identified protein complexes #35 and #98 in the layer of . Its subcomplex #35 in the layer of includes five identified protein complexes, #38, #43, #189, #218, and #219, in the layer of . Another subcomplex #98 in the layer of includes two identified protein complexes, #107 and #118, in the layer of . The identified protein complex #43 in the layer of , which is a subcomplex of complex #35 in the layer of , also includes three identified protein complexes, #49, #141, and #230, in the layer of . Another subcomplex #189 in the layer of includes two identified protein complexes, #96 and #262 in the layer of .
3.3. Comparison with Hierarchical Complexes in MIPS Database
Gavin and Krogan [35, 36] pointed out that some protein complexes are hierarchically organized and composed of several subcomplexes. To judge whether the hierarchical organization of complexes identified by MCSE is similar to that of known protein complexes of S. cerevisiae in MIPS database, we compare seven identified complex sets corresponding to different _th values with the first layer and second layers of known hierarchical complexes in MIPS database and list their Fscore values in Figure 3. Fscore values corresponding to the first layer form the blue line named as “comparing with first layer” and those corresponding to the second layer form the red line named as “comparing with second layer.” Here, we use Fscore because it combines both sensitivity and specificity. The overlapping scores threshold is set as 0.2 because in many literatures, an identified complex and a known complex are considered as a match if their overlapping score is not less than 0.2 [12, 19, 21].
Seen from the blue line, it is obvious when comparing with the first layer that the Fscore values of identified complex sets in low layers () are much higher than those in high layers . It means the identified complex sets in low layers match the first layer of hierarchical protein complexes better than those in high layers. On the contrary, seen from the red line, the identified complex sets in high layers ( or ) match the second layer better than those in low layers .
Compared with these two lines, we can see that when the Fscore value in blue line is higher than that in red line, but when the opposite is the case. It means the identified complex set in the low layer matches the first layer of the hierarchical known complexes better than the second layer, but with the identified complex set in high layer the opposite is the case. Concluding the above, the hierarchical structure of complexes identified by MCSE is similar to that of known complexes in MIPS database.
To compare the performance of MCSE and other seven complex detection methods for identifying complexes in different levels, we compare their identified complex sets with the first and second layers of known hierarchical complexes in MIPS database, respectively. The parameter values of all algorithms are selected the optimum values. As HCPIN, NFC, and MCSE can identify hierarchical protein complexes, their parameter values are different when compared with the different layers. For example, Figure 3 shows the complex set identified by MCSE matches the first layer best when and the second layer best when . So, the values of parameter _th of MCSE are set as 0.5 and 8 when compared with the first layer and second layer, respectively. Similarly, the parameter values of NFC and HCPIN can also be obtained by experimental results. Notably, the experimental results show that whether compared with the first layer or with the second layer, the optimum value of parameter of NFC is always 1. The other five algorithms, CMC, CoreAttachment, CPM, Dpclus, and MCL, cannot identify protein complexes in different layers. Thus, whether compared with the first layer or with the second layer, their selected parameter values are always those recommended by the authors.
Figure 4 list the values of specificity and Fscore of MCSE and other seven algorithms when compared with the first layer. In the Figure, MCSE has the highest value of specificity and Fscore in the eight algorithms for each overlapping score’s threshold. For example, when overlapping score’s threshold is the typical value of 0.2, the specificity value of MCSE is 0.38 and those of the other seven algorithms are from 0.12 to 0.26, which means the percentage of matched complexes in the complex set identified by MCSE is improved 48% to 223%. Meanwhile, the Fscore value of MCSE is 0.45 and those of the other seven algorithms are from 0.19 to 0.34. Figure 4 shows that the protein complex set identified by MCSE matches the first layer of known hierarchical complexes in MIPS database better than other seven algorithms.
(a) Comparison of specificity (Sp)
(b) Comparison of Fscore
Figure 5 list the values of specificity and Fscore of MCSE and other seven algorithms when compared with the second layer. Figure 5 shows MCSE also has the highest values of specificity and Fscore. It means the protein complex set identified by MCSE matches the second layer of known hierarchical complexes in MIPS database better than those identified by other seven algorithms. Notably, Figure 5 shows MCSE has much higher values of specificity and Fscore when compared with the algorithms cannot identify hierarchical complexes. This is because MCSE can identify protein complexes in high layer by adjusting the value of parameter _th. Concluding the above, MCSE can identify protein complexes in different layers. So its identified complexes match the protein complexes in both low and high layers well.
(a) Comparison of Specificity (Sp)
(b) Comparison of Fscore
3.4. Comparison with Other Algorithms in Terms of Matching with Known Complexes
To directly validate the effectiveness of algorithm MCSE for identifying protein complexes, we compare the protein complexes identified by MCSE and other seven algorithms with the latest known protein complexes of S. cerevisiae which provided in [40] and list their specificity and Fscore in Figure 6, respectively. The known protein complex set used here is composed of leafcomplexes. So, the output set of MCSE should be the low layer and we set the parameter value of _th as 0.5.
(a) Comparison of specificity (Sp)
(b) Comparison of Fscore
As shown in Figure 6(a), when overlapping score’s threshold is equal to 0.2, the specificity value of MCSE is 0.58, which means about 58% complexes detected by MCSE are matched by the known complexes. Compared with other seven methods, this ratio is improved 48% (compared with CMC) to 236% (compared with CoreAttachment) at the same threshold. Furthermore, Figure 6(a) shows that when overlapping score’s threshold less than 0.5, the specificity value of MCSE is higher than those of other seven methods.
As shown in Figure 6(b), for each overlapping score’s threshold, the Fscore value of MCSE is higher than those of other seven methods (expect for those of HCPIN when overlapping score’s threshold is equal to 0.7 and 0.8), especially when overlapping score’s threshold is not more than 0.6. For example, when overlapping score’s threshold is equal to 0.2, the Fscore value of MCSE is 0.54. Compared with the highest Fscore value of the seven other algorithms (which is 0.32 of Dpclus), 68% improvement is obtained by using MCSE algorithm.
Figure 6(a) shows that the percentage of matched complexes in the complex set identified by MCSE is much higher than those identified by other seven methods. Figure 6(b) shows MCSE outperforms other seven methods by considering both specificity and sensitivity. All these indicate that our method MCSE identifies known protein complexes more effectively than other seven methods.
3.5. Comparison with Other Algorithms in Terms of Functional Enrichment
To evaluate the biological significance of complexes identified by MCSE, we calculate value of each complex identified by MCSE and other seven methods in YDIP. Table 2 lists the percentages of the identified complexes whose value falls within , , , , 0.01, and . Generally speaking, an identified complex with value less than 0.01 is considered significant [21, 27–29]. As shown in Table 2, 79.3% of complexes identified by MCSE are significant. Compared with the results of other seven methods, this percentage is improved, 22.6% (compared with CMC) to 122.1% (compared with CoreAttachment). On the other hand, the percentage of insignificant complexes identified by MCSE is not more than half of those identified by other seven methods. All these indicate the protein complexes identified by MCSE are more biologically significant than those identified by other seven methods.

3.6. The Effect of Seed Selection
MCSE is a “seedexpanding” method. To select seeds, we build a weighted PPI network YDIP^{W} from YDIP according to formula (2) and choose seeds as PPIs whose weights are not less than the average weight of YDIP^{W} and essential PPIs. The basic idea of this seed selection is the two kinds of PPIs are much more likely to be in a protein complex than those selected randomly and they are well complementary to each other.
To test the effect of this seed selection on identification of protein complexes, we compare it with other three strategies of seed selection. The first one selects seeds as PPIs whose weights are not less than the average weight of YDIP^{W}. The second one selects seeds as all essential PPIs. The third one selects seeds randomly and the number of these seeds is as same as that of MCSE. The modified MCSE algorithms based on the three strategies are named as MCSE (ECV), MCSE (Essential), and MCSE (Random), respectively.
The protein complexes identified by MCSE and these three modified algorithms are compared with the latest known protein complexes of S. cerevisiae and their Fscore are shown in Figure 7. The values of parameter _th of the four algorithms are set as 0.5. As shown in Figure 7, for each overlapping score’s threshold, the values of Fscore of MCSE (ECV) and MCSE (essential) are almost same and both much higher than that of MCSE (random). For example, when overlapping score’s threshold is equal to 0.2, the values of Fscore of MCSE (ECV) and MCSE (essential) are 0.509 and 0.515, respectively, and that of MCSE (random) is only 0.341. Compared with the value of Fscore of MCSE (random), the values of Fscore of MCSE (ECV) and MCSE (essential) are improved about 50%. It means seed selection is important for the performance of our method MCSE, and both MCSE (ECV) and MCSE (essential) are good seed selections. The reason is a PPI’s essentiality and its edge clustering value in a PPI network are all effective factors to predict whether the PPI is in a protein complex or not. So, choosing seeds according to either of them can improve the performance.
As shown in Figure 7, for each overlapping score’s threshold, the value of Fscore of MCSE is highest. For example, when overlapping score’s threshold is equal to 0.2, the value of Fscore of MCSE is 0.545, which is improved 7% and 6% when compared with that of MCSE (ECV) and MCSE(essential), respectively. It means the performance can be improved further when combing both kinds of seeds. The reason is some protein complexes including PPIs with high edge clustering value but not essential PPIs, but with other protein complexes the opposite is the case. Obviously, the former kind of protein complexes cannot be identified by MCSE (essential) and the latter kind of protein complexes cannot be identified by MCSE(ECV). However, both kinds of protein complexes can be identified by MCSE.
3.7. The Effect of Weighted PPI Network
To improve the accuracy for identifying protein complexes, our method MCSE adopts two ways, selecting seed and building weighted PPI network. The effect of seed selection is discussed in the previous section. In this section, to discuss the effect of weighted PPI network, we modify algorithm MCSE as MCSE (unweighted) by expanding seeds on the unweighted PPI network YDIP instead of on the weighted PPI network YDIP^{W} and compare the values of Fscore of MCSE and MCSE (unweighted) in Figure 8. Here, the seed queues of both algorithms are same, the values of parameter _th of both algorithms are set as 0.5, and the known protein complexes are provided by [40].
As shown in Figure 8, for each overlapping score’s threshold, the Fscore value of MCSE is higher than that of MCSE (unweighted). For example, when overlapping score’s threshold is equal to 0.2, the value of Fscore of MCSE is 0.545 and that of MCSE (unweighted) is 0.362. The improvement of MCSE is 50.3%. It means the accuracy of MCSE for identifying protein complex can be improved effectively by expanding seeds on our weighted PPI network.
4. Conclusion
In the postgenome era, one major work is to identify protein complexes from large PPI networks. Various evidences have demonstrated they are overlapping and hierarchically organized [8–14]. However, it is still a challenge to identify hierarchical and overlapping protein complexes accurately in large PPI networks. Aiming at it, a novel method, namely, MCSE, is developed based on “seedexpanding” and module. It is a local search algorithm and can identify protein complexes in a large PPI network quickly. As a protein can be added into several clusters when they are expanding from different seeds, MCSE can identify overlapping protein complexes naturally. Meanwhile, MCSE can detect hierarchical organization of overlapping protein complexes by tuning the value of parameter _th to control the expanding degree. Experimental results of S. cerevisiae show this hierarchical organization is similar to that of known protein complexes in MIPS database. We also compare the performances of our algorithm MCSE to other seven competing algorithms: CPM, CMC, CoreAttachment, MCL, Dpclus, NFC, and HCPIN. Experimental results of S. cerevisiae show that our method MCSE outperforms them in terms of matching with known protein complexes and functional enrichment.
Conflict of Interests
The authors declare that there is no conflict of interests regarding the publication of this paper.
Authors’ Contribution
Jun Ren and Wei Zhou contributed equally to this work.
Acknowledgments
This work is supported in part by the National Natural Science Foundation of China under Grant nos. 61232001, 61379108, 61300130, and 31301388; the Program for New Century Excellent Talents in University (NCET120547), China Postdoctoral Science Foundation 2013M531811, and the Hunan Provincial Natural Science Foundation of China (no. 14JJ3092).
References
 P. Uetz, L. Glot, G. Cagney et al., “A comprehensive analysis of proteinprotein interactions in Saccharomyces cerevisiae,” Nature, vol. 403, no. 6770, pp. 623–627, 2000. View at: Publisher Site  Google Scholar
 Y. Ho, A. Gruhler, A. Heilbut et al., “Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry,” Nature, vol. 415, no. 6868, pp. 180–183, 2002. View at: Publisher Site  Google Scholar
 H. Zhu, M. Bilgin, R. Bangham et al., “Global analysis of protein activities using proteome chips,” Science, vol. 293, no. 5537, pp. 2101–2105, 2001. View at: Publisher Site  Google Scholar
 I. Xenarios, Ł. Salwínski, X. J. Duan, P. Higney, S.M. Kim, and D. Eisenberg, “DIP, the Database of Interacting Proteins: a research tool for studying cellular networks of protein interactions,” Nucleic Acids Research, vol. 30, no. 1, pp. 303–305, 2002. View at: Google Scholar
 H. W. Mewes, D. Frishman, U. Güldener et al., “MIPS: a database for genomes and protein sequences,” Nucleic Acids Research, vol. 30, no. 1, pp. 31–34, 2002. View at: Google Scholar
 L. IsselTarver, K. R. Christie, K. Dolinski et al., “Saccharomyces genome database,” Methods in Enzymology, vol. 350, pp. 329–346, 2002. View at: Publisher Site  Google Scholar
 A. del Sol and P. O'Meara, “Smallworld network approach to identify key residues in proteinprotein interaction,” Proteins, vol. 58, no. 3, pp. 672–682, 2005. View at: Publisher Site  Google Scholar
 A. del Sol, H. Fujihashi, and P. O'Meara, “Topology of smallworld networks of proteinprotein complex structures,” Bioinformatics, vol. 21, no. 8, pp. 1311–1315, 2005. View at: Publisher Site  Google Scholar
 J. Wang, X. Peng, M. Li, and Y. Pan, “Construction and application of dynamic protein interaction network based on time course gene expression data,” Proteomics, vol. 13, no. 2, pp. 301–312, 2013. View at: Publisher Site  Google Scholar
 A. Barabasi and Z. Oltvai, “Network biology: understanding the cells’s functional organization,” Nature Reviews Genetics, vol. 5, no. 2, pp. 101–113, 2004. View at: Google Scholar
 V. Spirin and L. A. Mirny, “Protein complexes and functional modules in molecular networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 21, pp. 12123–12128, 2003. View at: Publisher Site  Google Scholar
 J. Wang, X. Peng, W. Peng, and F. Wu, “Dynamic protein interaction network construction and applications,” Proteomics, vol. 14, pp. 338–352, 2014. View at: Google Scholar
 F. Luo, Y. Yang, C. Chen, R. Chang, J. Zhou, and R. H. Scheuermann, “Modular organization of protein interaction networks,” Bioinformatics, vol. 23, no. 2, pp. 207–214, 2007. View at: Google Scholar
 X.L. Li, S.H. Tan, C.S. Foo, and S.K. Ng, “Interaction graph mining for protein complexes using local clique merging,” Genome Informatics, vol. 16, no. 2, pp. 260–269, 2005. View at: Google Scholar
 G. Palla, I. Derényi, I. Farkas, and T. Vicsek, “Uncovering the overlapping community structure of complex networks in nature and society,” Nature, vol. 435, no. 7043, pp. 814–818, 2005. View at: Publisher Site  Google Scholar
 B. Adamcsek, G. Palla, I. J. Farkas, I. Derényi, and T. Vicsek, “CFinder: locating cliques and overlapping modules in biological networks,” Bioinformatics, vol. 22, no. 8, pp. 1021–1023, 2006. View at: Publisher Site  Google Scholar
 G. Liu, L. Wong, and H. N. Chua, “Complex discovery from weighted PPI networks,” Bioinformatics, vol. 25, no. 15, pp. 1891–1897, 2009. View at: Publisher Site  Google Scholar
 H. C. M. Leung, Q. Xiang, S. M. Yiu, and F. Y. L. Chin, “Predicting protein complexes from PPI data: a coreattachment approach,” Journal of Computational Biology, vol. 16, no. 2, pp. 133–144, 2009. View at: Publisher Site  Google Scholar
 M. AltafUlAmin, Y. Shinbo, K. Mihara, K. Kurokawa, and S. Kanaya, “Development and implementation of an algorithm for detection of protein complexes in large interaction networks,” BMC Bioinformatics, vol. 7, article 207, 2006. View at: Publisher Site  Google Scholar
 M. Li, J.E. Chen, J.X. Wang, B. Hu, and G. Chen, “Modifying the DPClus algorithm for identifying protein complexes based on new topological structures,” BMC Bioinformatics, vol. 9, article 398, 2008. View at: Publisher Site  Google Scholar
 J. Wang, M. Li, J. Chen, and Y. Pan, “A fast hierarchical clustering algorithm for functional modules discovery in protein interaction networks,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 8, no. 3, pp. 607–620, 2011. View at: Publisher Site  Google Scholar
 J. Wang, B. Liu, M. Li, and Y. Pan, “Identifying protein complexes from interaction networks based on clique percolation and distance restriction,” BMC Genomics, vol. 11, supplement 2, article S10, 2010. View at: Publisher Site  Google Scholar
 P. Jiang and M. Singh, “SPICi: a fast clustering algorithm for large biological networks,” Bioinformatics, vol. 26, no. 8, pp. 1105–1111, 2010. View at: Publisher Site  Google Scholar
 J. Ren, J. Wang, M. Li, and L. Wang, “Identifying protein complexes based on density and modularity in proteinprotein interaction network,” BMC Systems Biology, vol. 7, supplement 4, article S12, 2013. View at: Google Scholar
 B. Zhao, J. Wang, M. Li, F. X. Wu, and Y. Pan, “Detecting protein complex based on uncertain graph model,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2014. View at: Publisher Site  Google Scholar
 F. Radicchi, C. Castellano, F. Cecconi, V. Loreto, and D. Paris, “Defining and identifying communities in networks,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 9, pp. 2658–2663, 2004. View at: Publisher Site  Google Scholar
 J. Wang, J. Ren, M. Li, and F.X. Wu, “Identification of hierarchical and overlapping functional modules in PPI networks,” IEEE Transactions on Nanobioscience, vol. 11, no. 4, pp. 386–393, 2012. View at: Publisher Site  Google Scholar
 J. Wang, G. Chen, B. Liu, M. Li, and Y. Pan, “Identifying protein complexes from interactome based on essential proteins and local fitness method,” IEEE Transactions on Nanobioscience, vol. 11, no. 4, pp. 324–335, 2012. View at: Publisher Site  Google Scholar
 M. Li, J. Wang, J. Chen, Z. Cai, and G. Chen, “Identifying the overlapping complexes in protein interaction networks,” International Journal of Data Mining and Bioinformatics, vol. 4, no. 1, pp. 91–108, 2010. View at: Publisher Site  Google Scholar
 A. D. King, N. Pržulj, and I. Jurisica, “Protein complex prediction via costbased clustering,” Bioinformatics, vol. 20, no. 17, pp. 3013–3020, 2004. View at: Publisher Site  Google Scholar
 J. Vlasblom and S. J. Wodak, “Markov clustering versus affinity propagation for the partitioning of protein interaction graphs,” BMC Bioinformatics, vol. 10, article 99, 2009. View at: Publisher Site  Google Scholar
 The Gene Ontology, “Current Annotations,” http://geneontology.org/GO.current.annotations.shtml. View at: Google Scholar
 Saccharomyces Genome Database, http://www.yeastgenome.org/.
 MIPS Comprehensive Yeast Genome Database, “Complexes of Proteins,” ftp://ftpmips.gsf.de/fungi/yeast/catalogues/complexcat/. View at: Google Scholar
 A.C. Gavin, P. Aloy, P. Grandi et al., “Proteome survey reveals modularity of the yeast cell machinery,” Nature, vol. 440, no. 7084, pp. 631–636, 2006. View at: Publisher Site  Google Scholar
 N. J. Krogan, G. Cagney, H. Yu et al., “Global landscape of protein complexes in the yeast Saccharomyces cerevisiae,” Nature, vol. 440, no. 7084, pp. 637–643, 2006. View at: Publisher Site  Google Scholar
 H. Shen, X. Cheng, K. Cai, and M.B. Hu, “Detect overlapping and hierarchical community structure in networks,” Physica A, vol. 388, no. 8, pp. 1706–1712, 2009. View at: Publisher Site  Google Scholar
 A. Lancichinetti, S. Fortunato, and J. Kertész, “Detecting the overlapping and hierarchical community structure in complex networks,” New Journal of Physics, vol. 11, no. 3, Article ID 033015, 2009. View at: Publisher Site  Google Scholar
 Database of Interacting Proteins, http://dip.doembi.ucla.edu/dip/Download.cgi.
 S. Pu, J. Wong, B. Turner, E. Cho, and S. J. Wodak, “Uptodate catalogues of yeast protein complexes,” Nucleic Acids Research, vol. 37, no. 3, pp. 825–831, 2009. View at: Publisher Site  Google Scholar
 X. He and J. Zhang, “Why do hubs tend to be essential in protein networks?” PLoS Genetics, vol. 2, no. 6, article e88, 2006. View at: Publisher Site  Google Scholar
 J. Wang, M. Li, H. Wang, and Y. Pan, “Identification of essential proteins based on edge clustering coefficient,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 9, no. 4, pp. 1070–1080, 2012. View at: Publisher Site  Google Scholar
 X. Tang, J. Wang, J. Zhong, and Y. Pan, “Predicting essential proteins based on weighted degree centrality,” IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 11, no. 2, pp. 407–418, 2013. View at: Publisher Site  Google Scholar
 M. Li, R. Zheng, H. Zhang, J. Wang, and Y. Pan, “Effective identification of essential proteins based on priori knowledge, network topology and gene expressions,” Methods, 2014. View at: Publisher Site  Google Scholar
 J. Zhong, J. Wang, W. Peng, Z. Zhang, and Y. Pan, “Prediction of essential proteins based on gene expression programming,” BMC Genomics, vol. 14, no. 4, pp. 1–8, 2013. View at: Google Scholar
 J. Wang, W. Peng, and F.X. Wu, “Computational approaches to predicting essential proteins: a survey,” Proteomics—Clinical Applications, vol. 7, no. 12, pp. 181–192, 2013. View at: Publisher Site  Google Scholar
 W. Peng, J. Wang, W. Wang, Q. Liu, F.X. Wu, and Y. Pan, “Iteration method for predicting essential proteins based on orthology and proteinprotein interaction networks,” BMC Systems Biology, vol. 6, no. 1, article 87, 2012. View at: Publisher Site  Google Scholar
 M. Li, H. Zhang, J.X. Wang, and Y. Pan, “A new essential protein discovery method based on the integration of proteinprotein interaction and gene expression data,” BMC Systems Biology, vol. 6, no. 1, article 15, 2012. View at: Publisher Site  Google Scholar
 M. Li, J. Wang, X. Chen, H. Wang, and Y. Pan, “A local average connectivitybased method for identifying essential proteins from the network level,” Computational Biology and Chemistry, vol. 35, no. 3, pp. 143–150, 2011. View at: Publisher Site  Google Scholar
 Z. Lubovac, J. Gamalielsson, and B. Olsson, “Combining functional and topological properties to identify core modules in protein interaction networks,” Proteins, vol. 64, no. 4, pp. 948–959, 2006. View at: Publisher Site  Google Scholar
 X. Li, C. Foo, and S. Ng, “Discovering protein complexes in dense reliable neighborhoods of protein interaction networks,” in Proceedings of the Computational Systems Bioinformatics Conference, vol. 6, pp. 157–168, 2007. View at: Google Scholar
 M. E. Turanalp and T. Can, “Discovering functional interaction patterns in proteinprotein interaction networks,” BMC Bioinformatics, vol. 9, article 276, 2008. View at: Publisher Site  Google Scholar
 M. Li, J. Wang, and J. Chen, “A graphtheoretic method for mining overlapping functional modules in protein interaction networks,” in Bioinformatics Research and Applications, vol. 4983 of Lecture Notes in Computer Science, pp. 208–219, Springer, Berlin, Germany, 2008. View at: Publisher Site  Google Scholar
Copyright
Copyright © 2014 Jun Ren et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.