- Journal List
- BMC Genomics
- v.9; 2008
- PMC2315657

# Topological comparison of methods for predicting transcriptional cooperativity in yeast

^{1}Structural Bioinformatics Group (GRIB), IMIM-Universitat Pompeu Fabra, C/Doctor Aiguader, 88, Barcelona 08003, Spain

^{}Corresponding author.

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.

## Abstract

### Background

The cooperative interaction between transcription factors has a decisive role in the control of the fate of the eukaryotic cell. Computational approaches for characterizing cooperative transcription factors in yeast, however, are based on different rationales and provide a low overlap between their results. Because the wealth of information contained in protein interaction networks and regulatory networks has proven highly effective in elucidating functional relationships between proteins, we compared different sets of cooperative transcription factor pairs (predicted by four different computational methods) within the frame of those networks.

### Results

Our results show that the overlap between the sets of cooperative transcription factors predicted by the different methods is low yet significant. Cooperative transcription factors predicted by all methods are closer and more clustered in the protein interaction network than expected by chance. On the other hand, members of a cooperative transcription factor pair neither seemed to regulate each other nor shared similar regulatory inputs, although they do regulate similar groups of target genes.

### Conclusion

Despite the different definitions of transcriptional cooperativity and the different computational approaches used to characterize cooperativity between transcription factors, the analysis of their roles in the framework of the protein interaction network and the regulatory network indicates a common denominator for the predictions under study. The knowledge of the shared topological properties of cooperative transcription factor pairs in both networks can be useful not only for designing better prediction methods but also for better understanding the complexities of transcriptional control in eukaryotes.

## Background

Current studies indicate that the combinatorial control of transcription allows an extremely large number of regulatory decisions (particularly in eukaryotes) through the cooperation of a small number of transcription factors (TFs) [1-3]. Determining cooperativity between TFs is essential to understand transcriptional regulation. However, in contrast to other well-characterized relationships between proteins, cooperativity in a broad sense does not have a unique description. It has been simply described as the regulation of the expression of a gene by two or more specific transcription factors [4], often related to protein-protein interactions between the DNA-binding elements [5-8]. In this line, cooperation between TFs has been restricted to the existence of DNA-binding sites close in the same promoter regions of target genes [9]. However, other studies have suggested a basis for cooperativity in the role of cis-regulatory elements acting as analogue implementations of logic circuits, devoid of protein-protein contacts [10,11]. In addition, some works showed that cooperative TF pairs (hereinafter CTFPs) do not act necessarily together, neither spatially nor temporally [11-13]. A model by Cokus et al. assumed that all TFs binding the same promoter do cooperate with one another in some degree [14]. Finally, transcriptional synergy (a non-linear regulatory effect on the expression of a gene when two or more TFs bind its promoter) has also been considered as a form of cooperativity [15,16].

We investigated the nature of four sets of CTFPs (predicted by four different computational methods, see Table Table11 and *Methods*) by means of the analysis of their roles in two distinct biological networks (the protein interaction network and the regulatory network). Our findings suggest that cooperativity is reflected in the structure of the protein interaction network (PIN) with shorter path lengths and larger topological overlaps (i.e. larger modularity) than expected by chance. This was true for all four sets of CTFPs, implying a common denominator in the nature of all the predictions regardless of the prediction method used. Also, members of CTFPs seem to share common target genes but do not show other distinctive regulatory traits, neither in terms of inter-regulation nor in terms of their in-degree (i.e. the regulatory influence upon them). Since cooperativity seems to be responsible for many important transcriptional responses in the cell, we believe that the results presented here will help to better understand its nature and, consequently, will assist in providing a solid framework to develop better tools for its prediction.

## Results and discussion

### Similarities and dependences between predictions

As no gold-standard exists for cooperative TF pairs, we compared the predictions of the four methods by means of their ability to predict the results of one another. We found that 32 (35.2%) of the CTFPs are predicted by more than one method and 8 (8.8%) are predicted by more than two. The fact that only 6 (6.6%) of the CTFPs are predicted by all four methods suggests that divergent criteria in characterizing cooperativity accounts for a large part of the observed divergence in the results of the four methods. In order to calculate the pairwise dependences and the overlap between the four datasets, we used the mutual information coefficient and the Jaccard coefficient, respectively [17-19]. Results are shown in Table Table2.2. The predictions of the four methods are not significantly correlated to one another in terms of mutual information, although their overlap in terms of their positive predictions is low yet significant. The low level of this overlap also reveals largely divergent criteria to assess cooperativity. Indeed, as shown by the mutual information analysis, knowing the results of one method gives little information on the results expected in any other method. The different data sources used by each method might account for part of this observation. For example, the TF pair YLR131C (Ace2) – YGL073W (Hsf1) does not co-occur in the location data from Harbison et al. [9], so it could not be predicted by method T, which relied in this information source. However, it was characterized as cooperative by method B, which relied on a different data source. Also, the threshold values applied by each method affect the list of TF pairs accepted as cooperative. An additional explanation for the observed disagreements between results could be the criteria used to strengthen computational prediction of cooperativity by seeking support from experimental observations. Experimental support in the four papers considered in this study had different forms, for instance: (i) TF pairs which are known to physically interact (such as YER111C (Swi4) – YLR182W (Swi6), forming the SBF complex, or YDL056W (Mbp1) – YLR182W (Swi6), forming the MBF complex); (ii) TF pairs which belong to the same transcriptional complex (such as YOR372C (Ndd1) – YIL131C (Fhk1), which belong to the SFF complex despite the absence of recorded physical interaction between them); (iii) TF pairs which bind the same DNA sequence (such as YLR131C (Ace2) – YDR146C (Swi5), which implies some antagonistic interaction); (iv) TF pairs with a regulatory (e.g. inhibitory) activity on each other, (such as YPL049C (Dig1) – YHR084W (Ste12)); (v) TF pairs involved in the same biological process (such as YPR104C (Fhl1) – YNL216W (Rap1), both involved in rRNA processing, or YDR146C (Swi5) – YIR018W (Yap5), putatively involved in drug metabolism [20]). Cooperativity between TF pairs without documented relation (neither at protein level nor at functional level) has been occasionally accepted on the basis of cross-talk between different cellular processes, for instance the pair YDR259C (Yap6) – YKL043W (Phd1) might be controlling cell adhesion [20]. Consequently, differences in predictions among the four methods might be the product of the application of different criteria to define cooperativity. Furthermore, some TF pairs considered as false positives by one method are considered *bona fide *cooperative TF pairs in other, for instance YNL216W (Rap1) – YIR018W (Yap5), considered as a potential false positive pair by method C (due to lack of experimental support) and accepted by method N as a part of the same cooperative module.

