 Research article
 Open Access
 Published:
Deducing topology of proteinprotein interaction networks from experimentally measured subnetworks
BMC Bioinformatics volume 9, Article number: 301 (2008)
Abstract
Background
Proteinprotein interaction networks are commonly sampled using yeast two hybrid approaches. However, whether topological information reaped from these experimentallymeasured subnetworks can be extrapolated to complete proteinprotein interaction networks is unclear.
Results
By analyzing various experimental proteinprotein interaction datasets, we found that they are not random samples of the parent networks. Based on the experimental baitprey behaviors, our computer simulations show that these nonrandom sampling features may affect the topological information. We tested the hypothesis that a core subnetwork exists within the experimentally sampled network that better maintains the topological characteristics of the parent proteinprotein interaction network. We developed a method to filter the experimentally sampled network to result in a core subnetwork that more accurately reflects the topology of the parent network. These findings have fundamental implications for largescale protein interaction studies and for our understanding of the behavior of cellular networks.
Conclusion
The topological information from experimental measured networks network as is may not be the correct source for topological information about the parent proteinprotein interaction network. We define a core subnetwork that more accurately reflects the topology of the parent network.
Background
Biological systems are characterized by extremely complex interacting networks of nucleotides, proteins, metabolites and other molecules. It has become increasingly clear that to understand the function of a cell, one must understand the function of these networks. Because the topological characteristics of a network are believed to determine basic properties of its function [1–4], a primary goal in analyzing biological networksis to determine how the interacting elements (nodes) are connected toeach other (edges or links). The commonly used largescaleexperimental approaches (yeast two hybrid and affinity pulldown combined with mass spectrometry) for mapping proteinprotein interaction networks are extremely useful to sample portions of the entire network, however, they have well recognized limitations: (i) some interactions are missed (false negatives); (ii) spurious interactions are detected (false positives); (iii) interactions are assumed to be direct (binary analyses lose hierarchical information); and (iv) some proteins function better than others in a protein interaction assay [5, 6]. "Sticky" proteins may be less likely to have false negatives, but it remains an empirical argument as to whether these proteins are also more likely to have false positives. Other factors contributing to these limitations include effects of affinity tag interactions, effects of antibody binding, influence of subcellular localization and protein activity, and posttranslational modifications.
A general theoretical question is whether there is a way to sample a network so that the topological information of a subnetwork can reflect well that of the original network. This issue was addressed by recent theoretical studies of Stumpf and colleagues [7, 8] who showed that a randomlysampled subnetwork from an ErdösRényi random network is still an ErdösRényi random network; the same is true for an exponential network. When the original network is scalefree, however, the randomly sampled subnetwork is not truly scalefree, but the degree distribution is still very close to a powerlaw. These findings suggest that a randomlysampled subnetwork may still largely maintain the topological information of the original scalefree network. Besides the maintenance of degree distribution, we also numerically analyzed the network motifs and found that the motif structures were also maintained after random sampling (Additional file 1 Fig.S1). Therefore, a practical question that arises is whether the subnetworks measured by the largescale experimental approaches can be used to deduce topological information of the original networks. The answer to this question remains largely unclear. In a recent computational analysis [9], it was found that the powerlaw degree distributions of sampled networks reported in previous studies [3, 4, 10–13] may be a consequence of the manner in which the data are acquired and the low coverage of the complete (i.e., the "actual") proteinprotein interaction networks. Besides the degree distribution and network motifs, other topological properties of the randomly sampled network, such as degree exponent, average path length and clustering coefficient, can be quite different from the original network when the size of sampled network is smaller than that of the original one [14, 15]. Nevertheless, based on these previous studies [7–9] and our simulations (Additional file 1 Fig.S1), a sample that reflects the degree distribution and percentage of network motifs of the original network should: be randomly acquired and contain a high degree of coverage of the parent network. By analyzing several experimentally measured proteinprotein interaction networks in the present study, we demonstrate that these experimental samples do not constitute random samples, likely due to the aforementioned experimental considerations. This observation highlights that the experimentallymeasured subnetworks may not be the correct source for topological information about the parent proteinprotein interaction network, raising the distinct possibility that previous analyses of biological networks [3, 4, 10–13, 16–22] make inappropriate conclusions about topology. Although we conclude in this study that the current experiment datasets cannot be used directly for deducing topological information of the original network, we hypothesized that there is a core subnetwork (CSN) within the experimentally sampled network that can better retain the topological information of the original proteinprotein interaction network.
Results
Properties of experimentallymeasured proteinprotein interaction networks
Despite the insights obtained by Stumpf and colleagues [7, 8] regarding degree distribution and our numerical analyses of network motifs in randomly sampled networks (Additional file 1 Fig.S1), one is still faced with the problem that experimental sampling may not be random due to one or more of the following reasons: (i) some proteins are used as either bait or as prey, but not both; (ii) experimental results often contain data from different laboratories, species, techniques, etc.; and (iii) even if all proteins under analysis are used as both baits and preys (e.g., large scale yeast twohybrid approaches), the relative ability of a protein to "behave as a bait" may not be equivalent to (and sometimes is completely different from) its ability to "behave as a prey" due to a variety of reasons. For example, the yeast proteinprotein interaction network by Ito et al [23], all 6,000 proteins were used both as baits and preys, but in the resultant network, many proteins exhibited a preferential capacity to act as either a bait or a prey, while some do both. Figure 1a shows five example proteins from this dataset: JSN1 linked to 285 preys when it was used as a bait, but linked to no baits when it was used as a prey; in contrast, GTT1 linked to 21 baits when it was used as a prey but no preys as a bait; on the other hand, proteins SRB4, STD1, and APG17 act similarly as bait and prey. On the basis of this observation, one could envision three basic types of protein functions in the experimental setting (Fig. 1b): pure bait (blue dot in Fig. 1b), pure prey (green dot in Fig. 1b), and both bait and prey (red dot in Fig. 1b, abbreviated as BP in this paper). These protein types can combine to form a network such as that shown in Fig. 1c. The same features exist in all other proteinprotein interaction networks we analyzed, i.e., some proteins can link to a number of other proteins when used as either bait or prey, but most proteins "link better" as either a prey or bait. Figure 1d shows the percentage of the three types of proteins in several experimental datasets.
Here we first defined the subnetwork composed of the proteins which have both bait and prey functions, and the links among these proteins (red dot and links in Fig. 1c), as a "core subnetwork" (CSN). Although the proteins can act as both bait and prey, some of them are still very biased towards one behavior or the other, resulting in very asymmetrical bait and prey behaviors of the proteins. The pure baits and pure preys are the extreme cases of this asymmetrical bait and prey behavior. We first exclude these extreme proteins and develop later a quantitative method to further refine the CSN.
Ideally, if the interactions (in this study, we count A–B as one link, but A → B with A as bait and B as prey and B → A with B as bait and A as prey, as two interactions) between the proteins were completely sampled, there would no pure baits or pure preys. One can attribute the occurrence of the asymmetrical properties to the limitations of experimental systems or to the proteins being artificially sorted by the way the experiments were carried out. However, the asymmetrical bait and prey properties can also occur with random sampling if the sampling of the interactions is incomplete. To exclude that the measured network is indeed a randomly sampled subnetwork of the original network, we did further analyses of the experimental datasets. Firstly, if the experimental sampling were indeed random, then the number of observed "pure bait" and "pure prey" proteins following an incomplete sampling should be approximately equal; in fact, however, these numbers are quite different in the experimental datasets (Fig. 1d). Secondly, if the sampling is done randomly with incomplete sampling of interactions, the chance of experimentally detecting a protein that links to many other proteins as a bait, but to none as a prey, should be very low. This is supported by the results shown in Fig. 2, in which we calculated the ratios of the proteins which link to 10 or more proteins when used as baits but none as preys, to either the total proteins of the network (magenta) or the total proteins who link to more than 10 proteins as bait no matter how many proteins are linked to it when acting as prey (blue). In the real datasets (Fig. 2a), the ratios are very high, while they are much lower in true random sampling simulations (Fig. 2b). We calculated these ratios for simulated ErdösRényi random, exponential, powerlaw, and truncated powerlaw networks, and they are all in the same order of magnitude as the results for the truncated powerlaw network shown in Fig. 2b. The high chance (Fig. 2a) that a protein links to many proteins as a bait, but to none as a prey, indicates that the proteins were sorted into different categories (pure bait, pure prey, both bait and prey) by the experiment.
The results in Fig. 1d and Fig. 2 show that the bait and prey behaviors in experimental datasets differ substantially from a true random sampling; in other words, experimental sampling is not random. This supports the idea that bait/prey preference is an artifact of the experimental limitations and/or sampling methods, as previously suggested by Aloy and colleagues [24], and Maslov and Sneppen [25, 26]. Therefore, based on the available theory on random sampling [7, 8], one cannot extrapolate the topological information from the experimentally measured subnetworks to the entire network.
Effects of experimental sampling on network topology
To show how the experimental sampling affects the topological information, we first studied effects of the ratio of the three types of nodes in the sampled network on the degree distribution and motif structure. We generated three theoretical networks (15,000 nodes each) with different topologies (ErdösRényi random distribution with an average connectivity equals 40, exponential distribution p(k) ∝ e^{0.025k}, and scalefree distribution p(k) ∝ k^{1.4}) and used the Drosophila proteinprotein interaction (DPPI) network by Giot et al [20] as if it were a theoretical network without the original bait and prey information.
To mimic the experimental sampling, we randomly selected 6000 nodes from the 15,000node parent networks (for the DPPI network, 5980 proteins were randomly sampled from the original 7049 proteins) as the experimental libraries, and randomly assigned proteins (independent of degree/link number) in the libraries to be pure baits, pure preys, or BPs (proteins that can act as both bait and prey), with certain probabilities. Different ratios between these three types were thus obtained. We then applied the following rules to the interactions: (i) any interaction originating from a pure prey or terminating on a pure bait is forbidden (see Additional file 1 Fig. 2); (ii) all other interactions are detectable according to a probability q (In Fig 3, we focused on the effects of the three types of proteins but not the random sampling of the interactions, and thus we chose q = 1); and (iii) that a link between protein A and protein B exists in the measured networks when at least one of interactions A → B and B → A is detected. For comparison, we also performed a true random sampling of the original networks using the same number of nodes as the simulated experimental networks. Note that in the resultant network, one observes new ratios between the pure preys, the pure baits, and the BPs, which are different from the prior assigned rations. This is because of incomplete sampling, i.e., some of the prior assigned BPs become either pure baits, pure preys, or isolated nodes (which are not detected) in the resultant network. In this study, when we refer to a protein as a pure bait, a pure prey, or a BP, we refer to the observed behavior of the protein, not the prior assigned property.
Figure 3a shows the degree distributions of the four types of networks. For ErdösRényi random and exponential networks, the degree distribution of the simulated experimental network (symbols) becomes increasingly different from the corresponding random sample network (lines) as the proportion of pure baits or preys increases. For the powerlaw network, the degree distribution is unchanged. The DPPI network exhibits a truncated powerlaw distribution, and therefore minor effects are observed for small connectivity since it is dominated by a powerlaw component, but larger effects of the differences in sampling manifest for larger connectivity due to the exponential tail of the degree distribution. The subnetwork within the measured network that contains only BPs–which is a random sample of the library and therefore a random sample of the full network–may maintain the distribution characteristics of the full network. However, all links between two pure baits and between two pure preys are missing in the measurement. As such, the contribution of the pure baits and pure preys are biased and may change the characteristics of the degree distribution. An extreme example of this phenomenon can be observed with a random degree distribution with protein ratio of 2:1:7 (BP: pure bait: pure prey) in which the observed degree distribution of the subnetwork displays two peaks with the smaller one contributed by the pure preys alone.
We also counted the subgraphs of the networks as performed in previous studies [27–29]. Theoretically, a randomly sampled subnetwork retaining all links (q = 1) should maintain the ratios between different types of motifs, based on the following argument: a given fournode motif (for example) in the parent network remains intact in the sampled subnetwork if and only if all 4 nodes are in the subnetwork. If the subnetwork is sampled by selecting nodes with a probability p, then a fournode motif survives with probability p^{4}. Since all motifs have the same survival probability, the percentage of different motif types will not change in the randomly sampled subnetwork. On the other hand, in the simulated experimental network, the three types (BP, pure bait, pure prey) may change the survival probability, i.e. the probability that the link is maintained in the sample. For example, for the two motifs: Motif 1 (A–B, A–C, A–D) and Motif 2 (A–B, A–C, B–D) (see Additional file 1 Fig. 2b), if nodes A and D are pure baits, B and C are BPs, it is impossible for Motif 1 to survive to the sampled network as the link A–D will invariably be missed. In contrast, Motif 2 has the survival probability of p^{4}. Thus, the ratio of the three types of nodes we define in this study can determine (arbitrarily) the percentage of interaction motifs observed in the sampled network. Changes in this ratio, over which the experimenter does not have control, can alter the perceived topology and motif makeup of the network.
Figure 3b shows the percentage of six different fournode motifs for each of the four types of original networks (black bar), for the simulated experimental networks (cyan bar), and for the subnetwork composed of BPs (red bar). The percentage of the motifs detected in the subnetwork composed of BPs is almost unchanged from the original network (although larger variations occur in the DPPI dataset). However, the percentage of motif 1 increases and motif 2 decreases in the simulated experimental network (witness this same trend for all four types of networks). Note that although the experimental procedure has almost no effect on degree distribution if the network is scalefree, the network motifs change in the similar manner as in other types of networks.
Figure 3c shows the degree distributions of the subnetwork composed of BPs (CSN) within the simulated experimental networks with protein ratio of 2:1:7 (BP: pure bait: pure prey). For all four types of networks, the distribution of CSN (red symbols) closely matches the degree distribution of the corresponding random sample network (red line). For ErdösRényi random and exponential networks, the degree distribution of the simulated experimental network (magenta symbols) is different from the corresponding random sample network (magenta lines). Fig 3b and Figure 3c imply that the subnetwork composed of BPs (CSN) is the random sample of the full network and therefore retains the topological information of the full network. However, the simulated experimental network will change the topological information: in ErdösRényi random and exponential networks, the change includes both degree distribution and motif distribution; for power law and DPPI networks, the change involves the motif distribution.
Filtering core subnetwork within an experimental dataset
Based on our analysis above, it is not surprising that the bait/prey preference affects the network topology so that it cannot be used to predict the topology of the parent network. But it is also not nonintuitive that the core subnetwork (CSN) which is composed of only BPs (the red dots and lines in Fig. 1c) may better reflect the topological information of the parent network since the proteins in that network are somehow less biased or better represented. It is obvious that in our computer simulated networks (Fig. 3), the CSN is a true random sample of the full network; therefore, the degree distribution and motif structure of this random sample agree very well with the original network. However, in the experimental datasets, even in the CSN as defined above (the red dots and lines in Fig. 1c), most of the proteins are not equally effective as baits and as preys, but rather, exhibit a bias behavior as either bait or prey. This feature exists in all proteinprotein interaction networks we analyzed. For example, protein SRB4 in the yeast dataset (Fig. 1a) is very effective when used as a bait, but much less so as a prey. Specifically, it linked to 95 (we denote this number as m) preys when it was used as a bait. Among the 95 preys, 23 (we denote this number as m_{1}) proteins were also labeled as baits in the dataset. This indicates that if SRB4 is also effective as a prey, it should (theoretically) be linked to at least these 23 proteins when it was a prey. However, it was only linked to 3 (we denote this number as n) baits (TAF17, YNR024W, and RIF2), 2 of which (we denote this number as n_{1}) themselves behave as preys. Unfortunately, none of the 3 proteins that SRB4 linked to when it was a prey belonged to the list of 23 proteins that should have been able to link with SRB4. If SRB4 was equally effective as both bait and prey, it would link to the same 23 baits when it is used a prey, resulting in 23 bidirectional interactions; however, none of these bidirectional links were detected in the experiment. In fact, in all the available experimentallymeasured datasets [11, 12, 20, 23], the incidence of bidirectional links is very low. For example, in the yeast network by Ito et al [23], there are only 74 bidirectional interactions out of 4,549 total interactions among 3,278 proteins. In the human network by Stelzl et al [12], 8 out of 3,269 interactions are bidirectional. In the DPPI network by Giot et al [20], the value is 266 out of 20,405. Most of these bidirectional interactions (260 out of 266) were retained in their highconfidence dataset though the total interactions were reduced to 4,780, suggesting that most of the detected bidirectional interactions are true links. The reason for the prevalence of this incongruent behavior of proteins in one scenario versus another (i.e. preferential actions as bait or prey) is unclear, but may result from altered protein folding, differences in posttranslational modification, necessity of tertiary interactions, or other factors.
According to our analysis above, exclusion of pure baits and pure preys does not eliminate the biased behavior of proteins from the CSN. To further refine this network, we first define two quantities–the bait score and prey score–to quantitatively characterize the experimental behavior of individual proteins. These two quantities are empirically defined as: bait score = m/n_{1}, prey score = n/m_{1} (truncated to 1 if greater than 1). The rationale for these definitions is as follows. For the hypothetical Protein X, m is the number of preys to which Protein X links when it is a bait protein, among which m_{1} proteins are themselves also baits in the experiment. The number of baits to which Protein X links when it is a prey protein, is denoted by the term n. In the perfect experiment, when Protein X functions as a prey it should therefore link to at least m_{1} proteins (i.e. m_{1} should be equal to n). This of course is not the case in a real experiment, however, and therefore a protein's behavior as a prey is quantified by n/m_{1}, i.e., the prey score. In the experimental setting, n can be larger than m_{1}, and m_{1} = 0 for the pure preys; therefore, once n>m_{1}, we set the prey score to be the maximum 1. Similar nomenclature is used to label proteins from the prey perspective. For a given Protein X, n is the number of baits to which it links when it is a prey, among which n_{1} proteins are themselves also preys in the same experiment. As with the bait score above, the experimental data does not show the idealized relationship in which all interactions are detected from both directions, and therefore the bait score is calculated as m/n_{1}. Relating these two scores together in the idealized scenario for a BP protein the bait score = prey score = 1, pure baits have bait score = 1 and prey score = 0, and pure preys have bait score = 0 and prey score = 1. For the proteins in red nodes in Fig. 1c, both scores range from 0 to 1, reflecting the aforementioned point that amongst the proteins functioning as both bait and prey, there is a range over which the relative abilities of individual proteins in each of these roles is distributed.
Figures 4a and 4b show the two scores for the Yeast dataset and the DPPI dataset (scores for other datasets are shown in Additional file 1 Fig.S3). We can define the core subnetwork (CSN) by filtering out the proteins with low bait and prey scores. This is done by selecting a real number s between 0 and 1 and all of the nodes whose bait and prey scores are ≥ s are members of the CSN. The proteins with both higher bait scores and higher prey scores are less biased and more likely to provide accurate topological information. If we filter the dataset by setting the bait score and prey score to be greater than zero, the resultant CSN looks like Fig. 1c, i.e., all the pure baits and pure preys are filtered out. This filtering step is also shown for the Drosophila network in Fig 4C. If one further redefines the bait and prey scores for the CSN, the new score distribution becomes much more symmetric (Fig. 4c). For a randomlysampled network, the score distribution is symmetric and repeating this sampling process retains the symmetry (Fig. 4d). If we filter the dataset with different bait and prey score criteria, as the score threshold increases, so does the degree of symmetry in the sampled data (Fig. 4e and 4f). Therefore, the CSN has symmetry similar to that of the randomly sampled networks, providing strong evidence that the CSN's behavior is more akin to that of a true random sample. We calculated the same ratios as shown in Fig. 2 for the CSN of the DPPI dataset–the ratios equal to zero–which is similar to the randomly sampled networks as in Fig. 2b.
In the DPPI dataset by Giot et al [20], a confidence score was assigned to each link in the measured network on the basis of experimental data. Figure 5a displays the percentage of links in 10 bins of confidence score for the DPPI network (red line). The other lines are the confidence scores for different CSNs generated from the DPPI network using different bait and prey scores. Note that for all levels of confidence, the percentage of links was higher for CSN regardless of the bait and prey scores. This is particularly evident in higher bins of confidence, emphasizing that the CSN approach identifies (in an unsupervised manner) protein interactions that were experimentally assigned higher confidence. The average confidence score of the DPPI network is 0.328; however, the average confidence score of the CSN (for the highest bait and prey scores) increases to 0.485. Even for the highconfidence DPPI dataset [20], the average confidence score of the CSN is still higher than that of the whole sampled network (Fig. 5b), supporting the CSN method described in this paper as a reliable independent means to assess the topology of the entire network. Lastly, the ratio of pure baits to pure preys is much closer to 1 (which, as described above, is the ideal scenario for a true random sample) when the CSNs are examined as compared to the total experimentally measured network (Fig. 5c), indicating that the CSN may better approximate a random sample of the original network. In fact, this same feature exists in the other experimental datasets [12, 23] we evaluated (data not shown), that is, the ratio of pure baits to pure preys approaches 1 for the CSN.
When the original DPPI dataset was filtered into the highconfidence one [20], the protein number collapsed from 7048 to 4679 (66% of initial value) and the link number from 20405 to 4780 (23% of initial value). For the CSN generated with bait and prey scores ≥ 0.5 before filtering with confidence score, there were 1149 proteins with 1834 links, of which 130 links were bidirectional, and the average confidence score was 0.438. After the filtering, 702 (61%) proteins, 854 (47%) links, and 126 (97%) bidirectional links remained, and the average confidence score was 0.747. This exercise demonstrates that the links in the CSN have a much higher retention rate (47% vs. 23%) when filtered with confidence, in further agreement with the higher average confidence score of interactions in the CSN. This conclusion is further substantiated if we regenerate the CSN (with the same bait and prey scores) after filtering the DPPI network to the high confidence DPPI network on the basis of the experimental data: this new CSN has 937 (602 are identical to those in the unfiltered CSN) proteins, 902 (450 identical) links, 223 bidirectional links, and an average confidence score of 0.753, which is substantially increased in comparison to when the filtering is done after the CSN is defined from the DPPI network. Interestingly, 84% (223/266) of the bidirectional links were retained when the CSN was defined after filtering the DPPI network to the high confidence DPPI network, versus 47% (126/266) retention of bidirectional links when defined from the DPPI network prior to confidence score filtering. Thus, this CSN approach is an independent (and complementary) method to identify high confidence links more likely to harbor accurate topological information.
We also compared the motif distributions of the DDPI dataset and their CSNs (Fig. 5c). The percentage of the Motif 1 is higher, while that of Motif 2 is lower, in the DPPI network as compared to those observed in the CSN, which agrees with the theoretical analysis in Fig. 3. This is also true for the other experimental datasets (Additional file 1 Fig.S4).
Based on the analyses above, we hypothesize that the CSN within the experimentally sampled subnetwork is a closer approximation of a random sample and thus retains the topological information of the original network better than the entire experimental sample. Theoretically, filtering the experimental datasets using our method with higher bait score and prey score thresholds, one can obtain a better CSN. However, due to the limited number of proteins in the network, higher bait and prey scores result in fewer proteins in the CSN, which may cause the CSN to be too small to faithfully retain the topological information of the parent network.
What are the degree distributions of proteinprotein interaction networks?
A number of studies have suggested that proteinprotein interaction networks are scalefree [3, 4, 10–13, 18], whereas other studies have contested this interpretation [19–22]. Han et al [9] showed that the scalefree nature may be due to the low sampling rate and imperfect sampling methods which can cause a subnetwork from a ErdösRényi random network to appear scalefree. For this to happen, a key feature is the loss of the peak in the binomial distribution of the random network. Since the peak is located at [Nγ]~[(N1)γ] = [<k>] ([x] is the integer part of x, N is the size of the original network, γ is the sampling rate, and <k> is average connectivity of the sampled subnetwork, see Additional file 1 text for details), when <k><2, the peak will disappear. However, the average connectivity <k> of most of the measured networks is greater than 2, even for some of the CSNs we examined (Additional file 1 Table S1), indicating that the proteinprotein interaction networks may not be random networks. On the other hand, our analysis shows that if the proteinprotein interaction networks are scalefree (that is, if they have a powerlaw distribution), the degree distributions of either a random sample, an experimental sample or the CSN all closely resemble the same powerlaw distribution of the original network (see Fig. 3). This may be true even though a randomly sampled subnetwork of a scalefree network may not truly be scalefree in the theoretical sense, as shown by Stumpf et al [7]. In fact, most of the experimental datasets exhibit a truncated powerlaw distribution p(k) ∝ k^{δ}e^{εk}(see Additional file 1 Fig.S4), and for the DPPI dataset (Fig. 6a), it is well fit by p(k) ∝ k^{1.2} e^{0.038k}as shown by Giot et al [20]. A CSN with both bait and prey scores greater than or equal to 0.5 has a degree distribution close to p(k) ∝ k^{0.6} e^{0.22k}, which has a larger exponential component but smaller powerlaw component than the DPPI network. For the highconfidence dataset of the DPPI network (Fig. 6b), it can be well fit by p(k) ∝ k^{1.26} e^{0.27k}, while the CSN defined by both bait and prey scores greater than or equal to 0.5 has a degree distribution p(k) ∝ k^{0.01} e^{0.75k}which is almost completely exponential. To show that this effect is not due solely to the reduction in network size, we also show the degree distributions of two random subsets of the experimentally sampled network: one where the protein number is the same as that of the CSN (called random sample 1) and the other in which the link number is the same as that of the CSN (called random sample 2), both of which have degree distributions that are very different from the CSN. In other datasets we analyzed, the degree distributions of CSNs all have a smaller powerlaw component and a larger exponential component as compared to the original datasets (Additional file 1 Fig.S4). However, we are not able to completely rule out that the reduction in network size contributes to the enhancement of the exponential component. The two randomly sampled networks in Fig. 6a are not very different from the CSN in both the powerlaw component and the exponential component. While the networks in Fig. 6b have much stronger powerlaw components than the CSN, there are relatively few data points making up the degree distribution for the randomly sampled networks.
Discussion
The present study provides an improved method for extracting accurate topological information about real proteinprotein interaction networks from experimentallyobtained subnetworks. The fundamental conclusions of this study can be summarized as follows: (i) random sampling of networks preserves topological information, regardless of the type of network analyzed; and (ii) experimental proteinprotein interaction studies have wellestablished limitations that make their method of sampling nonrandom; however, (iii) definition of a CSN that contains proteins that behave experimentally as both baits and preys better approximates a random sample and therefore increases the accuracy of topological assessment of proteinprotein interaction networks. We show that sampling of theoretical protein interaction networks with exponential, random or scalefree topology in a manner that takes into account experimental limitations, can (and indeed, usually does) produce a sample with scalefree topology; it is given that samples of protein interaction networks appear scalefree; from this, however, it cannot be concluded (as has been previously attempted) that protein interaction networks are scalefree.
Based on our method of defining CSN from the experimental datasets, we show that the degree distribution of the original network may not be scalefree, but may in fact exhibit an exponential distribution. Protein interaction analyses have unavoidable limitations including false positive and negative identifications [30–33] and assumed binary interactions, as mentioned above. We suspect that these false positives may contribute to the observed powerlaw component of the proteinprotein interaction networks based on the following rationale: (i) the highconfidence Drosophila network (purportedly containing fewer false positives [32]) has a stronger exponential component (also verified by Przulj and colleagues [21]) and the CSN has an even higher confidence score and stronger exponential component (Fig. 5 and Figs. S4); (ii) many proteins preferentially behave as either baits or preys but not both, suggesting an experimentallyintroduced preferential attachment phenomenon (introduction of hubs by experimental bias) which, as shown by Barabasi and Albert [34], is a key factor for occurrence of powerlaw distributions; and (iii) the degree distribution of a mammalian proteinprotein interaction network obtained by Ma'ayan et al [29] from the literature, which should have a much lower rate of false positives, exhibits an almost purely exponential distribution (Additional file 1 Fig. S5). Additionally, the failed detection of links between certain proteins (the green ones or blue nodes in Fig. 1c) due to the aforementioned experimental considerations may contribute to the high rate of false negatives, which may thereby also contribute to the powerlaw component of the distribution. Although we show evidence that the degree distribution of proteinprotein interaction networks might exhibit stronger exponential component, further detailed analyses are needed to substantiate this conclusion.
Determining with high confidence topological information about proteinprotein interaction networks from the properties of a smaller, experimentally measured, subnetworks has been challenging [35–37]. However, the topologies of the networks are extremely important for their function and robustness [1–4, 38, 39].
Conclusion
In this study, we have developed an improved method for extracting topological information for cellular proteinprotein interaction networks from experimentallyobtained datasets. As structure, or network anatomy, is a necessary precursor to understanding function, or network physiology, these findings enhance our ability to use existing experimental methods for proteinprotein interaction analysis to investigate the behavior of these networks in vivo.
Methods
Experimental datasets
The experimental datasets analyzed in this study were either downloaded from the related websites or kindly provided by the authors of the following references [2, 9, 11, 12, 20, 23, 29, 31, 40–42].
Theoretical networks
Theoretical networks were generated following the method by Bender and Canfield [43], that is, we assigned a desired number of edges for each node following the theoretical distribution, then randomly linked a pair of nodes to make an edge, and decreased the link number for both nodes by one until all edges were assigned to nodes without repetition. Random networks were generated according to the ErdösRényi model binomial degree distribution represented by: $p(k)={C}_{N1}^{k}{\gamma}^{k}{(1\gamma )}^{N1k}$.
Simulated experimental networks
To mimic the experimental sampling, we first generated the theoretical parent networks with N nodes by the method mentioned above. Then we randomly selected M(M<N) nodes from the Nnode parent network, and randomly assigned the nodes in the Mnode network to be pure baits, pure preys, or both baits and preys with different probabilities independent of the number of links of the nodes. We then applied the following rules to the links of the selected nodes:

