Volume 17 Supplement 10
Evolution of transcriptional networks in yeast: alternative teams of transcriptional factors for different species
© The Author(s) 2016
Published: 11 November 2016
The diversity in eukaryotic life reflects a diversity in regulatory pathways. Nocedal and Johnson argue that the rewiring of gene regulatory networks is a major force for the diversity of life, that changes in regulation can create new species.
We have created a method (based on our new “ping-pong algorithm) for detecting more complicated rewirings, where several transcription factors can substitute for one or more transcription factors in the regulation of a family of co-regulated genes. An example is illustrative. A rewiring has been reported by Hogues et al. that RAP1 in Saccharomyces cerevisiae substitutes for TBF1/CBF1 in Candida albicans for ribosomal RP genes. There one transcription factor substitutes for another on some collection of genes. Such a substitution is referred to as a “rewiring”. We agree with this finding of rewiring as far as it goes but the situation is more complicated. Many transcription factors can regulate a gene and our algorithm finds that in this example a “team” (or collection) of three transcription factors including RAP1 substitutes for TBF1 for 19 genes. The switch occurs for a branch of the phylogenetic tree containing 10 species (including Saccharomyces cerevisiae), while the remaining 13 species (Candida albicans) are regulated by TBF1.
To gain insight into more general evolutionary mechanisms, we have created a mathematical algorithm that finds such general switching events and we prove that it converges. Of course any such computational discovery should be validated in the biological tests. For each branch of the phylogenetic tree and each gene module, our algorithm finds a sub-group of co-regulated genes and a team of transcription factors that substitutes for another team of transcription factors. In most cases the signal will be small but in some cases we find a strong signal of switching. We report our findings for 23 Ascomycota fungi species.
KeywordsTranscription factor Rewiring Evolution Regulation Transcriptional networks Yeast Ascomycota
In this paper we are interested in Scenario 2. Hogues et al.  report an example of scenario (2) change in regulation, namely that in Saccharomyces cerevisiae the transcription factor RAP1 regulates ribosomal RP genes, while in the same conditions in Candida albicans the regulation of the same ribosomal RP genes is done by the transcription factor TBF1 (and sometimes also CBF1). There one transcription factor for certain species is replaced by another transcription factor for different species, carrying out the regulation of the same collection of genes. In order for a collection of related genes to preserve their function, we must expect change in transcription factors to be carried out for a collection of genes. Additional such cases have been documented for yeast genes involved in mating  and in galactose metabolism [4, 5]. See also cases discussed in  and references therein.
Scenario (2) can also be discussed in terms of “motifs”. A motif is a short segment in the DNA sequence, between 6–20 nucleotide pairs, usually fewer than 10, that can be positioned at different locations within the regulatory region of a gene . Tanay et al.  focus on identifying motifs that are “enriched”, i.e., the motif occurs in multiple species, controlling analogous regulons in those species.
Sarda and Hannenhalli  present a method for detecting rewiring, switching one transcription factor to another transcription factor in the same 23 yeast species we investigate.
Nocedal and Johnson  analyze more complex cases of transcription factor rewiring in yeast and concludes that future research is needed to understand transcription factor rewiring in regulatory networks that involve multiple transcription factors and larger regulons. They also say that it is important to consider evolution in the study of transcription factor rewiring. For us that means considering how regulation in a branch differs from the regulation in the other species of the tree. Our algorithm automatically finds a collection of genes for which switching occurs.
What our method does While it has been demonstrated that one transcription factor can be replaced by another (e.g., ), our algorithm looks for larger scale replacements. We present the first computational method that finds a regulon (denoted G) and two teams of transcription factors (denoted T and T ∗) for which there has been rewiring over evolutionary time for a specified branch M of the phylogenetic tree.
We use 53 evolutionarily conserved co-expression modules detected in  based on S. cerevisiae and C. albicans. Additional file 1: Our supplementary material lists the genes in each module (those modules for which there was a full set of orthologs for all the species). Some modules are contained in larger modules. The number of genes in each S. cerevisiae module ranged from 1 to 614 with an average of 54 and a total of 2840 genes for all the S. cerevisiae modules. We study the 23 Ascomycota fungi species with an established phylogenetic tree from  shown in Fig. 1. Our yeast species includes Saccharomyces cerevisiae, Candida albicans and Ashbya gossypii. All 23 yeast species names are provided in Additional file 2: Supplementary material.
We used the orthology mapping of corresponding genes across the 23 yeast species from . In some cases there is no gene for a given species, but we chose genes that had the representatives (or orthologs) in all or almost all of the species. “Orthologs” are genes in related species that have similar nucleotide sequences, suggesting they came from the same ancestral gene by speciation. When a gene has multiple copies in one species, we pick one copy at random, resulting in 2557 genes of S. cerevisiae – plus the orthologous genes across the other 22 Ascomycota species.
This paper is based on our calculation and analysis of transcription factor binding probabilities, the computed probability that a transcription factor binds somewhere in the 600-base region preceding a gene of one of our species (we obtained those regions from ). We refer to that region as the “upstream promoter region”. The set of 126 yeast transcription-factor-DNA binding-motifs (represented as Positional Weight Matrices (PWM)) was obtained from Transfac DB Database [12, 13]. While there are many factors determining whether a gene is activated or deactivated, it seems likely to be significant if the probability of a transcription factor is high for a branch of the phylogenetic tree and lower for the remaining species, or vice versa. We computed a binding probability for each of 126 transcription factors binding to each of 2557 genes in each of 23 Ascomycota species for a total of approximately 126×2557×23 probabilities, i.e., approximately 7 million probabilities (provided in Additional file 3: Supplementary material). Each of the genes that we selected was present in S. cerevisiae. We used the same 23 Ascomycota fungi and phylogeny , and our set of 126 transcription factors includes most of the 88 transcription factors that  uses, so we safely use 126 transcription factor binding motifs associated to S. cerevisiae and applied them to the other yeast species as  has demonstrated that most transcription factors have conserved their DNA motifs over large evolutionary distances.
Our skewness method
For each species, gene, and transcription factor, we examine the “binding probability”, the probability that the transcription factor binds to the upstream promoter region of the gene.
If a particular branch of the phylogenetic tree has been selected, we say a transcription factor-gene pair is (positively) skewed toward that branch if the binding probabilities are on the average higher for species in that branch than for the species in the complement. Later we will define our function skew that measures how much it is skewed; (see Eq. 3). We say the pair is negatively skewed toward a branch if the reverse is true, that the binding probabilities are lower for the branch than in the complement. We usually average the skewness of a transcription factor over a collection of genes.
Computing skewness We pick a group M of species representing some branch of species in the phylogenetic tree in Fig. 1 (e.g., species 1−10). We use M ⋆ to designate the remaining species, 11−23 in this case. Hence M defines a branch (or partition) of species in the tree.
All calculations use some choice of M but we often omit mention of M and M ⋆ to simplify the notation.
For a collection of genes G we say a transcription factor is skewed towards M if it binds more strongly (averaging over the genes in G) for species in M than for species in M ⋆, and similarly it is skewed towards M ⋆ if the reverse holds. We aim at finding a branch and some related genes G in some module R and two collection of transcription factors that we denote T and T ⋆ so that on the average, transcription factors in T are skewed towards M for genes in G, while transcription factors in T ⋆ are skewed towards species in M ⋆.
To make that precise, we define the skewness, a measure of the difference in the average binding probabilities between M and M ⋆. Specifically, for a given branch M (with complement M ⋆) and each transcription factor x and each gene g, we compute the skewness skew(x,g,M) as follows in Eq. 4. We write 〈… 〉 for an average. We note that the average binding probability is computed by averaging over those species that have an ortholog of g; we exclude those species that do not have an orthologous gene from the average. All of the following depend on the choice of M. First we define P x,g,s = the binding (or occupancy) probability for transcription factor x to bind to the promoter of gene g in species s. (See Additional file 4: Supplementary methods, Section: Estimating transcription factor binding probabilities). We will use “ ∗” to indicate M ∗, the complement of M is being used in a calculation.
Here “skew” measures how much x is skewed towards M for g. It is greater than 0 if x is skewed towards M and is less than 0 if x is skewed towards M ⋆.
Finding max blocks
# T ⋆:#T
is large. In the cases we care about, skew(T,G)>0 and skew(T ⋆,G)<0.
Blocks and substitution-maximizing blocks
We define a block denoted (T,T ∗,G) to be two groups or teams T and T ∗ of transcription factors and a group G of genes. We say there is a rewiring for a branch M of the tree when transcription factors in T are positively skewed for species in M for the genes in G while the transcription factors in T ∗ are negatively skewed.
We define a “substitution-maximizing block” or more simply a max block to be a block which has the property that if we substitute any gene for one of the genes in G, or any transcription factor for one of the transcription factors in the teams, then the skewness cannot not increase. But discarding a low scoring gene or transcription factor would raise the score of the block. Indeed the blocks with the highest scores are those that that have exactly one gene and one transcription factor in each of T and T ∗.
Finding max blocks by enumerating subsets is clearly out of the question, since we are dealing with candidate sets that may have dozens of genes and dozens of transcription factors.
We can refer to a block (T,T ∗,G) as an (m,m ∗,m G )-block when m,m ∗, and m G are the numbers of elements in T,T ∗, and G respectively.
For any starting collection G 0 of m G genes, the ping-pong algorithm finds some sets T and T ∗ and eventually a max block (T,T ∗,G) by repeatedly making substitutions in the elements of T,T ∗, and G that increase the score skew(T,T ∗,G); and since only substitutions are made, the numbers of elements in T,T ∗, and G remain m,m ∗, and m G respectively. A gene or transcription factor that is eliminated from one of the sets at one stage may later return after the mix of genes and transcription factors has changed.
A sequence of ever-shrinking max blocks
Next one of the numbers m,m ∗, and m G is decreased by 1: the discussion of “importance” below describes which of these is decreased. This decrementing process continues, yielding a sequence of max blocks whose total m+m ∗+m G decreases in steps of 1. When the process is stopped depends on the needs of the user. As discussed below, here we chose to stop when the importance (a ratio) reaches 0.5.
Our Ping-Pong Algorithm that yields a max block
In the game of ping-pong, the ball goes back and forth between the two sides. Here the block goes back and forth between two steps. The ping-pong algorithm consists of alternating between steps TF and G below repeatedly with skew(T,T ∗,G) increasing at each step until the process stops in the sense that skew reaches an equilibium, a max block.
A key point is that T and T∗ are generated from G without knowledge of previous versions of T and T∗. Similarly G is generated purely from T and T∗ without reference to any previous versions of G.
The ping-pong algorithm requires three positive integers, m,m ∗,m G and a set G of m G genes in a regulon R. The first time the ping-pong algorithm is applied, m G is the number of genes in the Module R and m+m ∗ is the total number of transcription factors. At least one of these three numbers will decrease during the attrition step described below.
Step TF: choosing transcription factors T and T ∗
Given a set G of genes, we compute the skew(x,G) scores of every transcription factor x and let the new T be the m highest scoring transcription factors and let T ∗ be the m ∗ lowest scoring transcription factors. Since skew(T,G) is the average of skew(x,G) for x in T, it follows that skew(T,G) is increased (or equal) by this new T. Similarly −skew(T ∗,G) is increased by the new choice of T ∗ and so is skew(T,T ∗,G).
Step G. choosing G
Next compute that term for each gene g in R and we set the new G to be the m G highest scoring genes in R. That increases (or possibly makes no change) in skew(T,T ∗,G).
Lemma: Steps G and TF never decrease the skew score.
In the above transcription factor step the algorithm is supposed to select the highest m scoring transcription factors for T, but for some choices of G there are fewer than m that have positive scores, or similarly with T ∗ there can be too few with negative scores. In such cases we terminate the ping-pong run. There are ways around this as long as there are some transcription factors with positive scores and others with negative scores: just decrease m or m ∗ as needed, but our goal was to present the algorithm in its simplest form. It is also possible to encounter sets of genes G for which there are no transcription factors with positive scores or none with negative scores.
Ping-pong stops at a max block
After applying this algorithm repeatedly, there will be no substitution of a single transcription factor or a single gene that would increase skew(T,T ∗,G) so that T,T ∗,G is a max block.
The algorithm alternates back and forth between the two steps repeatedly, letting T and T ∗ determine the set of genes G, and then letting G determine transcription factor teams T and T ∗. Each step increases the overall score skew(T,T ∗,G) until it stops at a max block: the only changes in the sets are those that increase the overall score. Since there are only a finite number of choices, the procedure must eventually stop at a max block, where the G that is used in step G is the G that is produced in the TF step.
Input: (all_Gs,G 0,all_TFs,m,m ⋆,mG): all_Gs is the set of all genes in some module R; G 0 is an initial gene set of mG genes; all_TFs is the set of all transcription factors; m,m ⋆,mG remain constant; and m,m ⋆ are the numbers of transcription factors in team T and T ⋆ and mG is the number of genes
Compute Step TF: Choose transcription factor teams T and T ∗
Compute Step G. Choose genes G
while new_score>score: (score is increasing)
return G, T, T ⋆, score
Stopping condition: Neither Step G nor Step TF ever decreases the skew score, so it must reach an equillibrium
The attrition step
For each x in T we define the “importance” of x to be the ratio of skew(x,G) divided by the highest score of the transcription factors in T; similarly for each y in T ∗, the “importance” of y is the ratio of skew(y,G) divided by the lowest score of the transcription factors; and for each g in G, the “importance” of g is the ratio of skew(T,T ∗,g) divided by the highest score in G. We now compare all of the importance scores and delete the one with the lowest score. In other words, we decrease by 1 one of the m,m ∗,m G . That increases the overall skew score. Now again we play ping-pong with the new reduced numbers, starting the game with our current G, possibly reduced by one gene.
As we proceed decreasing the numbers, we may lose some transcription factor or gene that later becomes more important to a reduced set of genes and transcription factors and so it enters back in. That is why we choose new teams from all transcription factors, not just the ones that were included on the last step, and the same holds for genes, using any genes in the specified regulon. We compute binding probabilities with 8 digit precision to avoid having tie scores, but if there is a tie score and one transcription factor or gene must be chosen, we retain the one(s) that comes first alphabetically.
When should attrition stop?
When we start, it is likely that some skew scores will be near 0, much smaller than other skew scores, so their importance will be near 0. The scientist who wishes to find many involved interacting genes and transcription factors might stop when the importance has risen to 0.25 (meaning that all the importance scores lie between 0.25 and 1.0). The experimentalist might wish to deal with fewer transcription factors and genes and so might stop at 0.75. In this paper and in the Additional file 5: Supplementary material we stopped when the importance reached 0.5.
We have examined the 12 largest branches of the species tree for each of the above mentioned modules using this approach. We indicated the branches with a slash and labeled them with a number as shown on Fig. 1. We determined a “max block” for each module and branch. For some, we found strong indications of rewiring.
Transcription factor rewiring for Module-51 genes Module 51 (see Fig. 2) consists of Ribosomal Protein (RP) genes exclusively. In the Introduction we noted that  reported that one transcription factor substitutes for another on some collection of genes in two species, namely Rap1 in Saccharomyces cerevisiae substitutes for TBF1 in Candida albicans for ribosomal RP genes. We find for a branch of 10 species, RAP1, FHL1, and SFP1 substitute for TBF1. Indeed we find that their skewness scores are similar: skew(Tbf1,Rap1,G)=0.777;skew(Tbf1,Fhl1,G)=0.713;skew(Tbf1,Sfp1,G)=0.711, where our algorithm finds the regulon G consists of 19 of the 31 RP genes in Module 51. See the Additional file 5: Supplementary material for a list of the 19 genes and other detailed information about the most significant block that was found for each module. Note that FHL1 is mentioned in  as a “a key player” in the regulation of RP genes in S. cerevisiae. We find it is involved in rewiring, according to our calculations.
What is striking is that in 13 of the 19 species in M ⋆ transcription factor MATA1 (red dots) has binding probabilities near 0, (though in two M ⋆ species it is high). In contrast in the branch M, it is higher than the T ⋆ team (blue dots, consisting of 9 transcription factors.
Transcription factor rewiring for the Module-55 gene YMR290C Module 55 consists of a conserved, co-expressed gene related to the biological function ribosomal subunit assembly.
Here in Fig. 5 if the tree is cut at the top, separating the left branch of 20 species from the right-most branch of 3, it is arbitrary as to which of the two branches is called M and we have called it the left branch. What we see is that in the three species of M ⋆, the two transcription factors of the T ⋆ team (blue dots) very clearly dominates the 33 transcription factors of the T team for the 3 genes in the block. In contrast on the left side, the binding probabilities of the two teams are much closer, apparently all active. So the apparent switching behavior here is that the M ⋆ clearly dominates M on the right, while on the left all the transcription factors interact at similar levels (remembering that each dot is only an average).
Our method can address questions such as the following: Can different groups of genes in related species be regulated by the same group or “team” of transcription factors (as in Scenario 1)? Another question: Can a team of transcription factors become dominant for a collection of related genes in a tree branch while a second team is dominant on the other species (as in Scenario 2)? In this paper we focus in Scenario 2.
Our approach differs from that of Sarda and Hannenhalli  in that we define our skewness for each transcription factor while they define a function that compares the skewness of two transcription factors. They require more computation than our approach since they must make a complex computation of rewiring scores for each pair of transcription factors. We use extensive computation instead to look for more complicated situations where there can be several transcription factors that switch with one or more transcription factors. That is we find collections or teams of transcription factors which are positively skewed, averaging over the genes in a regulon, and for those transcription factors which are negatively skewed. We vary the selection of genes in the regulon and the teams of positively skewed transcription factors and the teams of negatively skewed transcription factors.
One of our colleagues, Chris Dock, tested a module (#2) of 40 genes. He picked G 0 to have 36 randomly selected genes, and repeated this process 100 times. The process always arrived at the same max block (using importance = 0.5). That suggests the process is robust, but does not guarantee a unique result.
A module consists of related genes and one can imagine simplistically that the module represents a process with just two stages; first one set of genes is activated, and later another set. If there is rewiring, each might have its own max block, the union of which might be the max block that the above process finds. These can be found by using a modified approach, where instead of starting with a large set of genes and contracting it as we have described above, one can start with one gene and expand the collection of genes until importance 0.5 is reached. This ‘expanding“ approach would often yield a subset of the “contracting” approach and the subset would depend on the initial gene. Here we chose to keep our report simple by restricting attention to the expanding max block approach which gives an overview.
Note that while T* consists of the transcription factors for which skew(x,G) is smallest (most negative), they are not necessarily all negative, and we have excluded some cases where not all x in T* had negative skew score. This was an optional choice, but it seemed appropriate in view of the concept of rewiring.
Nocedal and Johnson  write “We do not yet understand how a large network, composed of many transcription regulators and hundreds or thousands of target genes, forms in the first place.” We believe that considering only cases in which one transcription factor is switched with another will be inadequate to describe the evolution of networks. They also write “A change even in the regulation of a single gene can have important consequences in modern species’.... However, most biological processes require the coordinated expression of many genes rather than a single gene” to produce a useful phenotype.
Our investigation aims at providing a new approach to thinking about the very complex idea of rewiring, freeing us from the constraint of considering only one transcription factor substituting for one transcription factor (or one gene for one gene).
All the examples in this paper discuss rewiring (Scenario 2) via one team of transcription factors substituting for another team on a collection of genes. However, it is an equivalent problem mathematically - using the same set of binding probabilities - to have one team of genes substitute for another team of genes for a collection of transcription factors (the turnover problem, Scenario 1). In an example of a Scenario 1, Habib et al.  present a method for tracing the evolutionary history of regulatory interactions of 88 regulatory DNA motifs associated with transcription factors across 23 Ascomycota fungi, (the same 23 that we study). They use their method to explain the evolution of transcription factor turnover for a collection of genes. Here the transcription factor changes which genes it regulates while preserving the function of the genes. Gasch et al.  also study changes in which regulon members that are regulated by certain transcription factors.
We further expect to be able to investigate more complicated problems with very similar ideas in which there is simultaneously a rewiring of transcription factors and a turnover of genes.
No numerical investigation such as ours can produce definitive biological results, but the fact that our first case in Table 1, top row, is similar to a well known case is promising since our results find a team of three transcription factors instead of one in the published results. Table 1 shows the 12 cases with the highest skew scores, and for the top 5 we have included figures. These seem to suggest rewiring of teams of transcription factors. Of course it is desirable to have some of these cases checked experimentally.
It may be significant that eight of the twelve cases in Table 1 involve only two branches, namely branches 4 and 112. While branch 4 includes Saccharomyces cerevisiae and relatives, branch 112 includes Candida albicans and relatives. Those species have been reported in cases of rewiring in the literature.
We believe that the understanding of the evolution of transcription networks will have to invoke teams of transcription factors and teams of genes in some essential form.
The authors would like to thank Chris Dock, S. Hannenhalli, and M. Roberts for suggestions, and we thank the referees for their many useful comments.
The publication charges for this article were supported by National Science Foundation Plant Genome Research Program Grant 1444893.
This article has been published as part of BMC Genomics Vol 17 Suppl 10, 2016: Proceedings of the 14th Annual Research in Computational Molecular Biology (RECOMB) Comparative Genomics Satellite Workshop: genomics. The full contents of the supplement are available online at https://bmcgenomics.biomedcentral.com/articles/supplements/volume-17-supplement-10.
This project was supported in part by National Research Initiative Competitive grants 2009-35205-05209 from the United States Department of Agriculture National Institute of Food and Agriculture. This research was also supported by National Institutes of Health grant R01-HG002945 and National Science Foundation Plant Genome Research Program Grant 1444893.
Availability of data and materials
The overview of the supplementary material and methods is provided in Additional file 6: Supplementary material. The database of the computed binding probabilities of 126 transcription factors to 2557 genes shared by 23 species is included in Additional file 3: Supplementary Material. Additional supporting data is included in additional files.
AM and JY formulated the problem. AM and JY developed this novel mathematical approach. AM designed this computational tool and the MySQL relational database. AM, and DSM implemented this computational tool in Matlab. AM selected and extracted the data sets from the public databases, pre-process and loaded them into our MySQL database. AM and AZ loaded the datasets into Matlab. DS prepared figures and supplementary information. AM, JY conducted the interpretation of the results. AM, JY, and AZ contributed equally to the writing of this manuscript. All authors read, revised and approved the final version of the manuscript.
The authors declare that they have no competing interests.
Consent for publication
Ethics approval and consent to participate
Open Access This article is distributed under the terms of the Creative Commons Attribution 4.0 International License(http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made. The Creative Commons Public Domain Dedication waiver(http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.
- Li H, Johnson AD. Evolution of transcription networks - Lessons from yeast. Curr Biol. 2010; 17(20):R746–R753.View ArticleGoogle Scholar
- Hogues H, Lavoie H, Sellam A, Mangos M, Roemer T, Purisima E, Nantel A, Whiteway M. Transcription factor substitution during the evolution of fungal ribosome regulation. Mol Cell. 2008; 29(5):552–62.View ArticlePubMedGoogle Scholar
- Tsong AE, Tuch BB, Li H, Johnson AD. Evolution of alternative transcriptional circuits with identical logic. Nature. 2006; 443(7110):415–420.View ArticlePubMedGoogle Scholar
- Lavoie H, Hogues H, Whiteway M. Rearrangements of the transcriptional regulatory networks of metabolic pathways in fungi. Curr Opin Microbiol. 2009; 12(6):655–63.View ArticlePubMedGoogle Scholar
- Martchenko M, Levitin A, Hogues H, Nantel A, Whiteway M. Transcriptional rewiring of fungal galactose-metabolism circuitry. Curr Biol. 2007; 17(12):1007–13.View ArticlePubMedGoogle Scholar
- Weirauch MT, Hughes TR. Conserved expression without conserved regulatory sequence: the more things change, the more they stay the same. Trends Genet. 2010; 26(2):66–74.View ArticlePubMedGoogle Scholar
- Nocedal I, Johnson AD. How Transcription Networks Evolve and Produce Biological Novelty. CSH Symposia on Quant. Bio. 2015; LXXX:1–10. doi:10.1101/sqb.2015.80.027557.Google Scholar
- Tanay A, Regev A, Shamir R. Conservation and evolvability in regulatory networks: The evolution of ribosomal regulation in yeast. PNAS. 2005; 102(20):7203–8.View ArticlePubMedPubMed CentralGoogle Scholar
- Sarda S, Hannenhalli S. High-throughput identification of Cis-regulatory rewiring events in yeast. Mol Biol Evol. 2015; 32(12):3047–63.PubMedPubMed CentralGoogle Scholar
- Field Y, Fondufe-Mittendorf Y, Moore IK, Mieczkowski P, Kaplan N, Lubling Y, Lieb JD, Widom J, Segal E. Gene expression divergence in yeast is coupled to DNA-encoded nucleosome organization. Nat Genet. 2009; 41(4):438–45.View ArticlePubMedPubMed CentralGoogle Scholar
- Wapinski I, Pfeffer A, Friedman N, Regev A. Natural history and evolutionary principles of gene duplication in fungi. Nature. 2007; 449(7158):54–61.View ArticlePubMedGoogle Scholar
- Matys V, Kel-Margoulis OV, Fricke E, Liebich I, Land S, et al.TRANSFAC and its module TRANSCompel: transcriptional gene regulation in eukaryotes. Nucleic Acids Res. 2006; 34:D108–110.View ArticlePubMedGoogle Scholar
- MacIsaac KD, Wang T, Gordon DB, Gifford DK, Stormo GD, Fraenkel E. An improved map of conserved regulatory sites for Saccharomyces cerevisiae. BMC Bioinforma. 2006; 7:113.View ArticleGoogle Scholar
- Habib N, Wapinski I, Maragalit H, Regev A, Friedman N. A functional selection model explains evolutionary robustness despite plasticity in regulatory networks. Mol Syst Biol. 2012; 619(8):1–18.Google Scholar
- Gasch AP, Moses AM, Chiang DY, Fraser HB, Berardini M, Eisen MB. Conservation and evolution of cis-regulatory systems in ascomycete fungi. PLoS Biol. 2004; 2:e398.View ArticlePubMedPubMed CentralGoogle Scholar