When comparing the predictions of different methods, it is also worth mentioning that, although three of the methods derive their information mainly from cell-cycle-related expression analysis, predictions of method N (which is not cell-cycle based) does not show neither a particularly lower dependence nor a lower similarity with the predictions of the other three methods. Although there is a possibility that cooperativity is mainly confined to the control of the cell cycle, we cannot discard a bias towards characterizing cooperative TF pairs involved in the regulation of cell cycle due to (i) the extensive literature available on cell cycle regulation and (ii) the comparison to other prediction methods which are cell-cycle-based.

### Cooperative TF pairs in the protein interaction network

Previous observations suggest an underlying basis of protein-protein interaction for transcriptional cooperativity, either between both TFs or through a non-DNA-binding protein, although other mechanisms not based on protein-protein interactions are possible [1,21]. If one assumes that CTFPs tend to physically interact (either directly or through another protein, which might not bind DNA), the shortest path length between them (i.e. the shortest distance between two cooperative TFs in the PIN) should be shorter than random expectation.

The CTFPs predicted by the four literature methods were not found to be statistically different from one another in terms of their shortest path length in the PIN (Kruskal-Wallis test), which implies some topological consistency across the whole prediction space. When compared to random expectation, the shortest path lengths between members of a CTFP were significantly lower than those produced by random pairing of TFs in all cases (Table (Table3).3). This suggests a fast and efficient response through CTFPs, because one member of the CTFP can readily influence the other. This was expected given the necessarily coordinated implication of both members of a cooperative pair in transcriptional control. However, the fraction of directly connected CTFPs are only 40.5%s in the case of method N, 26.9% in the case of method B, 26.7% in the case of method T, and 20.5% in the case of method C. Hence, it seems unlikely that direct physical interaction as a necessary mediator for cooperativity as it is currently defined, highlighting the importance of proteins mediating in this kind of interactions. Interestingly, Table Table33 also implies that the fact that two TFs regulate a large number of common target genes (i.e. they are co-regulatory, see *Methods *for details) does not necessarily mean a closeness in the PIN similar to that of CTFPs. Also, all methods predict CTFPs that are significantly closer in the PIN than co-functional TF pairs (co-functional TF pairs are TF pairs which regulate similar cellular functions, see *Methods for details*). This is noteworthy since three methods included in our analysis (all except method N) are largely based in the analysis of the expression patterns of the TFs during the cell cycle, which is known to carry a functional signal [22]. Also, it should be taken into account that it is not at all uncommon for TFs to regulate the transcription of other TFs [23], which results in many of them having similar functional profiles according to our method of establishing co-functionality. Our data, however, seems to suggest that cooperativity determined through the regulatory control of the same biological function(s) does not necessarily imply a cooperative interaction between TFs. However, no significant difference was found for any of the four predicted sets of CTFPs with respect to the set of TF pairs defined by the intersection of co-regulatory and co-functional TF pairs. In other words, TF pairs which are simultaneously co-regulatory and co-functional (hereinafter called co-regulatory ∩ co-functional) show a consistently similar closeness in the PIN (and, consequently, a similar capability of transmitting a signal) to that of the four sets of predicted CTFPs, despite many of them not being defined as cooperative (of all the TF pairs which are co-regulatory ∩ co-functional, 4.76% are predicted as cooperative by method N, 2.38% are predicted as cooperative by method B and none is predicted as cooperative by methods T and C). We have to note, though, that the definition of protein function is inherently incomplete and flawed and, in our case, the function assigned to a TF also depends largely on the quality association between a TF and its target genes. Similar observations were made in the case of the mean shortest path length among the members of a cooperative TF triads [see Additional File 1].

Modularity (i.e. the existence of densely interconnected areas of the network) has been observed in many PINs and has been related to a scale-free architecture of the network [24-27]. TFs in dense modules are expected to show higher topological overlap values (or *modularity *values) in a topological overlap matrix (hereinafter TOM, see *Methods*) [26,28,29]. The CTFPs predicted by the four methods under study were not different from one another in terms of their modularity (Kruskal-Wallis test), which was in all cases higher than expected by random chance (Table (Table4).4). Also, the modularity was significantly higher than that observed for co-functional TF pairs in all cases. It was significantly higher than that of co-regulatory TF pairs for the predictions of all methods but method B at *p*-value < 0.01 (but significant at *p*-value < 0.05). Interestingly, however, the modularity was significantly smaller than that observed in TF pairs which were co-regulatory ∩ co-functional for the CTFPs predicted by methods B and C (and method N at *p*-value < 0.05). This adds to the previous observation that there are co-regulatory n co-functional TF pairs that are actually more clustered in the PIN than CTFPs (but are not, however, identified at CTFPs by most of the methods studied). The analysis of the modularity among the members of a cooperative TF triad produced similar results [see Additional File 1]. Results using the noise-filtered version of the PIN and results for CTFPs predicted a different levels of confidence are provided as supplementary information [see Additional File 2 and Additional File 3, respectively].

Modules in the PIN have been related to the function of their members [30-32]. We did not observe correlation between the modularity and the sets of functions regulated by TFs from the whole population of TFs (*ρ *= 0.071, Spearman test; [see Additional file 4]). However, CTFPs exhibited a noticeable correlation (*ρ *= 0.434 for CTFPs predicted by method N, *ρ *= 0.575 for CTFPs predicted by method B, *ρ *= 0.5 for CTFPs predicted by method T, *ρ *= 0.492 for CTFPs predicted by method C, Spearman test), suggesting a tendency for CTFPs to form higher-order cooperative modules controlling the expression of genes with similar function(s).

### Cooperative TF pairs in the regulatory network

The analysis of different aspects of the architecture of the regulatory network can assist in investigating the regulatory association between CTFPs and their target genes, as well as the inter-regulation of CTFPs with other TFs. The regulatory network is a directed graph, which means that a given node (representing a protein in our case) can be connected to other nodes through two types of edges: (i) incoming edges, which denote a regulatory control performed upon the expression of the protein and (ii) outgoing edges, which denote a transcriptional regulatory control performed by the protein (a TF in this case) upon its neighbors.

Being the regulatory network a directed graph, the shortest path length between nodes A and B is measured as the shortest number of edges connecting either node A to node B or node B to node A. In the context of a regulatory network, this measure is similar to that called regulatory closeness [33]. Intuitively, short regulatory path lengths between TFs imply a stronger influence by one TF on the expression of another. The four sets of CTFPs predicted by the four methods under study were not found to be statistically different from one another in terms of their shortest path lengths in this network (Kruskal-Wallis test). Furthermore, predicted CTFPs did not exhibit path lengths significantly shorter than any of the models of TF pairs used for comparison, including the random pairing of TFs (with the only exception in this case of the predictions of method C; Table Table5).5). The lengths of multi-component loop structures (closed regulatory circuits) involving CTFPs were not significantly shorter than expected by random (Mann-Whitney test; mean loop lengths: 7.30, 8.67, 7.38 and 7.27 for CTFPs predicted by the methods N, B, T and C, respectively), which means that cooperativity does not favor small regulatory motifs as an inter-regulatory mechanism of transcription control. Thus, these results suggest that cooperative TFs rarely interact via inter-regulation. Additionally, we did not observe a correlation between the path length in the regulatory network and the co-expression of TF pairs (Spearman test; [see Additional file 5]), which is consistent with previous claims based on the analysis of mRNA expression profiles under a large number of cellular conditions [33]. Interestingly, the mean shortest path length of the cooperative TF triads was significantly shorter than that of the co-functional TF triads and the random TF triads [see Additional File 1]. This leads to the idea that there is a mutual regulation between cooperative TFs at levels of cooperativity higher than cooperative pairs.