1)
Any interaction starts from a pure prey or ends at a pure bait is forbidden;

2)
For the allowed interactions, each has a probability q (in the simulations in Fig 3, we used q = 1) to be detected;

3)
A link A–B exists when at least one of interactions A → B and B → A is detected.
Motif detection
We detected the motifs using the software mfinder1.2 developed by U. Alon's lab [44].
References
 1.
Albert R, Jeong H, Barabasi AL: Error and attack tolerance of complex networks. Nature 2000, 406(6794):378–382. 10.1038/35019019
 2.
Han JD, Bertin N, Hao T, Goldberg DS, Berriz GF, Zhang LV, Dupuy D, Walhout AJ, Cusick ME, Roth FP, Vidal M: Evidence for dynamically organized modularity in the yeast proteinprotein interaction network. Nature 2004, 430(6995):88–93. 10.1038/nature02555
 3.
Barabasi AL, Oltvai ZN: Network biology: understanding the cell's functional organization. Nat Rev Genet 2004, 5(2):101–113. 10.1038/nrg1272
 4.
Jeong H, Mason SP, Barabasi AL, Oltvai ZN: Lethality and centrality in protein networks. Nature 2001, 411(6833):41–42. 10.1038/35075138
 5.
Deeds EJ, Ashenberg O, Shakhnovich EI: A simple physical model for scaling in proteinprotein interaction networks. Proc Natl Acad Sci U S A 2006, 103(2):311–316. 10.1073/pnas.0509715102
 6.
