A novel functional module detection algorithm for protein-protein interaction networks
- Woochang Hwang^{1}Email author,
- Young-Rae Cho^{1},
- Aidong Zhang^{1} and
- Murali Ramanathan^{2}
https://doi.org/10.1186/1748-7188-1-24
© Hwang et al; licensee BioMed Central Ltd. 2006
Received: 24 July 2006
Accepted: 05 December 2006
Published: 05 December 2006
Abstract
Background
The sparse connectivity of protein-protein interaction data sets makes identification of functional modules challenging. The purpose of this study is to critically evaluate a novel clustering technique for clustering and detecting functional modules in protein-protein interaction networks, termed STM.
Results
STM selects representative proteins for each cluster and iteratively refines clusters based on a combination of the signal transduced and graph topology. STM is found to be effective at detecting clusters with a diverse range of interaction structures that are significant on measures of biological relevance. The STM approach is compared to six competing approaches including the maximum clique, quasi-clique, minimum cut, betweeness cut and Markov Clustering (MCL) algorithms. The clusters obtained by each technique are compared for enrichment of biological function. STM generates larger clusters and the clusters identified have p-values that are approximately 125-fold better than the other methods on biological function. An important strength of STM is that the percentage of proteins that are discarded to create clusters is much lower than the other approaches.
Conclusion
STM outperforms competing approaches and is capable of effectively detecting both densely and sparsely connected, biologically relevant functional modules with fewer discards.
Background
Since the first complete genome was sequenced in 1995, more than 300 prokaryotic genomes and more than 20 eukaryotic genomes have been sequenced [1]. Discovering the functional roles of gene products after the completion of sequencing the Saccharomyces Cerevisiae genome has been in the spotlight of post-genomic era. High-throughput techniques [2–5] for protein-protein interactions (PPI) detection have attracted researchers' attention since interacting proteins are likely to serve together as a group in cellular functions [6]. In recent years, high-throughput techniques in a genomic scale such as yeast-two-hybrid, mass spectrometry, and protein chip technologies have multiplied the volume of protein interaction datasets exponentially and also have provided us a genomic level view of molecular interactions. The cumulative PPI dataset of, for example, S. Cerevisiae in DIP (Database of Interacting Proteins) [7] now lists over 4900 proteins and 18,000 interactions from over 22000 experiments; however, nearly half of the proteins remain unannotated. Effective computational systems for storage, management, visualization and analysis are necessary to cope with these fast growing complex datasets.
PPI data provide us the good opportunity to systematically analyze the structure of a large living system and also allow us to use it to understand essential principles like essentiality, genetic interactions, functions, functional modules, protein complexes and cellular pathways. Cellular functions and biochemical events are coordinately carried out by groups of proteins interacting each other in functional modules, and the modular structure of complex networks is critical to function [6, 8, 9]. Identifying such functional modules in PPI networks is very important for understanding the structure and function of these fundamental cellular networks. Therefore, developing an effective computational approach to identify functional modules should be highly challenging but indispensable. Clustering analysis helps us understand the topological structure of the PPI networks and relationships among its components better. And, the principal function of each cluster can be inferred from the functions of its member. Functions for unannotated members of a cluster can be predicted by the functions of other annotated members [10].
PPI adjacency matrices can be represented as graphs whose nodes represent proteins and edges represent interactions. The clustering of a PPI dataset can be thereby reduced to graph theoretical problems. But, the binary nature of the current PPI data sets imposes challenges in clustering using conventional approaches. In the maximal clique approach, clustering is reduced to identifying fully connected subgraphs in the graph [11]. To overcome the relatively high stringency imposed by the maximal clique method, the Quasi Clique [7], Molecular Complex Detection (MCODE) [12], Spirin and Mirny [11] algorithms identify densely connected subgraphs rather than fully connected ones by either optimizing an objective density function or using a density threshold. The Restricted Neighborhood Search Clustering Algorithm (RNSC) [13] and Highly Connected Subgraphs (HCS) algorithms [14] harness minimum cost edge cuts for cluster identification. The Markov Cluster Algorithm (MCL) algorithm finds clusters using iterative rounds of expansion and inflation that promote the strongly connected regions and weaken the sparsely connected regions, respectively [15]. The line graph generation approach [9] transforms the network of proteins connected by interactions into a network of connected interactions and then uses the MCL algorithm to cluster the interaction network. Samantha and Liang [16] employed a statistical approach to clustering of proteins based on the premise that a pair of proteins sharing a significantly larger number of common neighbors will have high functional similarity.
However, currently used approaches encounter challenges because the relationship between protein function and PPI is characterized by weak connectivity and unexpected topological phenomena, such as low intraconnectivity and longish shapes of actual topological shapes of MIPS functional categories [17]. In our experimental analysis, subgraphs of each functional categories in MIPS database [17] are extracted from the Yeast PPI network, and the density of each subgraph is measured by Equation . The density of those subgraphs is averaged about 0.0023 which is fairly lower than we expected. Most functional categories have low connectivity within them in the PPI network and the majority of members in functional categories do not have direct physical interaction with other members of the functional category they belong to. Furthermore, it is not difficult to find singletons in the extracted subgraphs of functional categories which means that some proteins do not have any interaction with other proteins in the functional category they belong to. Let the diameter of a graph be the length of the longest path among all pair shortest paths in the graph. The average diameter of the subgraphs of all MIPS functional categories is approximately 4 which is close to the average shortest paths length, 5.47, of the whole PPI network. In other words, the subgraphs of actual MIPS functional categories in the PPI network generally are not closely congregated as we expected, they have longish shapes. Due to such low density within the modules, the existing approaches have produced a number of clusters with small size and singletons and mercilessly discarded many weakly connected nodes since they can only handle the strongly connected regions. Such incompleteness of clustering is a serious drawback of the existing algorithms. Discarding the sparsely connected nodes could be a hazardous loss of important information of the PPI network.
Biological networks, including PPI networks, illustrate the biochemical relationships of components in biochemical processes. Clustering of biological networks should be able to identify clusters of any arbitrary shapes and any density if the members of a cluster share important biochemical properties from the point of view of biochemical processes. To cope with this necessity and overcome those drawbacks of existing approaches, we propose a novel strategy to statistically analyze the degree of biological and topological influence of each protein to other proteins in a PPI network. We model PPI networks as a dynamic signal transduction system (STM) and demonstrate the signal transduction behavior of the perturbation by each protein on PPI networks statistically. This behavior should also reflect the topological properties of the network. The overall signal transduction behavior function between any two proteins will be formulated to evaluate the perturbation caused by a protein on other proteins biologically and topologically in the network. STM successfully identified the clusters with bigger size, arbitrary shape, low density, and biologically more enriched than other existing approaches did.
1 Method
1.1 The signal transduction model
The proteins and the protein-protein interactions in a PPI data set were, respectively, represented by nodes and edges of a graph. The graph representation was modeled using a pharmacodynamic signal transduction network model. Specifically, the signal transduction behavior of the network was modeled using the Erlang distribution, a special case of the Gamma distribution.
Graph definitions
An undirected graph G = (V, E) consists of a set V of nodes and a set E of edges, E ⊆ V × V. An edge e = (i, j) connects two nodes i and j, e ∈ E. The neighbors N(i) of node i are defined to be the set of directly connected nodes of node i. The degree d(i) of a node i is the number of the edges connected to node i. A path is defined as a sequence of nodes (i_{1},..., i_{ k }) such that from each of its nodes there is an edge to the successor node. The length of a path is the number of nodes in its node sequence. A shortest path between two nodes, i and j, is a minimal length path between them. The distance between two nodes, i and j, is the length of its shortest path.
Signal transduction model
We propose to model the dynamic relationships between proteins in a PPI network using a signal transduction network model. Specifically, the signal transduction behavior of the network is modeled using the Erlang distribution, a special case of the Gamma distribution. The Erlang distribution function is:
$F(c)=1-{e}^{-\frac{x}{b}}{\displaystyle \sum _{k=0}^{c-1}\frac{{\left(\frac{x}{b}\right)}^{k}}{k!}}\left(1\right)$
where c > 0 is the shape parameter, b > 0 is the scale parameter, x ≥ 0 is the independent variable, usually time. The Erlang distribution has several characteristics, which are appropriate for describing the protein-protein interaction network, including its positive range and its important reproductive property [18]. The Erlang distribution with x/b = 1 is used and the value of c is set to the number of edges between source protein node and the target protein node. Setting the value of x/b to unity assesses the perturbation at the target protein when the perturbation reaches 1/e of its initial value at the nearest neighbor of the source protein node.
Erlang distribution models have been used in pharmacodynamics to model signal transduction and transfer delays in a variety of systems including the production of drug induced mRNA and protein dynamics [19] and calcium ion-mediated signaling in neutrophils [20]. The use of the Erlang distribution was motivated by several key physicochemical considerations. In formulating this framework, we noted that sequential cascades of protein-protein interactions are frequently observed in biological signal transduction processes.
The Erlang distribution needs to be further modified to reflect network topology. The perturbation induced by the source protein node should be proportional to its degree and to follow the shortest path to the target protein node. During transduction to the target protein node, the perturbation should dissipate at each intermediate visiting node to each incident edge. The signal transduced from node v to node w (v ≠ w) is thus:
$S(v\to w)=\frac{d(v)}{{\displaystyle {\prod}_{i\in P(v,w)}d(i)}}F(c)\left(2\right)$
where d(i) is the degree of node i, P(v, w) is the set of the all nodes visited en route on the shortest path from node v to node w, excluding the source node v and the target destination node w, and F (c) is the signal transduction behavior function. When v = w and distance (v, w) = 0, we define S (v → w) = d (v). The numerator of the first term in the right hand side of Equation represents the degree of the source node v, and the denominator represents the dissipation on each visiting node on the shortest path from source node v to target node w. Our choice of the shortest path is motivated by the finding that the majority of flux prefers the path of least resistance in many physicochemical and biological systems. There can be more than one shortest path between a node pair in a network. STM chooses the least resistant path, which has the lowest resistance calculated by ∏_{i ∈ P (v, w)}d (i) in Equation , out of several tying shortest paths if there are more than one shortest path between a node pair. There also can be more than one least resistant path among several tying shortest paths. Choosing any one path out of several tying least resistant paths makes no difference in measuring the signal transduction quantity as long as it is a least resistant path since the signal quantity computed by Equation depends only on the resistance not on any other topological properties of intermediate visiting nodes on a path. So, the first term in the right hand side of Equation represents the topological effect of source node v on target node w. The second term in the right hand side of Equation represents the biological effect of source node v on target node w in the signal transduction view point. Therefore, the nodes that score the highest value on target node w will be the most influential nodes on node w biologically and topologically.
1.2 Clustering model
STM algorithm simulates the perturbation from each node to the other nodes in a network using Equation , which reflects the biological and topological properties of the node. Module representatives are the nodes that record the highest scores by Equation on every node in a module, i.e., they are the most influential nodes in a module biologically and topologically. After the signal transduction simulation, each node selects the most influential nodes as the representatives of modules. From these representatives, preliminary modules can be formed by aggregating each node into each module that each of its representatives stands for. Finally, these preliminary modules are merged if there are substantial interconnections between them.
STM algorithm
Algorithm 1: STM(G) |
---|
1: V: set of nodes in Graph G |
2: F(c): Transduction behavior function |
3: S(v, w): arrived signal from node v to node w |
4: C: the list of final clusters |
5: PreClusters: the list of preliminary clusters |
6: for each node pair(v, w) v, w ∈ V, v ≠ w do |
7: distance(v, w) ← the shortest path length from node v to node w |
8: set parameter c in function as F(c) as distance(v, w) |
9: signal(v, w) ← $S(v\to w)=\frac{d(v)}{{\displaystyle {\prod}_{i\in P(v,w)}d(i)}}F(c)$ |
10: end for |
11: for each node v ∈ V do |
12: v. representative ← select the best scored node w for node v |
13: if cluster_w == null then |
14: make cluster_w |
15: cluster_w.add(v) |
16: PreClusters.add(cluster_w) |
17: else |
18: cluster_w.add(v) |
19: end if |
20: end for |
21: C ← Merge(PreClusters) |
Process 1: Compute signals transduced between all node pairs.
Process 2: Select cluster representatives for each node.
Process 3: Formation of preliminary clusters.
Process 4: Merge preliminary clusters.
Process 1 propagates signals from each source node and records the signal quantities on each target node for all node pairs according to Equation. The implementation of Process 1 is shown on lines 6–10 of the STM algorithm in Table 1.
In Process 2, each node elects the nodes from which it receives the highest signal value as the representatives of the clusters that the node will belong to. For example, in Figure 2, nodes A, B, C, D, E, and F will choose node A and nodes L, G, and N will choose node F, which are the best scored nodes on those nodes, as the representatives.
Each preliminary cluster is initialized by taking its representative as its initial member. Preliminary clusters are then augmented by accumulating each node toward the representatives chosen by each node. Lines from 11–20 in Table 1 contain the representative selection process and the preliminary cluster formation process. Notice that STM allows overlaps among clusters by opening the possibility of multiple representatives which have the tie score on a node, etc. For example, node G picks nodes F and H, which have the tie score on node G, as its representatives in Figure 2. Then, G will belong to the cluster formed by nodes F and the cluster formed by H. Therefore, overlaps occur between the cluster formed by node F, {F, G, L, N}, and the cluster formed by node H, {G, H, I, J, K, M}. STM identified three preliminary clusters, {A, B, C, D, E, F}, {F, G, L, N}, and {G, H, I, J, K, M}, based on the choice of representatives in Figure 2.
Procedure: Merge(C)
1: C: the cluster list |
2: MaxPair: the cluster pair(c, k) with max interconnections among all cluster pair |
3: Max.value: interconnections between cluster pair c and k |
4: MaxPair ← findMaxPair(C,null) |
5: while Max.value ≥ do |
6: newCluster ← merge MaxPair c and k |
7: Replace cluster c with newCluster |
8: Remove cluster k |
9: MaxPair ← findMaxPair(C,newCluster) |
10: end while |
11: return C |
$Similarity(i,j)=\frac{interconnectivity(i,j)}{minsize(i,j)}\left(3\right)$
where interconnectivity (i, j) is the number of connections between clusters i and j, and minsize(i, j) is the size of the smaller cluster among clusters i and j. The Similarity(i, j) between two clusters i and j is the ratio of the number of the connections between them to the size of the smaller cluster. Highly interconnected clusters are iteratively merged based on the similarity of the clusters. The pair of clusters that have the highest similarity are merged in each iteration and the merge process iterates until the highest similarity of all cluster pairs is less than a given threshold. The selection of the threshold for merging clusters is a critical factor for the final cluster outcome. We can see that every member of the smaller cluster has at least one interaction with the members of the other cluster if inter connectivity (i, j) ≥ minsize(i, j) between cluster pair i and j. Therefore, we conclude that two clusters should be in the same functional module if every member of the smaller cluster has at least one interaction with the members of the other cluster. Theoretically and experimentally, we can see when interconnectivity (i, j) ≥ minsize(i, j), clusters i and j have substantial interconnections. Three clusters, {A, B, C, D, E, F}, {F, G, L, N}, {G, H, I, J, K, M}, are obtained after the Process 4 when 2.0 is used as the merge threshold. Two clusters, {A, B, C, D, E, F, G, L, N}, {G, H, I, J, K, M}, are obtained after the Merge process when 1.0 is used as the merge threshold.
1.3 Cluster assessment
The structures of the clusters identified by STM and other competing alternative approaches are assessed using several metrics.
The clustering coefficient, C(v), of a node v measures the connectivity among its direct neighbors:
$C(v)=\frac{2\left|{\displaystyle {\cup}_{i,j\in N(v)}(i,j)}\right|}{d(v)(d(v)-1)}\left(4\right)$
In Equation , N (v) is the set of the direct neighbors of node v and d (v) is the number of the direct neighbors of node v. Highly connected nodes have high values of clustering coefficient.
Degree centrality orders nodes by the number of their direct neighbors, and betweenness centrality measures the nodes' importance from the information flow point of view in a network. Degree and betweenness centrality commonly used to measure the importance of a node in a network. The Betweeness Centrality, C_{ B }(v), is a measure of the global importance of a node that assesses the proportion of shortest paths between all node pairs that pass through the node of interest. The Betweeness Centrality, C_{ B }(v) for a node of interest, v, is defined by:
${C}_{B}(v)={\displaystyle \sum _{s\ne v\ne t\in V}\frac{{\rho}_{st}(v)}{{\rho}_{st}}}\left(5\right)$
In the Equation, ρ_{ st }is the number of shortest paths from node s to t and ρ_{ st }(v) the number of shortest paths from s to t that pass through the node v.
The extent to which the clusters are associated with a specific biological function is evaluated using a p-value based on the hypergeometric distribution [7]. The p-value is the probability that a cluster would be enriched with proteins with a particular function by chance alone. The p-value is given by:
$p=1-{\displaystyle \sum _{i=0}^{k-1}\frac{\left(\begin{array}{c}C\\ i\end{array}\right)\left(\begin{array}{c}G-C\\ n-i\end{array}\right)}{\left(\begin{array}{c}G\\ n\end{array}\right)}}\left(6\right)$
In Equation, C is the size of the cluster containing k proteins with a given function; G is the size of the universal set of proteins of known proteins and contains n proteins with the function. Because the p-values are frequently small numbers with positive values between 0 and 1, the negative logarithms (to base 10, denoted -log p) are used. A -log p value of 2 or greater indicates statistical significance at α = 0.01.
The density of a subgraph s in a PPI network is measured by:
${D}_{s}=\frac{2e}{n(n-1)}\left(7\right)$
In Equation, n is the number of proteins and e is the number of interactions in a subgraph s of a PPI network.
2 Experimental results
2.1 Protein interaction data
The core data of S. Cerevisiae was obtained from the DIP database [22]. This dataset include 2526 proteins and 5949 filtered reliable physical interactions. Species such as S. Cerevisae provide important test beds for the study of the PPI networks since it is a well-studied organism for which most proteomics data is available for the organism, by virtue of the availability of a defined and relatively stable proteome, full genome clone libraries, established molecular biology experimental techniques and an assortment of well designed genomics databases [6, 22].
2.2 Biological significance of the putative module representatives
Our signal transduction model of Equation provides a vehicle to quantitatively measure the degree of biological and topological influence of each protein on other proteins in the PPI network. The most influential proteins, that is, the highest scored nodes, are highly important proteins. To evaluate the biological significance of the most influential proteins, we annotated the lethality of each protein in the yeast PPI network according to the MIPS lethality data. Lethality is a crucial factor to characterize the biological essentiality of a protein. It is determined by examining whether a module is functionally disrupted when the protein is knocked out. We obtained the protein lethality information from MIPS database [17], which reports whether a protein is lethal or viable. We found that 233 proteins out of the top scored 555 proteins are lethal.
2.3 Clustering performance analysis
Experimentally, we performed STM algorithm on the yeast PPI data set using various merge threshold values to find the best threshold value for each data set. Experiments using 0.5,1.0,1.5, 2.0, 2.5, and 3.0 as the merge threshold were performed on each data set. The results show that when the merge threshold is less than 1.0, clusters that do not have substantial similarity are merged; and when the merge threshold is greater that 1.5, merging seldom occurred. There is no much performance difference when the values between 1.0 and 1.5 are used. The experiment when 1.0 is used as the merge threshold showed the best performance.
2.3.1 Cluster analysis
STM clustering result on the yeast PPI dataset
Distribution | |||||||
---|---|---|---|---|---|---|---|
Cluster | Size | Density | H | D | U | -Logp | Function |
1 | 214 | 0.019 | 24.7 | 69.6 | 5.6 | 43.9 | Nuclear transport |
2 | 188 | 0.015 | 69.1 | 25.0 | 5.8 | 36.4 | Cell cycle and DNA processing |
3 | 181 | 0.022 | 22.0 | 72.3 | 5.5 | 17.2 | Cytoplasmic and nuclear protein degradation |
4 | 170 | 0.028 | 46.4 | 42.9 | 10.5 | 31.6 | Transported compounds (substrates) |
5 | 131 | 0.028 | 37.4 | 55.7 | 6.8 | 28.6 | Vesicular transport (Golgi network, etc.) |
6 | 125 | 0.030 | 60.8 | 33.6 | 5.6 | 32.2 | tRNA synthesis |
7 | 113 | 0.027 | 19.4 | 71.6 | 8.8 | 11.8 | Actin cytoskeleton |
8 | 79 | 0.045 | 17.7 | 73.4 | 8.8 | 12.3 | Homeostasis of protons |
9 | 78 | 0.033 | 26.9 | 62.8 | 10.2 | 12.5 | Ribosome biogenesis |
10 | 76 | 0.041 | 38.1 | 59.2 | 2.6 | 20.2 | rRNA processing |
11 | 72 | 0.030 | 5.6 | 84.7 | 9.7 | 6.2 | Calcium binding |
12 | 68 | 0.064 | 66.1 | 25.0 | 8.8 | 44.5 | mRNA processing |
13 | 61 | 0.041 | 40.9 | 52.4 | 6.5 | 11.5 | Cytoskeleton |
14 | 58 | 0.064 | 72.4 | 27.6 | 0.0 | 37.4 | General transcription activities |
15 | 53 | 0.048 | 15.0 | 71.6 | 13.2 | 7.9 | MAPKKK cascade |
16 | 50 | 0.064 | 66.0 | 32.0 | 2.0 | 33.5 | rRNA processing |
17 | 45 | 0.055 | 24.4 | 73.3 | 2.2 | 11.1 | Metabolism of energy reserves |
18 | 44 | 0.058 | 59.0 | 36.3 | 4.5 | 5.1 | Metabolism |
19 | 39 | 0.072 | 10.2 | 89.7 | 0.0 | 7.3 | Cell-cell adhesion |
20 | 36 | 0.125 | 58.3 | 36.1 | 5.5 | 16.9 | Vesicular transport |
21 | 29 | 0.091 | 55.1 | 44.8 | 0.0 | 8.3 | Phosphate metabolism |
22 | 28 | 0.074 | 14.2 | 78.5 | 7.1 | 4.5 | Lysosomal and vacuolar protein degradation |
23 | 27 | 0.119 | 29.6 | 66.6 | 3.7 | 7.3 | Cytokinesis (cell division)/septum formation |
24 | 26 | 0.153 | 53.8 | 46.1 | 0.0 | 28.6 | Peroxisomal transport |
25 | 25 | 0.090 | 28.0 | 68.0 | 4.0 | 4.6 | Regulation of C-compound and carbohydrate utilization |
26 | 25 | 0.116 | 68.0 | 28 | 4.0 | 12.9 | Cell fate |
27 | 22 | 0.151 | 59.0 | 36.3 | 4.5 | 11.4 | DNA conformation modification |
28 | 21 | 0.147 | 76.1 | 19.0 | 4.7 | 23.9 | Mitochondrial transport |
29 | 20 | 0.200 | 75.0 | 20.0 | 5.0 | 24.0 | rRNA synthesis |
30 | 19 | 0.228 | 78.9 | 15.7 | 5.2 | 17.9 | Splicing |
31 | 17 | 0.220 | 70.5 | 29.4 | 0.0 | 19.7 | Microtubule cytoskeleton |
32 | 17 | 0.183 | 23.5 | 76.4 | 0.0 | 8.2 | Regulation of nitrogen utilization |
33 | 15 | 0.304 | 86.6 | 13.3 | 0.0 | 31.3 | Energy generation |
34 | 14 | 0.142 | 50.0 | 42.8 | 7.1 | 9.0 | Small GTPase mediated signal transduction |
35 | 13 | 0.564 | 76.9 | 23.0 | 0.0 | 15.9 | Mitosis |
36 | 13 | 0.358 | 84.6 | 15.4 | 0.0 | 12.4 | DNA conformation modification |
37 | 13 | 0.410 | 69.2 | 23.0 | 7.6 | 17.6 | 3'-end processing |
38 | 13 | 0.179 | 61.5 | 30.7 | 7.6 | 6.7 | DNA recombination and DNA repair |
39 | 12 | 0.196 | 16.6 | 75.0 | 8.3 | 3.9 | Unspecified signal transduction |
40 | 12 | 0.363 | 58.3 | 41.6 | 0.0 | 14.7 | Posttranslational modification of amino acids |
41 | 12 | 0.166 | 16.6 | 75.0 | 8.3 | 2.4 | Autoproteolytic processing |
42 | 11 | 0.218 | 54.5 | 45.4 | 0.0 | 2.9 | Transcriptional control |
43 | 11 | 0.200 | 72.7 | 27.2 | 0.0 | 8.2 | Enzymatic activity regulation/enzyme regulator |
44 | 10 | 0.466 | 80.0 | 20.0 | 0.0 | 14.8 | Translation initiation |
45 | 9 | 0.361 | 77.7 | 22.2 | 0.0 | 12.8 | Translation initiation |
46 | 8 | 0.321 | 50.0 | 37.5 | 12.5 | 5.6 | Metabolism of energy reserves |
47 | 8 | 0.321 | 75.0 | 25.0 | 0.0 | 9.0 | Modification by ubiquitination, deubiquitination |
48 | 8 | 0.321 | 37.5 | 62.5 | 0.0 | 3.7 | Mitosis |
49 | 7 | 0.333 | 42.8 | 57.1 | 0.0 | 3.5 | DNA damage response |
50 | 7 | 0.333 | 57.1 | 28.5 | 14.2 | 4.1 | Vacuolar transport |
51 | 7 | 0.285 | 28.5 | 71.4 | 0.0 | 4.4 | Biosynthesis of serine |
52 | 6 | 0.333 | 50.0 | 33.3 | 16.6 | 2.38 | Modification by phosphorylation, dephosphorylation, etc. |
53 | 5 | 0.400 | 100 | 0.0 | 0.0 | 7.0 | Meiosis |
54 | 5 | 0.600 | 100 | 0.0 | 0.0 | 7.0 | Vacuolar transport |
55 | 5 | 0.400 | 100 | 0.0 | 0.0 | 8.5 | ER to Golgi transport |
56 | 5 | 0.400 | 20.0 | 40.0 | 40.0 | 1.8 | cAMP mediated signal transduction |
57 | 5 | 0.500 | 40.0 | 40.0 | 20.0 | 3.1 | Oxidative stress response |
58 | 5 | 0.500 | 80.0 | 20.0 | 0.0 | 4.4 | Intracellular signalling |
59 | 5 | 0.600 | 40.0 | 60.0 | 0.0 | 4.2 | Tetracyclic and pentacyclic triterpenes |
60 | 5 | 0.400 | 60.0 | 40.0 | 0.0 | 4.1 | Mitochondrial transport |
2.3.2 Comparative analysis
Comparison of STM to competing clustering methods for clusters with 5 or more members
Method | Number | Size | Discard(%) | Function | Location |
---|---|---|---|---|---|
STM | 60 | 40.1 | 7.8 | 13.7 | 7.42 |
Maximal clique | 120 | 5.65 | 98.4 | 10.6 | 7.93 |
Quasi clique | 103 | 11.2 | 80.8 | 11.5 | 6.58 |
Samantha | 64 | 7.9 | 79.9 | 9.16 | 4.89 |
Minimum cut | 114 | 13.5 | 35.0 | 8.36 | 4.75 |
Bwtweenness cut | 180 | 10.26 | 21.0 | 8.19 | 4.18 |
MCL | 163 | 9.79 | 36.7 | 8.18 | 3.97 |
Comparison of STM to competing clustering methods for clusters with 9 or more members
Method | Number | Size | Discard(%) | Function | Location |
---|---|---|---|---|---|
STM | 45 | 52.4 | 11.5 | 16.8 | 9.01 |
Maximal clique | N/A | N/A | N/A | N/A | N/A |
Quasi clique | 46 | 16.7 | 86.7 | 15.3 | 9.34 |
Samantha | 17 | 12.3 | 93.3 | 15.9 | 7.65 |
Minimum cut | 44 | 24.3 | 55.0 | 14.8 | 8.78 |
Bwtweenness cut | 78 | 14.4 | 50.5 | 11.3 | 6.05 |
MCL | 55 | 16.7 | 69.4 | 11.5 | 5.42 |
Tables 4 and 5 demonstrate that STM outperforms the other existing approaches. We made a comparison with 6 other existing approaches, Maximal cliques [11], Quasi cliques [7], Samantha [23], Minimum cut [18], Betweenness cut [24], and MCL [15]. The comparison on the cluster size more than 4 is in Table 4 and on the cluster size more than 9 in Table 5. Both tables show that our signal transduction model based method generates considerably larger clusters, and the identified clusters by our method have at least 2 orders of magnitude higher P-value than the others on both function and localization categories.
Quasi clique and Maximal clique discarded 80.8% and 98.4% nodes during clustering process, even though they identified the clusters with relatively high p-values in Table 4. Quasi clique and Samantha discarded 86.7% and 93.3% nodes, even though they identified the clusters with relatively high p-values in the clusters with size more than 9 in Table 5. Another important strength of STM is that the percentage of proteins that are discarded to create clusters is 7.8%, which is much lower than the other approaches, which have an average discard percentage of 59%. The yeast PPI dataset is relatively modular and the bottom-up approaches (e.g., maximal clique and quasi clique methods) generally outperformed the top-down approaches (exemplified by the minimum cut and betweeness cut methods) on functional enrichment as assessed by -log p. However because bottom-up approaches are based on connectivity of dense regions, the percentages of discarded nodes for the bottom-up methods are also higher than STM and the top-down approaches. But, we already have shown that the functional modules have fairly low density and arbitrary shapes with long diameter. So, discarding those sparsely connected proteins could be a fatal decision which might resulted in the important biological information losses. Consequently, STM is versatile and its performance on biological function and localization enrichment, cluster size, and discard rate is superior to the best of the other six methods on both data sets.
2.4 Computational complexity analysis
STM is fundamentally established on all pairs shortest path searching algorithm to measure the distance between all node pairs. This problem can be solved in O (V^{2}logV + V E) time if it is implemented using Johnson's algorithm [25], where V is the number of nodes and E is the number of edges in a graph. After measuring the distance between all node pairs, formation of preliminary clusters takes O (V) time. The amount of time required to find the best cluster pair that has the most interconnections is O (k^{2} logk) by using heap-based priority queue, where k is the number of preliminary clusters [26]. The Merging process needs to find the cluster pair which has the most interconnections, and it takes O (k^{2} logk) time only for the initial iteration. From the second iteration, finding the best cluster pair takes O (klogk) time since the cluster pair comparisons are needed only between the newly merged cluster and the other clusters. And the maximum k, the number of preliminary clusters, is at most O (V) in the case of the fully connected graph, therefore the Merging process takes O (V^{2} log V) time. But k is much smaller than V in sparse networks like the Yeast PPI network. So the total time complexity of our algorithm is bounded by the time consumed in computing the distance between all node pairs, which is O (V^{2} log V + V E).
3 Discussion
We have studied that the topological shapes of the subgraphs of MIPS functional categories extracted from the PPI network are arbitrary and the density of them is fairly low. These two unexpected properties of functional categories prohibited other existing approaches from detecting functional modules from PPI networks effectively. A relative excess of emphasis on density and interconnectivity in the existing methods can be preferential for detecting clusters with relatively balanced round shapes and limit performance. The incompleteness of clustering is another distinct drawback of existing algorithms, which produce many clusters with small size and singletons. The preference for strongly connected nodes results in many weakly connected nodes being discarded. Moreover, considering only the topological properties and ignoring the biological characteristics of the network also can damage the effectiveness of clustering.
In this paper we have proposed a novel clustering method based on the signal transduction model for the Yeast PPI network. In head-to-head comparisons, the STM outperformed competing approaches and is capable of effectively detecting both dense and sparsely connected, biologically relevant functional modules with fewer discards. To our knowledge, this is the first description of the use of signal transduction based approach for this application.
Overwhelming performance of our approach has been demonstrated in several criteria including visual inspection. STM generated bigger size clusters with arbitrary shape, and those identified clusters are more biologically enriched, i.e., higher P-value, even though they have low density. There are more than 5% of unannotated proteins in the identified clusters. The function of those unannotated proteins can be predicted according to their assigned main functions by our method. Completeness of our clustering method is another distinct strength compared to the other methods. Our method discarded only about 7.8% of proteins which is tremendously lower than the other approaches did, 59% in average. In conclusion, STM has strong pharmacodynamics-based underpinnings and is an effective, versatile approach for analyzing protein-protein interactions. The STM approach contains a framework for rationally incorporating reaction rates, protein concentrations and interaction stoichiometry should these become available. It could therefore have potential applications in the drug discovery and development.
Declarations
Authors’ Affiliations
References
- Letovsky S, Kasif S: Predicting protein function from protein/protein interaction data: a probabilistic approach. Bioinformatics. 2003, 19: i197-i204.PubMedView ArticleGoogle Scholar
- Gavin AC: Functional organization of the yeast proteome by systematic analysis of protein complexes. Nature. 2002, 415: 141-147.PubMedView ArticleGoogle Scholar
- Ho Y: Systematic identification of protein complexes in Saccharomyces cerevisiae by mass spectrometry. Nature. 2002, 415: 180-183.PubMedView ArticleGoogle Scholar
- Ito T: A comprehensive two-hybrid analysis to explore the yeast protein interactome. PNAS. 2001, 98: 4569-4574.PubMedPubMed CentralView ArticleGoogle Scholar
- Uetz P: A comprehensive analysis of protein-protein interactions in Saccharomyces cerevisiae. Nature. 2000, 403: 623-627.PubMedView ArticleGoogle Scholar
- Hishigaki H, Nakai K, Ono T, Tanigami A, Takagi T: Assessment of prediction accuracy of protein function from protein-protein interaction data. Yeast. 2001, 18: 523-531.PubMedView ArticleGoogle Scholar
- Bu D: Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Res. 2003, 31: 2443-2450.PubMedPubMed CentralView ArticleGoogle Scholar
- Guimera R, Nunes Amaral L: Functional cartography of complex metabolic networks. Nature. 2005, 433: 895-900.PubMedPubMed CentralView ArticleGoogle Scholar
- Pereira-Leal JB, Enright AJ, Ouzounis CA: Detection of functional modules from protein interaction networks. Proteins. 2004, 54: 49-57.PubMedView ArticleGoogle Scholar
- Lin C: Knowledge Discovery in Bioinformatics: Techniques, Methods, and Applications. 2006, John Wiley & Sons Inc. chap. Clustering methods in protein-protein interaction networkGoogle Scholar
- Spirin V, Mirny LA: Protein complexes and functional modules in molecular networks. PNAS. 2003, 100: 12123-12128.PubMedPubMed CentralView ArticleGoogle Scholar
- Bader GD, Hogue CW: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics. 2003, 4: 2-PubMedPubMed CentralView ArticleGoogle Scholar
- King AD, Przulj N, Jurisica I: Protein complex prediction via cost-based clustering. Bioinformatics. 2004, 20: 3013-3020.PubMedView ArticleGoogle Scholar
- Hartuv E, Shamir R: A Clustering Algorithm based Graph Connectivity. Information Processing Letters. 2000, 76: 175-181. 10.1016/S0020-0190(00)00142-3.View ArticleGoogle Scholar
- van Dongen S: Technical Report INS-R0010: A cluster algorithm for graphs. National Research Institute for Mathematics and Computer Science. 2000Google Scholar
- Samanta MP, Liang S: Predicting protein functions from redundancies in large-scale protein interaction networks. PNAS. 2003, 100: 12579-12583.PubMedPubMed CentralView ArticleGoogle Scholar
- Mewes HW: MIPS: analysis and annotation of proteins from whole genome in 2005. Nucleic Acid Research. 2006, 34: D169-D172. 10.1093/nar/gkj148.View ArticleGoogle Scholar
- Johnson NL, Kotz S, Balakrishnan N: Continuous univariate distributions. 1994, John Wiley & sons, New York, NYGoogle Scholar
- Ramanathan M: A dispersion model for cellular signal transduction cascades. Pharm Res. 2002, 19: 1544-1548.PubMedView ArticleGoogle Scholar
- Hallett MB, Pettit EJ: Stochastic events underlie Ca2+ signalling in neutrophils. J Theor Biol. 1997, 186: 1-6.PubMedView ArticleGoogle Scholar
- Dennis B, Patil GP: The gamma distribution and weighted multimodal gamma distributions as models of population abundance. Math Biosciences. 1984, 68: 187-212. 10.1016/0025-5564(84)90031-2.View ArticleGoogle Scholar
- Deane CM, Salwinski L, Xenarios I, Eisenberg D: Protein interactions: two methods for assessment of the reliability of high throughput observations. Mol Cell Proteomics. 2002, 1: 349-356.PubMedView ArticleGoogle Scholar
- Samanta MP, Liang S: Redundancies in large-scale protein interaction networks. Proc Natl Acad Sci. 2003, 100: 12579-12583.PubMedPubMed CentralView ArticleGoogle Scholar
- Girvan M, Newman MEJ: Community structure in social and biological networks. PNAS. 2002, 99: 7821-7826.PubMedPubMed CentralView ArticleGoogle Scholar
- Johnson DB: Efficient algorithms for shortest paths in sparse networks. J of the ACM. 1977, 24: 1-13. 10.1145/321992.321993.View ArticleGoogle Scholar
- Karypis G, Han E-H, Kumar V: Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer: Special issue on data analysis and mining. 1999, 32: 68-75.View ArticleGoogle Scholar
Copyright
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.