Aside from the inter-regulatory associations between TFs, a certain inner community structure has also been observed in the organization of the regulatory network, which can be used to uncover specific roles for CTFPs [34-37]. A TOM was used to measure the extent to which any two TFs shared regulatory partners. Because of the directed nature of the regulatory network, two TOMs were generated: the in-TOM (accounting for incoming edges, which measures the fraction of TFs regulating the expression of any two TFs) and the out-TOM (accounting for outgoing edges, which measures the fraction of genes regulated by of any two TFs). The CTFPs were not found to be statistically different from one another neither in their in-TOM nor in their out-TOM (Kruskal-Wallis test). As shown in Table Table6,6, The in-degree modularity did not show significant differences with random expectation. This observation, together with the results of the analysis of the shortest path length in the same network, reveal that CTFPs are not necessarily co-regulated (i.e. both members of a CTFP tend to integrate unrelated regulatory inputs). The same conclusion can be extracted from the observation of the modularity among members of a predicted cooperative TF triad [see Additional File 1]. The analysis of the out-degree modularity, however, showed that the two members of a CTFP are likely to have a significantly larger number of common target genes than expected by chance (Table (Table7).7). The out-degree modularity is not significantly larger than that of co-regulatory TF pairs. Although this could be intuitively expected, it is noteworthy since the prediction of cooperativity by all four methods under study involved the analysis of the *n *target genes common to two TFs (as opposed to the target genes regulated solely by one of them), which may only represent a small fraction of the total number of target genes of both TFs combined (despite the strength of the combinatorial effect of the cooperative TF pairs on the *n *common target genes). Method T explicitly selected TF pairs sharing a significantly large *n*. Its independence-test criterion for assessing significance in this aspect was less strict than ours (and, according to the authors, could be skipped in order to find more potential CTFPs). We also observed in Table Table77 that the out-degree modularity was significantly larger for predicted CTFPs with respect to co-functional TF pairs. This result indicates that both members of a CTFP co-regulate the expression of a group of target genes to a larger extent that a co-functional TF pair does. This is not trivial, since the methods studied did not explicitly seek TF pairs whose target genes (common to both TFs or not) displayed similar function(s). Instead, the set of *n *target genes common to both TFs in a CTFP may be involved in the same cellular process, but the set of target genes specific to each TF may contribute to a variety of other processes. The CTFPs did not, however, show a larger modularity than TF pairs which were co-regulatory ∩ co-functional. Taken together, these results show a consistently similar role for all four predictions of CTFPs in the context of the regulatory network, which is only different from random expectation in the case of the out-degree modularity. Analysis of the out-degree modularity for cooperative TF triads gave similar results, although in this case the modularity was also larger than that of TF triads with are co-regulatory n co-functional [see Additional File 1]. Results using CTFPs predicted a different levels of confidence are supplied as supplementary information [see Additional File 3].