Shi YY, Miller GA, Qian H, Bomsztyk K: Freeenergy distribution of binary proteinprotein binding suggests crossspecies interactome differences. Proc Natl Acad Sci U S A 2006, 103(31):11527–11532. 10.1073/pnas.0604316103
 7.
Stumpf MP, Wiuf C, May RM: Subnets of scalefree networks are not scalefree: sampling properties of networks. Proc Natl Acad Sci U S A 2005, 102(12):4221–4224. 10.1073/pnas.0501179102
 8.
Stumpf MP, Wiuf C: Sampling properties of random graphs: the degree distribution. Phys Rev E Stat Nonlin Soft Matter Phys 2005, 72(3 Pt 2):36118.
 9.
Han JD, Dupuy D, Bertin N, Cusick ME, Vidal M: Effect of sampling on topology predictions of proteinprotein interaction networks. Nat Biotechnol 2005, 23(7):839–844. 10.1038/nbt1116
 10.
Jeong H, Tombor B, Albert R, Oltvai ZN, Barabasi AL: The largescale organization of metabolic networks. Nature 2000, 407(6804):651–654. 10.1038/35036627
 11.
Li S, Armstrong CM, Bertin N, Ge H, Milstein S, Boxem M, Vidalain PO, Han JD, Chesneau A, Hao T, Goldberg DS, Li N, Martinez M, Rual JF, Lamesch P, Xu L, Tewari M, Wong SL, Zhang LV, Berriz GF, Jacotot L, Vaglio P, Reboul J, HirozaneKishikawa T, Li Q, Gabel HW, Elewa A, Baumgartner B, Rose DJ, Yu H, Bosak S, Sequerra R, Fraser A, Mango SE, Saxton WM, Strome S, Van Den Heuvel S, Piano F, Vandenhaute J, Sardet C, Gerstein M, DoucetteStamm L, Gunsalus KC, Harper JW, Cusick ME, Roth FP, Hill DE, Vidal M: A map of the interactome network of the metazoan C. elegans. Science 2004, 303(5657):540–543. 10.1126/science.1091403
 12.
Stelzl U, Worm U, Lalowski M, Haenig C, Brembeck FH, Goehler H, Stroedicke M, Zenkner M, Schoenherr A, Koeppen S, Timm J, Mintzlaff S, Abraham C, Bock N, Kietzmann S, Goedde A, Toksoz E, Droege A, Krobitsch S, Korn B, Birchmeier W, Lehrach H, Wanker EE: A human proteinprotein interaction network: a resource for annotating the proteome. Cell 2005, 122(6):957–968. 10.1016/j.cell.2005.08.029
 13.
Song C, Havlin S, Makse HA: Selfsimilarity of complex networks. Nature 2005, 433(7024):392–395. 10.1038/nature03248
 14.
Lee SH, Kim PJ, Jeong H: Statistical properties of sampled networks. Phys Rev E Stat Nonlin Soft Matter Phys 2006, 73(1 Pt 2):016102.
 15.
Yoon S, Lee S, Yook SH, Kim Y: Statistical properties of sampled networks by random walks. Phys Rev E Stat Nonlin Soft Matter Phys 2007, 75(4 Pt 2):046114.
 16.
Vazquez A, Dobrin R, Sergi D, Eckmann JP, Oltvai ZN, Barabasi AL: The topological relationship between the largescale attributes and local interaction patterns of complex networks. Proc Natl Acad Sci U S A 2004, 101(52):17940–17945. 10.1073/pnas.0406024101
 17.