In-degree modularity and out-degree modularity were not correlated, neither in the general population of TFs nor in the case of CTFPs (*ρ *= -0.004 for all TFs, *ρ *= -0.095 for CTFPs, Spearman test [see Additional file 6]. This indicates that CTFPs regulating a certain group of genes are not necessarily co-regulated themselves, therefore supporting cooperativity as mediating in the combination of diverse signals received from more generic regulators.

Finally, modules in the PIN have been related to co-regulation of their members [30,38]. Although one would intuitively expect co-regulation for TFs belonging to the same module, no correlation was observed between the TOM derived from the PIN and in-TOM, meaning that co-regulated TFs are not necessarily more modular (*ρ *= 0.035 for all TFs; *ρ *= -0.057 for CTFPs; Spearman test; [see Additional file 7]). This result agrees with the previously-observed lack of correlation between path length and co-expression and can be partly explained by the role of non-transcriptional regulation of TFs. Notwithstanding direct transcriptional regulation in the presence of promoter-bound TFs [39-41], it is known that many TFs remain at a constitutively low level of expression (sometimes bound to the promoters of their target genes in an inactive state) and their activity is modulated by phosphorylation, cofactors and other post-transcriptional mechanisms [42-45]. Furthermore, different expression levels of a TF may have similar regulatory effects on its target genes. However, a slight positive correlation was found between the modularity in the PIN and the out-TOM for the general population of TFs (*ρ *= 0.137, *p*-value < 10^{-5}; Spearman test; [see Additional file 8]). This correlation was clearly stronger if only CTFPs were considered (*ρ *= 0.502, *p*-value < 10^{-5}; Spearman test; [see Additional file 5]), which adds to the important role of physical interaction in cooperativity-influenced differential gene expression profiles.

This study highlights the topological commonalities between CTFPs predicted by different methods. Because of that, our observations can be also used to improve current (and future) prediction methods by incorporating topological information. Although not in the scope of this paper, we propose as additional information a simple example of how to integrate our results to score present predictions [see Additional File 9].

## Conclusion

Because prediction of cooperative TFs is critically important for understanding the operation of the regulatory network, our motivation for carrying out this study was to determine whether four different computational methods devised for prediction of CTFPs do detect TF pairs which actually share some consistent features. This is important in the absence of a gold-standard which could be used to benchmark the performance of methods for prediction of transcriptional cooperativity.

The predictions made by the methods under study exhibited low overlap and dependence in their predictions when compared to each other. The PIN-related topological features of the CTFPs detected by the different methods did not vary significantly among them. However, the topological role of the CTFPs in the PIN suggested that cooperativity is indeed reflected in the network as having (i) a shorter path length and (ii) a larger topological overlap than expected by mere chance. This implies a fast access from one member of a CTFP to the other and a tendency to share common interaction partners despite the fact that many CTFPs are not known to directly interact. Also, the topological parameters in the PIN were not significantly distinct to that of TF pairs which are co-regulatory n co-functional, suggesting that, in topological terms, CTFPs behave like those TF pairs despite the fact that many co-regulatory and co-functional TF pairs are not considered CTFPs. From the perspective of the regulatory network, CTFPs were not more inter-regulated than can be explained by chance alone. This observation is consistent across the predictions of all the four sets but one. With no exceptions, the regulatory distance between CTFPs was similar to that of co-functional and co-regulatory TF pairs. Finally, the analysis of the modularity of TF pairs in the regulatory network revealed a consistent lack of a shared regulation for CTFPs, which might result in a role as integrators of varied inputs.

We can conclude from our observations that the predictions drawn from different rationales are consistent with respect to their topological features in networks of different nature such as the protein interaction network and the regulatory network. This suggests that the different predictions analyzed are complementary despite the unclear definition of transcriptional cooperativity. Furthermore, our observations can be used for improving the present prediction methods for characterization of cooperative TFs and for devising new ones, an instrumental task towards unraveling the architecture of transcriptional networks.

## Methods

### Datasets

Cooperative TF pairs (CTFPs) predicted by the four methods were extracted from the literature. The four methods were called method *N, B, C *and *T *[[20,46-48], respectively]. Details on each literature source are available in Table Table1.1. The total number of distinct CTFPs was 91. 14 cooperative groups of three TFs (cooperative TF triads) predicted by method N were also extracted. The authors of the different methods also provided sets of predictions at levels of confidence different than those used in this paper. The analysis of these other predictions is provided [see Additional File 3]. The list of CTFPs and cooperative TF triads in each set is also provided [see Additional file 10]. After excluding TFs which were not considered as such by all methods and transforming all gene names to YPD nomenclature, the resulting dataset contained 101 distinct TFs. Cell-cycle-based expression profiles of the TFs were extracted from Spellman et al. [49].

### Similarities and dependences between the predictions

Pairwise dependences between the CTFPs predicted by the four methods under study were calculated in terms of their mutual information coefficient. The mutual information between the predictions of methods A and B was defined as MI(A, B) = H(A)+H(B)-H(A, B), where H(A) = -Σp(a)·log_{2}p(a), H(A, B) = -ΣΣp(a, b)·log_{2}p(a, b) and p(a) and p(b) are the marginal probability distributions of the predictions of methods A and B (i.e. the fraction of positive and negative CTFPs identified by each method, respectively). P(a, b) is the joint probability distribution of the predictions of methods A and B. The overlap between the four sets of predictions was calculated by means of the Jaccard coefficient of similarity [50]. The Jaccard coefficient between the predictions of methods A and B is measured as J(A, B) = p(pos, pos)/(1-p(neg, neg)), i.e. the fraction of CTFPs predicted by either method that are predicted by both. The significance of mutual information and Jaccard coefficient for the comparison of two sets of CTFPs was tested against 1000 pairs of random sets of TF of the sizes of the two compared sets.

### Regulatory network and protein interaction network

Associations between TFs and target genes were extracted from Beyer *et al*., who used a Bayesian approach in order to integrate diverse sources with experimental evidences to improve the prediction of this association [51]. We used the subset of TF-regulated gene associations labeled as *highly confident *by the authors. The regulatory network was built as a graph where TFs and regulated genes were represented as nodes and the directed edges represented the control of a TF on the expression target gene. Self-regulatory interactions were excluded. The regulatory network consisted in 3695 proteins and 9959 interactions.

For building a protein interaction network (PIN), we selected all proteins either known to be present in the nucleus or related to transcription (FunCat category 70.10 for nuclear proteins, FunCat category 11.02.03 for transcription-related proteins) [52]. Functional assignments derived from purely computational means were not considered. Proteins were represented as nodes and were connected by an edge if there was evidence of physical interaction between them in the IntAct, MINT, BIND or DIP databases [[53-56], respectively]. PIANA package was used for constructing the network [57]. The resulting PIN consisted of 1900 proteins and 39262 interactions. Because interaction data is known to be noisy, we also generated a filtered PIN composed of interaction supported by more than one independent experimental methods. The results obtained by using this PIN are supplied as additional files [see Additional File 2].

### Topological analysis of the networks

In an undirected network, the shortest path length between two nodes was measured as the smallest number of edges connecting them. In the regulatory network, the shortest path length between two nodes *i *and *j *was calculated as the smallest number of edges connecting either *i *to *j *or *j *to *i*. Lengths of the loops in the regulatory network between two TFs *i *and *j *were calculated as the sum of the shortest distances from *i *to *j *and from *j *to *i*. The *Networkx *module in Python was used for these computations [58].

A topological overlap matrix (TOM) is a matrix which reflects the similarity between each possible pair of nodes in the network in terms of their connectivity (a measure also known as *modularity*). For each pair of nodes *i*, *j *in an undirected network, we define the topological overlap O(*i, j*) as:

where *l*_{ij }denotes the number of common neighbors of *i *and *j *(plus 1 if there is an edge between *i *and *j*) and [min(*k*_{i},*k*_{j})] is the smaller of the k_{i }and k_{j }degrees [26]. In the case of a directed network (such as the regulatory network), the number of common neighbors is calculated independently for incoming edges and outgoing edges. Hence, in the PIN, a topological overlap (or modularity) O_{ij }= 1 implies that TFs *i *and *j *interact with the same proteins, while O_{ij }= 0 indicates that *i *and *j *do not share interaction partners. In the regulatory network, O_{ij }= 1 for the incoming edges implies that both TFs are regulated by the same TFs while O_{ij }= 1 for the outgoing edges means that both TFs regulate the expression of the same genes.

### Co-functional TF pairs and co-regulatory TF pairs

We wished to obtain a list of TF pairs which regulate the expression of genes with similar functions (referred to as *co-functional TF pairs*). The function of a TF A was defined as a non-binary functional profile $\overrightarrow{A}$ of *F *entries, where *F *corresponds to the number different functions considered (*F *= 59 for the second-level categories in the FunCat classification). We placed in the *f*th position the fraction of genes regulated by A which had functions corresponding to the *f*th position. Of the 4248 genes regulated by at least one TF, 3267 were present in at least one second-level functional category. We discarded those TFs regulating genes without functional annotation.

For any pair of TFs A and B in a given dataset, we defined the functional similarity score FS(A, B) as:

For any pair of TFs, the FS score ranged from 0 (TFs A and B regulate genes with no function(s) in common) to 1 (TFs A and B regulate genes with exactly the same set of functions). Examples of the calculation of the FS score can be found at Figure Figure1.1. We considered two TFs as *co-functional *if their FS score was larger than the 90^{th }percentile of the distribution of FS scores of 1000 randomly paired TFs. The resulting number of co-functional TF pairs was 543.

_{1}, TF

_{2 }and TF

_{3}. The group of genes regulated by each TF are G

_{TF1 }= {A, B, C}, G

_{TF2 }= {D, E, F} and G

_{TF3 }= {G, D, H, I}. The five different protein

**...**

Also, we wished to obtain a list of TF pairs which regulate a significant number of common target genes (referred to as *co-regulatory TF pairs*). For any pair of TFs, the co-regulatory score was calculated as the number of target genes common to both TFs divided by the mean number of genes shared by the same pair in 1000 random regulatory networks, following Balaji *et al*. [59]. We labeled two TFs as *co-regulatory *if their co-regulatory score was larger than the 90^{th }percentile of the distribution of co-regulatory scores of 1000 randomly paired TFs. The resulting number of co-regulatory TF pairs was 276.

Finally, we identified the group of TF pairs which were simultaneously co-regulatory and co-functional (called *co-regulatory n co-functional TF pairs*). This group contained 42 TF pairs. The complete list of co-functional TF pairs, co-regulatory TF pairs and *co-regulatory n co-functional TF pairs *are available as additional files [see Additional Files 11, 12 and 13].

### Statistical significance

A distribution of 1000 randomly paired TFs was used as a random model to obtain the statistical significance (at a *p*-value < 0.01) of the topological parameters of the network versus its random expectation (using the non-parametric Man-Whitney test). Also, the distribution of the topological parameters of CTFPs predicted by each method was statistically compared to that of: (i) the co-functional TF pairs, (ii) the co-regulatory TF pairs and (iii) the TF pairs which were co-regulatory ∩ co-functional. All calculations in this paper were performed with the R statistical package [60].

## Abbreviations

CTFP, cooperative transcription factor pair; PIN, protein interaction network; TF, transcription factor; TOM, topological overlap matrix.

## Authors' contributions

DA conceived the study and carried out the analysis. BO participated in the design of the study and helped to draft the manuscript. Both authors read and approved the final manuscript.

## Supplementary Material

**Additional file 1:**

Results for the analysis of cooperative TF triads. This file contains the results of the analysis of the members of cooperative TF triads in the framework of the PIN and the regulatory network.

^{(89K, pdf)}

**Additional file 2:**

Results for the analysis of the filtered PIN. This file contains the results of the topological analysis of the CTFPs in a PIN created by the accumulation of independent experimental evidence. Because of this, this PIN is deemed to be more reliable.

^{(99K, pdf)}

**Additional file 3:**

Results for the analysis of predictions at different levels of confidence. This file contains the results of the topological analysis of CTFPs predicted at levels of confidence different than those used in the main text.

^{(125K, pdf)}

**Additional file 4:**

Correlation between functional similarity and modularity in the PIN. Correlation between functional similarity and modularity in the PIN (measured as topological overlap, see the *Methods *section in the paper). Blue dots represent values derived from all TFs. Orange dots represent values derived from CTFPs only. Correlation was calculated by means of a Spearman test. Correlations for each set of CTFPs are as follows: *ρ *= 0.434 (*p*-value = 0.003) for CTFPs predicted by method N, *ρ *= 0.575 (*p*-value = 0.001) for CTFPs predicted by method B, *ρ *= 0.5 (*p*-value = 0.058) for CTFPs predicted by method T, *ρ *= 0.492 (*p*-value = 0.002) for CTFPs predicted by method C.

^{(83K, pdf)}

**Additional file 5:**

Correlation between the path length in the regulatory network and the co-expression of TF pairs. Correlation between the path length in the regulatory network and the co-expression of TF pairs. Co-expression was calculated by means of the Pearson correlation coefficient of cell-cycle-based expression data (see *Methods*). Blue dots represent values derived from all TFs. Orange dots represent values derived from CTFPs only. Correlation was calculated by means of a Spearman test. Correlations for each set of CTFPs are as follows: *ρ *= -0.059 (*p*-value = 0.775) for CTFPs predicted by method N, *ρ *= -0.319 (*p*-value = 0.148) for CTFPs predicted by method B, *ρ *= 0.391 (*p*-value = 0.186) for CTFPs predicted by method T, *ρ *= -0.019 (*p*-value = 0.918) for CTFPs predicted by method C.

^{(83K, pdf)}

**Additional file 6:**

Correlation between in-degree modularity and out-degree modularity. Correlation between in-degree modularity and out-degree modularity (measured as topological overlap, see the *Methods *section in the paper). Blue dots represent values derived from all TFs. Orange dots represent values derived from CTFPs only. Correlation was calculated by means of a Spearman test. Correlations for each set of CTFPs are as follows: *ρ *= -0.113 (*p*-value = 0.459) for CTFPs predicted by method N, *ρ *= -0.173 (*p*-value = 0.351) for CTFPs predicted by method B, *ρ *= -0.061 (*p*-value = 0.830) for CTFPs predicted by method T, *ρ *= -0.15 (*p*-value = 0.320) for CTFPs predicted by method C.

^{(79K, pdf)}

**Additional file 7:**

Correlation between in-degree modularity and modularity in the PIN. Correlation between in-degree modularity and modularity in the PIN (measured as topological overlap, see the *Methods *section in the paper). Blue dots represent values derived from all TFs. Orange dots represent values derived from CTFPs only. Correlation was calculated by means of a Spearman test. Correlations for each set of CTFPs are as follows: *ρ *= 0.178 (*p*-value = 0.243) for CTFPs predicted by method N, *ρ *= -0.207 (*p*-value = 0.265) for CTFPs predicted by method B, *ρ *= -0.138 (*p*-value = 0.625) for CTFPs predicted by method T, *ρ *= -0.151 (*p*-value = 0.318) for CTFPs predicted by method C.

^{(80K, pdf)}

**Additional file 8:**

Correlation between out-degree modularity and modularity in the PIN. Correlation between out-degree modularity and modularity in the PIN (measured as topological overlap, see the *Methods *section in the paper). Blue dots represent values derived from all TFs. Orange dots represent values derived from CTFPs only. Correlation was calculated by means of a Spearman test. Correlations for each set of CTFPs are as follows: *ρ *= 0.592 (*p*-value = 2·10^{-5}) for CTFPs predicted by method N, *ρ *= 0.727 (*p*-value = 0) for CTFPs predicted by method B, *ρ *= 0.68 (*p*-value = 0.005) for CTFPs predicted by method T, *ρ *= 0.43 (*p*-value = 0.003) for CTFPs predicted by method C.

^{(82K, pdf)}

**Additional file 9:**

Example of the use of topological data to score existing predictions of CTFPs. The file contains an example of the used of the observations from our study to score existing predictions of CTFPs.

^{(216K, pdf)}

**Additional file 10:**

List of CTFPs predicted by each method. The file contains a list of the CTFPs predicted by each method in two formats: YPD and gene name.

^{(75K, pdf)}

**Additional file 11:**

List of co-functional TF pairs. The file contains a tabulated list of the co-functional TF pairs used in our study.

^{(13K, tab)}

**Additional file 12:**

List of co-regulatory TF pairs. The file contains a tabulated list of the co-regulatory TF pairs used in our study.

^{(6.6K, tab)}

**Additional file 13:**

List of co-functional and co-regulatory TF pairs. The file contains a tabulated list of the co-regulatory n co-functional TF pairs used in our study.

^{(680 bytes, tab)}

## Acknowledgements

This work has been supported by grants from the Spanish Ministerio de Educación y Ciencia (MEC, BIO02005-00533, PROFIT PSE-010000-2007-1 and FIT-350300-2006-40/41/42), INFOBIOMED-NoE (IST-507585) and ANEURIST. DA acknowledges the financial support of the Juan de la Cierva program (IST-507585) of the MEC. We thank Dr Mar Albà for careful reading of the manuscript.

## References

- Miller JA, Widom J. Collaborative competition mechanism for gene activation in vivo. Mol Cell Biol. 2003;23:1623–632. doi: 10.1128/MCB.23.5.1623-1632.2003. [PMC free article] [PubMed] [Cross Ref]
- Remenyi A, Scholer HR, Wilmanns M. Combinatorial control of gene expression. Nat Struct Mol Biol. 2004;11:812–5. doi: 10.1038/nsmb820. [PubMed] [Cross Ref]
- Kato M, Hata N, Banerjee N, Futcher B, Zhang MQ. Identifying combinatorial regulation of transcription factors and binding motifs. Genome Biol. 2004;8:R56. doi: 10.1186/gb-2004-5-8-r56. [PMC free article] [PubMed] [Cross Ref]
- Britten RJ, Davidson EH. Gene regulation for higher cells: a theory. Science. 1969;165:349–57. doi: 10.1126/science.165.3891.349. [PubMed] [Cross Ref]
- Chen L, Glover JN, Hogan PG, Rao A, Harrison SC. Structure of the DNA-binding domains from NFAT, Fos and Jun bound specifically to DNA. Nature. 1998;392:42–8. doi: 10.1038/32100. [PubMed] [Cross Ref]
- Courey AJ. Cooperativity in transcriptional control. Curr Biol. 2001;11:R250–2. doi: 10.1016/S0960-9822(01)00130-0. [PubMed] [Cross Ref]
- Newman JR, Keating AE. Comprehensive identification of human bZIP interactions with coiled-coil arrays. Science. 2003;300:2097–101. doi: 10.1126/science.1084648. [PubMed] [Cross Ref]
- Tan S, Richmond TJ. Eukaryotic transcription factors. Curr Opin Struct Biol. 1998;8:41–8. doi: 10.1016/S0959-440X(98)80008-0. [PubMed] [Cross Ref]
- Harbison CT, Gordon DB, Lee TI, Rinaldi NJ, Macisaac KD, Danford TW, Hannett NM, Tagne JB, Reynolds DB, Yoo J, Jennings EG, Zeitlinger J, Pokholok DK, Kellis M, Rolfe PA, Takusagawa KT, Lander ES, Gifford DK, Fraenkel E, Young RA. Transcriptional regulatory code of a eukaryotic genome. Nature. 2004;431:99–104. doi: 10.1038/nature02800. [PMC free article] [PubMed] [Cross Ref]
- Levine M, Tjian R. Transcription regulation and animal diversity. Nature. 2003;424:147–51. doi: 10.1038/nature01763. [PubMed] [Cross Ref]
- Davidson EH. Genomic regulatory systems: development and evolution. San Diego, CA, USA: Academic Press; 2001.
- Ptashne M, Gann A. Genes and signals. Cold Spring Harbor, NY: Cold Spring Harbor Laboratory Press; 2001.
- Ptashne M. Regulated recruitment and cooperativity in the design of biological regulatory systems. Philos Transact A Math Phys Eng Sci. 2003;361:1223–34. doi: 10.1098/rsta.2003.1195. [PubMed] [Cross Ref]
- Cokus S, Rose S, Haynor D, Gronbech-Jensen N, Pellegrini M. Modelling the network of cell cycle transcription factors in the yeast
*Saccharomyces cerevisiae*. BMC Bioinformatics. 2006;7:381. doi: 10.1186/1471-2105-7-381. [PMC free article] [PubMed] [Cross Ref] - Carey M. The enhanceosome and transcriptional synergy. Cell. 1998;92:5–8. doi: 10.1016/S0092-8674(00)80893-4. [PubMed] [Cross Ref]
- Pilpel Y, Sudarsanam P, Church GM. Identifying regulatory networks by combinatorial analysis of promoter elements. Nat Genet. 2001;29:153–9. doi: 10.1038/ng724. [PubMed] [Cross Ref]
- Mika S, Rost B. Protein-protein interactions more conserved within species than across species. PLoS Comput Biol. 2006;2:e79. doi: 10.1371/journal.pcbi.0020079. [PMC free article] [PubMed] [Cross Ref]
- Date SV, Marcotte EM. Discovery of uncharacterized cellular systems by genome-wide analysis of functional linkages. Nat Biotechnol. 2003;21:1055–62. doi: 10.1038/nbt861. [PubMed] [Cross Ref]
- Chen F, Mackey AJ, Vermunt JK, Roos DS. Assessing performance of orthology detection strategies applied to eukaryotic genomes. PLoS ONE. 2007;2:e383. doi: 10.1371/journal.pone.0000383. [PMC free article] [PubMed] [Cross Ref]
- Nagamine N, Kawada Y, Sakakibara Y. Identifying cooperative transcriptional regulations using protein-protein interactions. Nucleic Acids Res. 2005;33:4828–37. doi: 10.1093/nar/gki793. [PMC free article] [PubMed] [Cross Ref]
- Das D, Banerjee N, Zhang MQ. Interacting models of cooperative gene regulation. Proc Natl Acad Sci USA. 2004;101:16234–9. doi: 10.1073/pnas.0407365101. [PMC free article] [PubMed] [Cross Ref]
- Hughes TR, Marton MJ, Jones AR, Roberts CJ, Stoughton R, Armour CD, Bennett HA, Coffey E, Dai H, He YD, Kidd MJ, King AM, Meyer MR, Slade D, Lum PY, Stepaniants SB, Shoemaker DD, Gachotte D, Chakraburtty K, Simon J, Bard M, Friend SH. Functional discovery via a compendium of expression profiles. Cell. 2000;102:109–126. doi: 10.1016/S0092-8674(00)00015-5. [PubMed] [Cross Ref]
- Lee TI, Rinaldi NJ, Robert F, Odom DT, Bar-Joseph Z, Gerber GK, Hannett NM, Harbison CT, Thompson CM, Simon I, Zeitlinger J, Jennings EG, Murray HL, Gordon DB, Ren B, Wyrick JJ, Tagne JB, Volkert TL, Fraenkel E, Gifford DK, Young RA. Transcriptional regulatory networks in
*Saccharomyces cerevisiae*. Science. 2002;298:799–804. doi: 10.1126/science.1075090. [PubMed] [Cross Ref] - Watts DJ, Strogatz SH. Collective dynamics of 'small-world' networks. Nature. 1998;393:440–2. doi: 10.1038/30918. [PubMed] [Cross Ref]
- Barabasi AL, Albert R. Emergence of scaling in random networks. Science. 1999;286:509–12. doi: 10.1126/science.286.5439.509. [PubMed] [Cross Ref]
- Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabasi AL. Hierarchical organization of modularity in metabolic networks. Science. 2002;297:1551–5. doi: 10.1126/science.1073374. [PubMed] [Cross Ref]
- 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 protein-protein interaction network. Nature. 2004;430:88–93. doi: 10.1038/nature02555. [PubMed] [Cross Ref]
- Yip AM, Horvath S. Gene network interconnectedness and the generalized topological overlap measure. BMC Bioinformatics. 2007;8:22. doi: 10.1186/1471-2105-8-22. [PMC free article] [PubMed] [Cross Ref]
- Carlson JM, Chakravarty A, Khetani RS, Gross RH. Bounded search for de novo identification of degenerate cis-regulatory elements. BMC Bioinformatics. 2006;7:254. doi: 10.1186/1471-2105-7-254. [PMC free article] [PubMed] [Cross Ref]
- Huynen MA, Snel B, von Mering C, Bork P. Function prediction and protein networks. Curr Opin Cell Biol. 2003;15:191–8. doi: 10.1016/S0955-0674(03)00009-7. [PubMed] [Cross Ref]
- Mewes HW, Albermann K, Bähr M, Frishman D, Gleissner A, Hani J, Heumann K, Kleine K, Maierl A, Oliver SG, Pfeiffer F, Zollner A. Overview of the yeast genome. Nature. 1997;387:7–65. doi: 10.1038/42755. [PubMed] [Cross Ref]
- Schwikowski B, Uetz P, Fields S. A network of protein-protein interactions in yeast. Nat Biotechnol. 2000;18:1257–1261. doi: 10.1038/82360. [PubMed] [Cross Ref]
- Allocco DJ, Kohane IS, Butte AJ. Quantifying the relationship between co-expression, co-regulation and gene function. BMC Bioinformatics. 2004;5:18. doi: 10.1186/1471-2105-5-18. [PMC free article] [PubMed] [Cross Ref]
- Ihmels J, Friedlander G, Bergmann S, Sarig O, Ziv Y, Barkai N. Revealing modular organization in the yeast transcriptional network. Nat Genet. 2002;31:370–7. [PubMed]
- Bar-Joseph Z, Gerber GK, Lee TI, Rinaldi NJ, Yoo JY, Robert F, Gordon DB, Fraenkel E, Jaakkola TS, Young RA, Gifford DK. Computational discovery of gene modules and regulatory networks. Nat Biotechnol. 2003;21:1337–42. doi: 10.1038/nbt890. [PubMed] [Cross Ref]
- Luscombe NM, Babu MM, Yu H, Snyder M, Teichmann SA, Gerstein M. Genomic analysis of regulatory network dynamics reveals large topological changes. Nature. 2004;431:308–1. doi: 10.1038/nature02782. [PubMed] [Cross Ref]
- Babu MM, Luscombe NM, Aravind L, Gerstein M, Teichmann SA. Structure and evolution of transcriptional regulatory networks. Curr Opin Struct Biol. 2004;14:283–91. doi: 10.1016/j.sbi.2004.05.004. [PubMed] [Cross Ref]
- Scott MS, Perkins T, Bunnell S, Pepin F, Thomas DY, Hallett M. Identifying regulatory subnetworks for a set of genes. Mol Cell Proteomics. 2005;4:683–92. doi: 10.1074/mcp.M400110-MCP200. [PubMed] [Cross Ref]
- Birnbaum K, Benfey PN, Shasha DE. cis element/transcription factor analysis (cis/TF): a method for discovering transcription factor/cis element relationships. Genome Res. 2001;11:1567–73. doi: 10.1101/gr.158301. [PMC free article] [PubMed] [Cross Ref]
- Simon I, Barnett J, Hannett N, Harbison CT, Rinaldi NJ, Volkert TL, Wyrick JJ, Zeitlinger J, Gifford DK, Jaakkola TS, Young RA. Serial regulation of transcriptional regulators in the yeast cell cycle. Cell. 2001;106:697–708. doi: 10.1016/S0092-8674(01)00494-9. [PubMed] [Cross Ref]
- Gavin AC, Aloy P, Grandi P, Krause R, Boesche M, Marzioch M, Rau C, Jensen LJ, Bastuck S, Dumpelfeld B, Edelmann A, Heurtier MA, Hoffman V, Hoefert C, Klein K, Hudak M, Michon AM, Schelder M, Schirle M, Remor M, Rudi T, Hooper S, Bauer A, Bouwmeester T, Casari G, Drewes G, Neubauer G, Rick JM, Kuster B, Bork P, Russell RB, Superti-Furga G. Proteome survey reveals modularity of the yeast cell machinery. Nature. 2006;440:631–6. doi: 10.1038/nature04532. [PubMed] [Cross Ref]
- Pirkkala L, Nykanen P, Sistonen L. Roles of the heat shock transcription factors in regulation of the heat shock response and beyond. FASEB J. 2001;15:1118–31. doi: 10.1096/fj00-0294rev. [PubMed] [Cross Ref]
- Koranda M, Schleiffer A, Endler L, Ammerer G. Forkhead-like transcription factors recruit Ndd1 to the chromatin of G2/M-specific promoters. Nature. 2000;406:94–98. doi: 10.1038/35017589. [PubMed] [Cross Ref]
- Cosma MP, Tanaka T, Nasmyth K. Ordered recruitment of transcription and chromatin remodeling factors to a cell cycle- and developmentally regulated promoter. Cell. 1999;97:299–311. doi: 10.1016/S0092-8674(00)80740-0. [PubMed] [Cross Ref]
- Wyrick JJ, Young RA. Deciphering gene expression regulatory networks. Curr Opin Genet Dev. 2002;12:130–136. doi: 10.1016/S0959-437X(02)00277-0. [PubMed] [Cross Ref]
- Banerjee N, Zhang MQ. Identifying cooperativity among transcription factors controlling the cell cycle in yeast. Nucleic Acids Res. 2003;31:7024–31. doi: 10.1093/nar/gkg894. [PMC free article] [PubMed] [Cross Ref]
- Chang YH, Wang YC, Chen BS. Identification of transcription factor cooperativity via stochastic system model. Bioinformatics. 2006;22:2276–82. doi: 10.1093/bioinformatics/btl380. [PubMed] [Cross Ref]
- Tsai HK, Lu HH, Li WH. Statistical methods for identifying yeast cell cycle transcription factors. Proc Natl Acad Sci USA. 2005;102:13532–7. doi: 10.1073/pnas.0505874102. [PMC free article] [PubMed] [Cross Ref]
- Spellman PT, Sherlock G, Zhang MQ, Iyer VR, Anders K, Eisen MB, Brown PO, Botstein D, Futcher B. Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization. Mol Biol Cell. 1998;9:3273–97. [PMC free article] [PubMed]
- Sneath PH, Sokel SS. Numerical Taxonomy. San Francisco: W. H. Freeman; 1973.
- Beyer A, Workman C, Hollunder J, Radke D, Moller U, Wilhelm T, Ideker T. Integrated assessment and prediction of transcription factor binding. PLoS Comput Biol. 2006;2:e70. doi: 10.1371/journal.pcbi.0020070. [PMC free article] [PubMed] [Cross Ref]
- Ruepp A, Zollner A, Maier D, Albermann K, Hani J, Mokrejs M, Tetko I, Guldener U, Mannhaupt G, Munsterkotter M, Mewes HW. The FunCat, a functional annotation scheme for systematic classification of proteins from whole genomes. Nucleic Acids Res. 2004;32:5539–45. doi: 10.1093/nar/gkh894. [PMC free article] [PubMed] [Cross Ref]
- Kerrien S, Alam-Faruque Y, Aranda B, Bancarz I, Bridge A, Derow C, Dimmer E, Feuermann M, Friedrichsen A, Huntley R, Kohler C, Khadake J, Leroy C, Liban A, Lieftink C, Montecchi-Palazzi L, Orchard S, Risse J, Robbe K, Roechert B, Thorneycroft D, Zhang Y, Apweiler R, Hermjakob H. IntAct–open source resource for molecular interaction data. Nucleic Acids Res. 2007;35:D561–5. doi: 10.1093/nar/gkl958. [PMC free article] [PubMed] [Cross Ref]
- Chatr-aryamontri A, Ceol A, Palazzi LM, Nardelli G, Schneider MV, Castagnoli L, Cesareni G. MINT: the Molecular INTeraction database. Nucleic Acids Res. 2007;35:D572–4. doi: 10.1093/nar/gkl950. [PMC free article] [PubMed] [Cross Ref]
- Alfarano C, Andrade CE, Anthony K, Bahroos N, Bajec M, Bantoft K, Betel D, Bobechko B, Boutilier K, Burgess E, Buzadzija K, Cavero R, D'Abreo C, Donaldson I, Dorairajoo D, Dumontier MJ, Dumontier MR, Earles V, Farrall R, Feldman H, Garderman E, Gong Y, Gonzaga R, Grytsan V, Gryz E, Gu V, Haldorsen E, Halupa A, Haw R, Hrvojic A, Hurrell L, Isserlin R, Jack F, Juma F, Khan A, Kon T, Konopinsky S, Le V, Lee E, Ling S, Magidin M, Moniakis J, Montojo J, Moore S, Muskat B, Ng I, Paraiso JP, Parker B, Pintilie G, Pirone R, Salama JJ, Sgro S, Shan T, Shu Y, Siew J, Skinner D, Snyder K, Stasiuk R, Strumpf D, Tuekam B, Tao S, Wang Z, White M, Willis R, Wolting C, Wong S, Wrong A, Xin C, Yao R, Yates B, Zhang S, Zheng K, Pawson T, Ouellette BF, Hogue CW. The Biomolecular Interaction Network Database and related tools 2005 update. Nucleic Acids Res. 2005;33:D418–24. doi: 10.1093/nar/gki051. [PMC free article] [PubMed] [Cross Ref]
- Salwinski L, Miller CS, Smith AJ, Pettit FK, Bowie JU, Eisenberg D. The Database of Interacting Proteins: 2004 update. Nucleic Acids Res. 2004;32:D449–51. doi: 10.1093/nar/gkh086. [PMC free article] [PubMed] [Cross Ref]
- Aragues R, Jaeggi D, Oliva B. PIANA: protein interactions and network analysis. Bioinformatics. 2006;22:1015–7. doi: 10.1093/bioinformatics/btl072. [PubMed] [Cross Ref]
- http://networkx.lanl.gov
- Balaji S, Babu MM, Iyer LM, Luscombe NM, Aravind L. Comprehensive analysis of combinatorial regulation using the transcriptional regulatory network of yeast. J Mol Biol. 2006;360:213–27. doi: 10.1016/j.jmb.2006.04.029. [PubMed] [Cross Ref]
- R Team . R: A Language and Environment for Statistical Computing. Vienna, Austria: R Foundation for Statistical Computing; 2006.

**BioMed Central**

## Formats:

- Article |
- PubReader |
- ePub (beta) |
- PDF (377K) |
- Citation

- Identifying cooperativity among transcription factors controlling the cell cycle in yeast.[Nucleic Acids Res. 2003]
*Banerjee N, Zhang MQ.**Nucleic Acids Res. 2003 Dec 1; 31(23):7024-31.* - AVID: an integrative framework for discovering functional relationships among proteins.[BMC Bioinformatics. 2005]
*Jiang T, Keating AE.**BMC Bioinformatics. 2005 Jun 1; 6:136. Epub 2005 Jun 1.* - Transcriptional regulatory networks in Saccharomyces cerevisiae.[Science. 2002]
*Lee TI, Rinaldi NJ, Robert F, Odom DT, Bar-Joseph Z, Gerber GK, Hannett NM, Harbison CT, Thompson CM, Simon I, et al.**Science. 2002 Oct 25; 298(5594):799-804.* - Transcriptional networks: reverse-engineering gene regulation on a global scale.[Curr Opin Microbiol. 2004]
*Chua G, Robinson MD, Morris Q, Hughes TR.**Curr Opin Microbiol. 2004 Dec; 7(6):638-46.* - Prediction and integration of regulatory and protein-protein interactions.[Methods Mol Biol. 2009]
*Wichadakul D, McDermott J, Samudrala R.**Methods Mol Biol. 2009; 541:101-43.*

- Identifying transcription factor complexes and their roles[Bioinformatics. 2014]
*Will T, Helms V.**Bioinformatics. 2014 Sep 1; 30(17)i415-i421* - A novel unbiased measure for motif co-occurrence predicts combinatorial regulation of transcription[BMC Genomics. ]
*Vandenbon A, Kumagai Y, Akira S, Standley DM.**BMC Genomics. 13(Suppl 7)S11* - Functional and topological characterization of transcriptional cooperativity in yeast[BMC Research Notes. ]
*Aguilar D, Oliva B.**BMC Research Notes. 5227* - Biana: a software framework for compiling biological interactions and analyzing networks[BMC Bioinformatics. ]
*Garcia-Garcia J, Guney E, Aragues R, Planas-Iglesias J, Oliva B.**BMC Bioinformatics. 1156* - Inference of sparse combinatorial-control networks from gene-expression data: a message passing approach[BMC Bioinformatics. ]
*Bailly-Bechet M, Braunstein A, Pagnani A, Weigt M, Zecchina R.**BMC Bioinformatics. 11355*

- PubMedPubMedPubMed citations for these articles
- TaxonomyTaxonomyRelated taxonomy entry
- Taxonomy TreeTaxonomy Tree

- Topological comparison of methods for predicting transcriptional cooperativity i...Topological comparison of methods for predicting transcriptional cooperativity in yeastBMC Genomics. 2008; 9()137

Your browsing activity is empty.

Activity recording is turned off.

See more...