Balazsi G, Barabasi AL, Oltvai ZN: Topological units of environmental signal processing in the transcriptional regulatory network of Escherichia coli. Proc Natl Acad Sci U S A 2005, 102(22):7841–7846. 10.1073/pnas.0500365102
 18.
Uetz P, Dong YA, Zeretzke C, Atzler C, Baiker A, Berger B, Rajagopala SV, Roupelieva M, Rose D, Fossum E, Haas J: Herpesviral protein networks and their interaction with the human proteome. Science 2006, 311(5758):239–242. 10.1126/science.1116804
 19.
Tanaka R, Yi TM, Doyle J: Some protein interaction data do not exhibit power law statistics. FEBS Lett 2005, 579(23):5140–5144. 10.1016/j.febslet.2005.08.024
 20.
Giot L, Bader JS, Brouwer C, Chaudhuri A, Kuang B, Li Y, Hao YL, Ooi CE, Godwin B, Vitols E, Vijayadamodar G, Pochart P, Machineni H, Welsh M, Kong Y, Zerhusen B, Malcolm R, Varrone Z, Collis A, Minto M, Burgess S, McDaniel L, Stimpson E, Spriggs F, Williams J, Neurath K, Ioime N, Agee M, Voss E, Furtak K, Renzulli R, Aanensen N, Carrolla S, Bickelhaupt E, Lazovatsky Y, DaSilva A, Zhong J, Stanyon CA, Finley RL Jr., White KP, Braverman M, Jarvie T, Gold S, Leach M, Knight J, Shimkets RA, McKenna MP, Chant J, Rothberg JM: A protein interaction map of Drosophila melanogaster. Science 2003, 302(5651):1727–1736. 10.1126/science.1090289
 21.
Przulj N, Corneil DG, Jurisica I: Modeling interactome: scalefree or geometric? Bioinformatics 2004, 20(18):3508–3515. 10.1093/bioinformatics/bth436
 22.
Khanin R, Wit E: How scalefree are biological networks. J Comput Biol 2006, 13(3):810–818. 10.1089/cmb.2006.13.810
 23.
Ito T, Chiba T, Ozawa R, Yoshida M, Hattori M, Sakaki Y: A comprehensive twohybrid analysis to explore the yeast protein interactome. Proc Natl Acad Sci U S A 2001, 98(8):4569–4574. 10.1073/pnas.061034498
 24.
Aloy P, Russell RB: Potential artefacts in proteininteraction networks. FEBS Lett 2002, 530(1–3):253–254. 10.1016/S00145793(02)034270
 25.
Maslov S, Sneppen K: Specificity and stability in topology of protein networks. Science 2002, 296(5569):910–913. 10.1126/science.1065103
 26.
Maslov S, Sneppen K: Protein interaction networks beyond artifacts. FEBS Lett 2002, 530(1–3):255–256. 10.1016/S00145793(02)034282
 27.
Milo R, ShenOrr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U: Network motifs: simple building blocks of complex networks. Science 2002, 298(5594):824–827. 10.1126/science.298.5594.824
 28.
Milo R, Itzkovitz S, Kashtan N, Levitt R, ShenOrr S, Ayzenshtat I, Sheffer M, Alon U: Superfamilies of evolved and designed networks. Science 2004, 303(5663):1538–1542. 10.1126/science.1089167
 29.
Ma'ayan A, Jenkins SL, Neves S, Hasseldine A, Grace E, DubinThaler B, Eungdamrong NJ, Weng G, Ram PT, Rice JJ, Kershenbaum A, Stolovitzky GA, Blitzer RD, Iyengar R: Formation of regulatory patterns during signal propagation in a Mammalian cellular network. Science 2005, 309(5737):1078–1083. 10.1126/science.1108876
 30.
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(5):349–356. 10.1074/mcp.M100037MCP200
 31.
von Mering C, Krause R, Snel B, Cornell M, Oliver SG, Fields S, Bork P: Comparative assessment of largescale data sets of proteinprotein interactions. Nature 2002, 417(6887):399–403. 10.1038/nature750
 32.
Bader JS, Chaudhuri A, Rothberg JM, Chant J: Gaining confidence in highthroughput protein interaction networks. Nat Biotechnol 2004, 22(1):78–85. 10.1038/nbt924
 33.
Gandhi TK, Zhong J, Mathivanan S, Karthick L, Chandrika KN, Mohan SS, Sharma S, Pinkert S, Nagaraju S, Periaswamy B, Mishra G, Nandakumar K, Shen B, Deshpande N, Nayak R, Sarker M, Boeke JD, Parmigiani G, Schultz J, Bader JS, Pandey A: Analysis of the human protein interactome and comparison with yeast, worm and fly interaction datasets. Nat Genet 2006, 38(3):285–293. 10.1038/ng1747
 34.
Barabasi AL, Albert R: Emergence of scaling in random networks. Science 1999, 286(5439):509–512. 10.1126/science.286.5439.509
 35.
Gardner TS, di Bernardo D, Lorenz D, Collins JJ: Inferring genetic networks and identifying compound mode of action via expression profiling. Science 2003, 301(5629):102–105. 10.1126/science.1081900
 36.
Guido NJ, Wang X, Adalsteinsson D, McMillen D, Hasty J, Cantor CR, Elston TC, Collins JJ: A bottomup approach to gene regulation. Nature 2006, 439(7078):856–860. 10.1038/nature04473
 37.
Han Z, Yang L, Maclellan WR, Weiss JN, Qu Z: Hysteresis and cell cycle transitions: how crucial is it? Biophys J 2005, 88(3):1626–1634. 10.1529/biophysj.104.053066
 38.
Doyle JC, Alderson DL, Li L, Low S, Roughan M, Shalunov S, Tanaka R, Willinger W: The "robust yet fragile" nature of the Internet. Proc Natl Acad Sci U S A 2005, 102(41):14497–14502. 10.1073/pnas.0501426102
 39.
Willeboordse FH: Dynamical advantages of scalefree networks. Phys Rev Lett 2006, 96(1):018702. 10.1103/PhysRevLett.96.018702
 40.
Salwinski L, Miller CS, Smith AJ, Pettit FK, Bowie JU, Eisenberg D: The Database of Interacting Proteins: 2004 update. Nucleic Acids Res 2004, 32(Database issue):D449–51. 10.1093/nar/gkh086
 41.
Uetz P, Giot L, Cagney G, Mansfield TA, Judson RS, Knight JR, Lockshon D, Narayan V, Srinivasan M, Pochart P, QureshiEmili A, Li Y, Godwin B, Conover D, Kalbfleisch T, Vijayadamodar G, Yang M, Johnston M, Fields S, Rothberg JM: A comprehensive analysis of proteinprotein interactions in Saccharomyces cerevisiae. Nature 2000, 403(6770):623–627. 10.1038/35001009
 42.
Lehner B, Fraser AG: A firstdraft human proteininteraction map. Genome Biol 2004, 5(9):R63. 10.1186/gb200459r63
 43.
Bender EA, Canfield ER: The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory A 1978, 24: 296–307. 10.1016/00973165(78)900596
 44.
Acknowledgements
This study was supported by grants from the NIH/NHLBI and by the Laubisch and Kawata Endowments at UCLA.
Author information
Affiliations
Corresponding author
Additional information
Authors' contributions
LY carried out the computer simulations, participated in research design and drafting the manuscript. TMV participated in design and discussion of the research, and helped to draft the manuscript. ZH, WRM and JNW participated in discussion of the research. ZQ designed and directed the research, and drafted the manuscript. All authors read and approved the final manuscript.
Electronic supplementary material
Authors’ original submitted files for images
Below are the links to the authors’ original submitted files for images.
Rights and permissions
About this article
Cite this article
Yang, L., Vondriska, T.M., Han, Z. et al. Deducing topology of proteinprotein interaction networks from experimentally measured subnetworks. BMC Bioinformatics 9, 301 (2008). https://doi.org/10.1186/147121059301
Received:
Accepted:
Published:
Keywords
 Degree Distribution
 Confidence Score
 Topological Information
 Original Network
 Experimental Dataset