- About this Journal
- Abstracting and Indexing
- Aims and Scope
- Article Processing Charges
- Articles in Press
- Author Guidelines
- Bibliographic Information
- Citations to this Journal
- Contact Information
- Editorial Board
- Editorial Workflow
- Free eTOC Alerts
- Publication Ethics
- Reviewers Acknowledgment
- Submit a Manuscript
- Subscription Information
- Table of Contents
Advances in Bioinformatics
Volume 2011 (2011), Article ID 608295, 14 pages
An Integrated Framework to Model Cellular Phenotype as a Component of Biochemical Networks
1Department of Cancer Biology, Kimmel Cancer Center, Thomas Jefferson University, Bluemle Life Sciences Building, 233 S. 10th Street, Philadelphia, PA 19107, USA
2School of Biomedical Engineering, Science and Health Systems, Drexel University, 3141 Chestnut Street, Philadelphia, PA 19104, USA
3American Association for Cancer Research, Cancer Discovery, 615 Chestnut Street, Philadelphia, PA 19106, USA
Received 23 June 2011; Accepted 26 August 2011
Academic Editor: Y. Van de Peer
Copyright © 2011 Michael Gormley et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Identification of regulatory molecules in signaling pathways is critical for understanding cellular behavior. Given the complexity of the transcriptional gene network, the relationship between molecular expression and phenotype is difficult to determine using reductionist experimental methods. Computational models provide the means to characterize regulatory mechanisms and predict phenotype in the context of gene networks. Integrating gene expression data with phenotypic data in transcriptional network models enables systematic identification of critical molecules in a biological network. We developed an approach based on fuzzy logic to model cell budding in Saccharomyces cerevisiae using time series expression microarray data of the cell cycle. Cell budding is a phenotype of viable cells undergoing division. Predicted interactions between gene expression and phenotype reflected known biological relationships. Dynamic simulation analysis reproduced the behavior of the yeast cell cycle and accurately identified genes and interactions which are essential for cell viability.
Efforts to develop therapeutics for complex disorders such as cancer, infectious disease, and autoimmune disease require an understanding of the specific pathways through which networks of molecular interactions influence cellular function. Due to the complexity of biochemical pathways, a combinatorially large number of experiments that can simultaneously measure the changes in gene or protein expression such as a microarray or an LCMS-based proteomics are required in order to fully characterize normal and disease-producing mechanisms . An iterative approach, using computational biology to complement high-throughput experimentation, may increase the efficiency by which data can be gathered by eliminating redundant or irrelevant experiments and suggesting hypotheses to build optimally upon current knowledge [2–4]. Development of gene expression microarray platforms enables the collection of expression data on a genome-wide scale sufficient for the derivation of gene-gene interactions and reverse engineering of system’s scale models of gene networks [5, 6]. However, computational models of biological systems often disregard cellular phenotype data. Phenotype should be explicitly incorporated in computational gene network models to contextualize perturbations according to their effect on the desired change in cellular phenotype. This not only allows for a seamless coupling between computation and experimentation but also enables a guided search to identify molecules, complexes, and pathways that regulate disease-specific processes such as migration, proliferation, differentiation, or cell death [2, 4].
A range of methodologies have been developed to reverse engineer transcriptional networks from expression data. The choice of an appropriate modeling method is dependent on the scale of the modeled system, quality of data, and availability of prior knowledge. Dimension reduction approaches such as principal component analysis or partial least squares regression can be applied to identify correlated patterns of expression that can be viewed as abstract representations of pathways or coregulated molecules . These methods are well suited for poorly characterized systems as they are designed to operate on high-dimensional datasets and require no prior knowledge. However, it can be difficult to predict changes in cellular phenotype based on relationships observed in transformed space with reduced dimensionality. In contrast, differential equation-based models can be used to approximate highly specific spatial and temporal characteristics of gene networks . Applicability of differential equation-based methods is limited by the extensive amount of prior knowledge required, sensitivity to noisy data, and computational cost. With these constraints, modeling by the use of differential equations is confined to smaller, well-defined systems for which precise quantitative data is available. Logic-based models, such as Boolean networks and fuzzy logic, are generated by the identification of simple relationships between variables in a discretized measurement space. In this manner, logic-based models compromise specificity for computational tractability and robustness to noisy data. Identification of relevant input data and the relationship between input and output variables can be defined based on prior knowledge  or inferred in a data-driven manner [8, 9]. As such, logic-based methods can be applied to analyze biological systems that are poorly defined. Additionally, these methods provide a framework to incorporate quantitative and qualitative information such as linguistic and graphical representations of biological systems . Although the simplicity of Boolean network models is attractive, binary representation lacks the dynamic range to sufficiently model biological complexity . Of the methods described above, fuzzy logic-based approaches offer the proper balance between computational cost and biological interpretability for the specification of mechanistic transcriptional models on a genome-wide scale.
Fuzzy logic-based biological network models can be viewed as a directed graph, in which nodes represent genes, proteins, phenotypes, or other measurable variables and edges symbolize direct or indirect interactions between variables. Fuzzy models are derived by a process including fuzzification of variables, model estimation, and evaluation of the model against observed data. Fuzzification is the process by which continuous variables are converted into sets of discrete variables that describe the degree to which the values fit one or more classes . For example, gene expression values can be represented in three fuzzy sets: low, medium, and high expression. Membership functions describe the relationship from continuous to fuzzy space by transforming each value to a number in the interval . Values closer to one indicate a higher degree of membership. Membership functions can be defined arbitrarily or with the use of optimization methods . Additionally, membership functions can overlap, such that a continuous variable maps to multiple fuzzy sets. These properties reflect the subjective nature of fuzzy logic, provide robustness to noisy data, and enable intermediate activation states to be modeled . Model estimation includes the identification of network topology that describes which variables interact and specification of the nature of the relationships (i.e., activation, inhibition, etc.). This information is used to define a set of rules that map between input and output data in fuzzy space. Rules can be described linguistically as if-then relationships between variables. For example, a positive regulatory relationship between genes A and B can be described by the following rules: if expression of gene A is high, then expression of gene B is high; if expression of gene A is medium, then expression of gene B is medium; if expression of gene A is low, then expression of gene B is low. Modeling of transcriptional networks is complicated by the observation that gene expression and activation is often controlled by multiple regulatory genes. In fuzzy logic, the influence of multiple inputs can be summed to derive the state of the output variable in fuzzy space. Prior to model evaluation, predicted output values must be defuzzified from fuzzy space back to continuous space. Defuzzification functions are defined dependent on the membership functions used for fuzzification. Models can be evaluated qualitatively by comparing predicted interactions with regulatory mechanisms described in the literature and quantitatively by calculating the fit of defuzzified expression values of output nodes with observed data. Best fit models are identified by exhaustive search  or by the use of optimization schemes, such as genetic algorithms , to explore the solution space.
Evaluation of reverse engineering algorithms is facilitated by the study of model organisms in which extensive prior knowledge regarding gene regulatory and cell signaling mechanisms has been collected. Cell cycle regulation in Saccharomyces cerevisiae has been thoroughly described through the use of genetic manipulation , gene expression microarray  and computational modeling [5, 16, 17]. The goal of the present work is to extend on these ideas to infer molecular pathways or networks and then use this inference to predict cellular phenotype; this is not meant to provide a detailed biochemical computational model, and we do not suggest that this should replace any of the well-known models that include details neglected here such as posttranslational modification of proteins.
In previous work, we demonstrated the feasibility of using fuzzy logic to derive gene regulatory models from time series gene expression microarray data of twelve genes associated with cell cycle control in yeast . In this study, we have extended this framework to model gene-phenotype as well as gene-gene regulatory relationships and to represent functionally homologous genes. Towards this end, we generated a gene regulatory model consisting of seventeen cell cycle-related genes and a node representing the fraction of budding cells as a morphological indicator of cell cycle progression. Evaluation of model predictions indicated that the model accurately captures regulatory events in cell cycle progression as well as known biological relationships between genes and between genes and phenotype. Investigation of the dynamic behavior of the model enabled highly accurate identification of genes essential for cell viability as well as the prediction of indirect gene-gene interactions. The methodology developed in this study provides a proof of concept for modeling regulatory influences of gene expression on phenotype in a semiquantitative manner and supports the application of fuzzy logic-based modeling in the investigation of more complex cellular mechanisms in higher organisms.
2.1. Yeast Cell Cycle Model
A simplified model of the cell cycle in Saccharomyces cerevisiae was generated using a data-driven model generation process to identify putative gene-gene and gene-phenotype interactions on the basis of gene expression microarray time series data . The set of seventeen genes included in the model have been identified as central regulators of cell cycle progression [17, 18]: cyclins (CLN1-3, CLB1-2, CLB5-6), cyclin-dependent kinases (CDC28), transcription factors (MCM1, MBP1, Swi4, Swi5, Swi6), as well as cell cycle activating (CDC6) and inhibiting (SIC1, CDH1, CDC20) genes (Table 1). In order to describe the effect of gene expression on phenotype, we also included data describing the fraction of budding cells observed throughout the time series. Budding begins at the G1/S phase transition and continues through the end of M phase . As such, the fraction of budding cells is a morphologically observable indicator of the number of cells in a population that are actively undergoing cell division.
A fuzzy logic framework was implemented to derive regulatory relationships between genes and between genes and the fraction of budding cells from data collected at different time points throughout the cell cycle. Gene expression data used for model generation and evaluation were obtained by synchronizing cells by one of three different methods: α factor, elutriation, and CDC15-based synchronization . Data obtained from the CDC15-based synchronization method were used in this study, as this is the only dataset for which phenotype data was available. Within the fuzzy logic framework, an exhaustive search was used to identify the best fitting relationships from the set of all potential interactions (i.e., gene A interacts with gene B) and all possible fuzzy rules that relate the state of input nodes to output nodes. The coefficient of determination (COD) was used to calculate the fitness of the data generated models by comparing the predicted gene expression values or fraction of budding cells with experimentally observed measurements. High values indicate that the identified models accurately predict the magnitude of expression values over the measured time points (Table 2). Figures 1(a) and 1(b) depict the best fit models for each node and the integrated network model, respectively. Figure 2 is a plot of the observed and predicted fraction of budding cells over time derived from the best fit phenotype model. The predicted phenotype largely reproduces the observed fraction of budding cells over the time series. Exceptions to the close fit between predicted and observed phenotypes are located at time points at which the observed fraction of budding cells is minimal (e.g., 50 min, 140–170 min). Nevertheless, high correlation between predicted values and observed measurements over a majority of the time series suggest that the model built on simplified relationships in fuzzy space sufficiently captures the complex, multivariate relationships between genes and phenotype (Table 2).
A number of the genes included in the cell cycle model are known to be functionally homologous. CLN1 and CLN2, as well as CLB1/CLB2 and CLB5/CLB6, have a high degree of sequence similarity (57 percent identity ). Additionally, yeast strains with deletions of either CLN1 or CLN2 remain viable and divide normally, suggesting that these proteins are interchangeable parts in the cell cycle machinery [15, 22]. In order to accurately model redundancy, we manually replaced the nodes representing these functionally homologous genes with a node corresponding to the maximum expression value of the homologous pair. The maximum operator is a common representation of a logical union and a reasonable approximation of functionally homologous genes in the fuzzy logic framework described above. Comparison of model fitness with and without the homologous gene representation supports that this is an appropriate method to account for functional homology (see Table 1 in Supplementary Material available online at http://dx.doi.org/10.1155/2011/608295).
2.2. Dynamic Modeling of Cell Cycle Progression for In Silico Prediction of Essential Genes
Gene and phenotype-specific fuzzy models were integrated into a composite model to investigate the dynamic behavior of the system as an interdependent network (Figure 1(b)). Physiologically relevant initial conditions for each node were derived from expression values at each time point and the observed fraction of budding cells at each time point in the CDC15 dataset . The state of each node was iteratively updated based on the state of its immediate input genes and the inferred fuzzy rules describing the relationships between nodes. In effect, expression data from each time point serves as a separate set of initial conditions to investigate the dynamic behavior of the model. Iteration continued until the state of the model remained relatively constant. Figure 2 shows the predicted fraction of budding cells at each time point at convergence of the dynamic model. The model converges to two local minima corresponding with either a high or low fraction of budding cells. Notably, yeast cell cycle has been described through experimentation as an oscillation between the “alternative, self-maintaining states” of G1 and S/M phase . As cell budding is absent in G1 and maximal in S/M phase, the behavior of the model matches this hypothesis of yeast cell cycle dynamics developed from experimental investigation. In addition, the timing of the transitions between local minima is similar to the observed changes in the fraction of budding cells.
Gene knockout is a powerful method for characterization of gene function and identification of essential genes necessary for cell viability. Using the dynamic model, we predicted the identity of essential genes by fixing the state of the corresponding node to a low expression profile to simulate gene knock-out. Viability of in silico gene knockout models was determined by observing the predicted fraction of budding cells. The phenotype of viable models closely approximates the oscillatory behavior of the experimentally observed fraction of budding cells over time (Figure 2). Inviable models were identified by convergence to a constant fraction of budding cells over time, indicating cell cycle arrest. The predicted viability of in silico gene knock-out models was compared to experimental observations from a systematic investigation of single gene deletions in yeast under normal growth conditions . In this manner, in the absence of a true validation set of independent gene expression and phenotype data, independent experimental observations were used to evaluate the validity of our model. Table 3 summarizes the correlation between predicted and observed viability. Overall, phenotypes resulting from knockout of fourteen of seventeen genes were correctly predicted. Accurate identification of essential genes with simulation of gene knockouts in silico indicates the validity of the inferred yeast cell cycle model and demonstrates the value of fuzzy logic models in hypothesis generation.
Double-gene knockouts can be used to discover genes with physical or genetic interactions that are essential for proper cellular function. Synthetic lethals are observed when a double knockout induces lethality and both single gene knockouts are viable. Conversely, synthetic rescue is observed when a double knockout of an essential and nonessential gene alleviates the lethality of the essential gene knockout. As an additional challenge to our dynamic yeast cell cycle model, we evaluated the predicted viability of double-gene knockouts against experimentally identified synthetic phenotypes. Experimental observations were obtained from publications compiled in the Saccharomyces Genome Database . We limited the analysis to the fourteen genes for which viability is correctly predicted with in silico single-gene knockouts. Among these genes, thirteen gene pairs have been observed to induce a synthetic lethal phenotype and five gene pairs have been observed to induce a synthetic rescue phenotype. Figure 3 indicates which double-gene knockouts are correctly predicted using the dynamic yeast cell cycle model. Seven of thirteen synthetic lethal and two of five synthetic rescue phenotypes were correctly predicted. A significant disparity is observed between the accuracy of prediction of single gene compared to double-gene knockouts. The relatively poor prediction of double-gene knockouts may be a result of the size of the model. It can be assumed that many of the interactions related to cell viability in yeast cannot be represented in our seventeen gene model.
2.3. Investigation of the Model Interaction Space Identifies Consensus Models
Given the use of an exhaustive search through the model parameter space, analysis of the best fit models alone neglects a significant portion of the data. We have previously demonstrated that the number of acceptable alternative models decreases exponentially with increasingly stringent fitness thresholds . Analysis of a small number of alternative, approximately equally fit models may provide additional insight into the biological phenomena under investigation. With this in mind, we examined the input genes selected in the top hundred best fitting models for each gene and the fraction of budding cells (Figure 4). Most of the models for a given output are largely consistent, with a small number of inputs selected in a majority of best fit models. Input genes that appear in a majority of alternative models are more likely to influence output. For example, CDC6 is an input gene in the majority of best fit models for SIC1 expression. This reflects the strong coexpression and coregulatory relationships between CDC6 and SIC1 [24, 25]. Input genes that appear in a small number of the alternative models (e.g., Swi4 in the model for SIC1) likely represent noise or may have only a small influence on output. It is also interesting to note the inconsistencies between the best fit models and the alternative models. For example, MBP1 is more frequently observed as an input to the Swi5 model than CDH1 and Swi6, but MBP1 is not a factor in the best fit model. These genes may represent alternative hypotheses that can be examined by further experimentation.
In this paper, we describe the development and analysis of a fuzzy logic model of cell cycle in Saccharomyces cerevisiae relating the expression of seventeen cell cycle genes to the budding phenotype. The structure of the model and semi-quantitative rules describing regulatory interactions between genes and between genes and phenotype were derived from a time series gene expression microarray dataset using an exhaustive search method. Best fit models for each gene and phenotype were identified and interpreted based on agreement with known interactions from the literature. In addition, node-specific models were integrated into a composite network model, and a simple iterative scheme was used to approximate the dynamic behavior of the system. The dynamic model converges to two alternative self-consistent states, matching hypotheses developed from experimental investigation. The composite network model was then analyzed to identify essential genes, that is, genes which are necessary for viability, and to predict synthetic lethal and synthetic rescue phenotypes in silico. This work represents a proof of concept demonstrating the feasibility of integrating phenotype information into mechanistic transcriptional models and the value of this approach in guiding hypothesis generation.
Yeast cell cycle was chosen as a model system to evaluate our method because it is a relatively well-characterized process with extensive literature and datasets available for model generation and evaluation. Association of model predictions with prior knowledge demonstrates the capability of the fuzzy logic model generation process to infer biologically relevant interactions. Note that genes which are expressed in the same phase of the cell cycle tend to be linked by positive interactions (e.g., G1 cyclins: CLN1-2, CLB5-6, CLB5-CLN2; M phase genes: SWI5, CLB1, CLB2; M/G1 transition genes: CDC6, SIC1, SWI4) [15, 18]. These edges represent coexpression relationships. Coregulatory relationships are also represented. For example, positive interactions between the Swi5, CLB1, and CLB2 genes are indicative of coregulation by the MCM1/XBP1 transcription factor complex . Finally, functional relationships are also inferred. For example, CLN1 and CLN2 stimulate their own expression through a positive feedback loop and also up-regulate CLB5/CLB6 . The model relating expression of the SIC1, CLB1, CLN3, CLB6, and Swi5 expression to the fraction of budding cells also captures known biological relationships. Negative regulation of the budding phenotype by SIC1 corresponds with the inhibitory function of SIC1 on CDC28/B-type cyclin complex formation and G1/S phase transition . Interactions between the fraction of budding cells and CLB6, CLB1, CLN3, and Swi5 reflect coexpression relationships. Swi5 and CLB1 are expressed in S, G2, and M phase when budding occurs . CLB6 and CLN3 are active in G1 phase when the budding phenotype is dormant. Confirmation of model predictions with known biological information suggests that the fuzzy logic modeling framework accurately captures relationships between genes and between gene expression and phenotype.
In vitro gene knockout is a fundamental method in molecular biology to characterize gene function by identifying genes that are necessary for cell viability and by inferring gene-gene interactions. We integrated the gene and phenotype-specific fuzzy logic models into a composite network model in order to investigate the dynamic behavior of the model. Investigation of the expression of genes and the predicted fraction of budding cells at convergence of the dynamic model indicates the presence of multiple local minima, associated with a high, medium, and low fraction of budding cells. Next, we used the dynamic model to predict the viability of gene deletion mutants in silico. Large collaborative efforts have systematically surveyed the effect of single gene deletions in model organisms such as Saccharomyces cerevisiae using molecular barcodes to quantify the fitness of gene deletion mutants grown together in culture . This data provides a rich test dataset in order to validate the predictions generated by the fuzzy logic model (Table 3). In total, the viability of fourteen out of seventeen single gene deletion mutants was correctly predicted. We correctly predicted that deletion of the MCM1, CDC28, and CDC20 genes are associated with an inviable phenotype. All of these genes are known to have important roles in cell cycle progression. CDC28 is the most active cyclin-dependent kinase in the yeast genome [18, 29], facilitating cell cycle progression through protein-protein interactions with cyclins expressed at different stages of the cell cycle. MCM1 is a transcription factor that interacts with other transcriptional cofactors to regulate expression of multiple mitotic genes including CLB1, CLB2, Swi4, Swi5, CLN1, CLN3, and CDC6 and is essential in regulating the G2/M phase transition [26, 30–33]. CDC20 targets the Pds1 gene for ubiquitin-mediated degradation and forms a complex essential for G2/M phase check-point function . Accurate prediction of the viability of single gene deletions in higher organisms may improve the rate at which gene function can be characterized in the context of the transcriptional regulatory network.
As an additional challenge, we tested the ability of the dynamic cell cycle model to predict synthetic lethal and synthetic rescue double mutant phenotypes. Nine out of eighteen double-mutants were correctly predicted (Figure 3). Incorrect single-gene and double-gene knock-out phenotype predictions may be a result of the limited scope of our model. For example, a synthetic lethal phenotype is observed experimentally with knockout of the CLB5 and Swi4 genes  but not predicted by our model. Cells with the CLB5/Swi4 knock-out arrest at the G2/M phase transition. Arrest is attributed to activation of the DNA damage checkpoint dependent on expression of the RAD9 and RAD24 genes . These results suggest that the incorporation of data related to the DNA damage response may be necessary to correctly predict the phenotype of the CLB5/Swi4 knockout. In a similar manner, use of additional gene and phenotype data may improve the prediction of double-gene knockouts.
Although fuzzy logic offers a robust, interpretable and computationally efficient modeling methodology, there are a number of limitations to the approach we have described. Fuzzy logic is associated with an inherent curse of dimensionality problem that arises from the evaluation and combination of individual rules that effect nodes with multiple inputs. In an exhaustive search, the number of potential models that must be evaluated grows exponentially , in which represents the number of inputs and represents the number of possible rules relating the effect of input on the output. We limited the exhaustive search by bounding the solution space to rules that incorporated five or less inputs. This approximation of gene regulation likely limits the accuracy with which we can reproduce biological mechanisms as the expression of many genes appears to be controlled by more than five inputs. Other solutions to the curse of dimensionality issue could involve the incorporation of optimization methods to allow for a directed search of the parameter space. As an example, an alternative method utilizing genetic algorithms to identify best fit models has been developed . Evaluation of the directed search algorithm indicated that the best fit solution as determined from an exhaustive search is reached in 98% of simulations with much less computational time. Importantly, use of optimization algorithms would allow for the investigation of systems with a larger number of genes and phenotypes without an explicit constraint on the number of inputs. In addition, the approach we have described cannot easily incorporate statistics to estimate the significance of model fit. As an alternative, we compared model predictions to prior knowledge and observations from independent experiments in order to evaluate the generalizability of our model. Finally, there are no formalized methods for defining the parameters involved in building a fuzzy logic system, such as the number of fuzzy sets and the shape of membership functions. These parameters can be selected with the use of prior knowledge or by using heuristics, but these approaches are less than optimal. These shortcomings should be considered when determining whether a fuzzy logic method similar to the implementation we have described is appropriate for future applications.
The explicit incorporation of phenotype as a node in the molecular signaling model is a key aspect of this work that allows for prediction of the viability of gene knockout in silico and hypothesis generation. A number of other studies have included phenotype in the inference of molecular signaling networks for similar purposes [1, 4, 6]. For example, in a series of publications, investigators have developed a decision tree framework to relate the expression of signaling proteins to migration speed of fibroblasts and breast cancer cells under different conditions [1, 4]. The goal of decision tree analysis is to generate a predictor capable of discriminating between multiple classes (e.g., low, medium, high speed of migration) with maximum accuracy and minimum model complexity. Using the model, investigators predicted the effect of modifications to the substrate surface and the addition of growth factors on migration speed with 70% accuracy . In addition, investigators correctly predicted the stimulatory effect of MLCK inhibitors on migration speed . In a second example, investigators used a partial least squares approach to build a model relating various metrics capturing the expression, activity, and/or phosphorylation of 19 molecular species to a signature of apoptotic activity in human colon adenocarcinoma cells . Partial least squares is similar to principal component analysis in that it involves the decomposition of data into orthogonal projections that capture a majority of the information in the original dataset. However, in partial least squares analysis, projections are selected to maximize the covariance between independent (e.g., expression, activity and/or phosphorylation of molecular species) and dependent (e.g., apoptotic signature) variables. In this study, investigators used partial least squares to identify a three-dimensional model capable of predicting the state of apoptosis outputs with 94% accuracy. Further analysis indicated that a majority of model accuracy could be attributed to two principal components associated with a stress-apoptosis response mediated through JNK1 and MK2 activity and cleavage of caspase 8 and a prosurvival response mediated through phosphorylation of Akt, IRS1, FKHR, and procaspase 3 metrics. While these approaches have successfully identified relations between gene expression and phenotype, it should be noted that the experimental methods used to gather information in these studies, including kinase activity assays, antibody arrays, western blots, and immunoblotting [1, 4, 6], are relatively low throughput. We have demonstrated the value of our model using gene expression microarray data, which facilitates collection of data at a genome-wide scale. In this study, we use a bounded exhaustive search that limits the size of the modelled system. Replacing the exhaustive search with an optimization method, as described above, would allow us to model larger systems and take advantage of the higher throughput of gene expression microarrays. More importantly, decision trees and partial least squares generate abstract representations of the underlying biological network, while in the present model, we use expression data to determine the network topology based on gene expression. We contend that the fuzzy logic and optimization framework we have described provides an optimized depiction of transcriptional networks in the cell, necessary to gain a thorough understanding of the mechanisms that contribute to changes in phenotype.
Use of gene expression microarray data for the generation of mechanistic signaling models has advantages and disadvantages. Gene expression microarrays enable cost-effective measurement of transcript abundance at the genome-wide scale. Widespread use of gene microarrays for expression profiling has led to the development of robust algorithms for preprocessing [35–37], quality control , data visualization , and analysis [39, 40]. In addition, guidelines and infrastructure have been established to promote the sharing of gene expression microarray data . However, by using gene expression data for model generation, we are admittedly neglecting posttranscriptional regulatory events, such as posttranslational modifications, protein-protein interactions, and protein degradation. Accordingly, many of the relationships we have derived are indicative of coexpression or coregulation at the transcriptional level. As the proteomics field matures, it will become more feasible to incorporate information regarding posttranscriptional regulatory mechanisms into biological network models. In addition, the dataset we have used in this study was collected on two-color cDNA technology. Two-color cDNA arrays are outdated in comparison to commercial oligonucleotide arrays. Despite this caveat, there is nothing in the literature that suggests the data is incorrect, and it is one of the only published datasets that provides both transcriptional and phenotypic data required for our algorithm.
The majority of the analysis presented in this work is based on the best fit approximations (Figure 1) to gene expression data. In previous work, we demonstrated that the number of acceptable alternative models decreases exponentially with error tolerance . The exhaustive search method generally converges to a small number of equally likely alternative models with high fitness to experimental data. Investigation of the interactions selected in the top hundred best fitting models for each output provided the means to examine these alternative models. In some cases, alternative models represent similar relationships (e.g., the following rules relating CLN1 to CDC20 expression: , ). These models can be reasonably merged into a consensus model in which expression of CLN1 inhibits expression of CDC20. In other instances, alternative models may indicate parallel regulatory pathways that are activated under different conditions. Finally, alternative models may offer different or even contradictory interpretations. Models that fit the latter description represent alternative hypotheses that are equally supported by the available data. Incorporation of other types of data may provide additional evidence to reject false positive models. For example, ChIP on chip data could provide additional evidence to support the identification of gene regulatory interactions [42, 43]. ChIP on chip combines chromatin immunoprecipitation (ChIP) with microarray analysis to map the genome-wide location of protein-DNA binding sites. This methodology can be used to infer the gene targets of a transcription factor of interest and, therefore, experimentally validate coregulatory interactions inferred by the model. As another example, prior knowledge in the form of known interactions could be incorporated into the model generation process. In this case, it will be important to limit the influence of prior knowledge such that discoveries that are strongly supported by the data will not be rejected. Alternatively, identification of contradictions in model predictions can be used to generate novel hypotheses and design experiments in order to gather the data necessary to reject incorrect models.
Molecular profiling technologies such as gene expression microarrays have enabled the quantification of molecular abundance at a genome-wide scale in high throughput. As technologies have matured, goals of data analysis have grown from the identification of conserved expression patterns across samples or conditions to the comprehension of gene function in the context of complex regulatory and functional networks. In this study, we have extended a fuzzy logic-based modeling approach to derive a transcriptional network consisting of seventeen genes known to be important for cell cycle regulation in yeast and a network element representing a phenotypic observation (the fraction of budding cells). Both the topology (i.e., interactions) and regulatory traits (e.g., stimulation, inhibition) of relationships between genes and between genes and phenotype are derived from publicly available gene microarray expression data and phenotype data using a bounded exhaustive search of the potential interaction space. Comparison of inferred gene regulatory interactions with known interactions in the literature provides confidence in the biological relevance of model predictions. Through the analysis of best fit fuzzy logic signaling models, genes with direct and indirect effects on phenotype were identified. In addition, we used our model to predict the effects of gene knockdown on cellular viability. In this manner, the methodology we have developed provides a direct link between computational analysis of molecular profiling data and experimental observations. We envision coupling this computational modeling method with experimentation in an iterative fashion to incrementally build understanding of regulatory mechanisms that control poorly understood cellular functions. This approach allows for systematic characterization of gene function in the context of disease-related, functional mechanisms that will facilitate rational design of targeted therapies.
5.1. Gene Expression and Phenotype Data
Gene expression microarray data and phenotype data were obtained from the Yeast Cell Cycle Analysis Project at the Stanford University (http://genome-www.stanford.edu/cellcycle/) . Gene expression was measured using in-house two-color microarrays as described . The fraction of budding cells was determined by manually scoring and counting budding cells.
5.2. Preprocessing of Gene Expression Data
Expression data was projected onto the interval for generality and compatibility with the fuzzy logic scheme described below. Expression ratios were preprocessed by log base 2 transformation followed by normalization using the arctangent function and division by π/2. This process results in a symmetric transformation of the data across the desired interval.
5.3. Fuzzy Logic System
A fuzzy logic framework  was used to derive a model of the regulatory relationships between 17 cell-cycle-related genes and the influence of gene expression on the fraction of budding cells. The model can be described as a directed graph, in which the nodes represent genes or phenotypes and the edges represent direct or indirect interactions. Phenotype information was integrated by including a node for the fraction of budding cells and identifying best fit models in which gene expression could be used to predict phenotype. The budding network model was generated by joining independent models of each node that were derived through application of the following steps: fuzzification, rule configuration, defuzzification, and evaluation.
Fuzzification utilizes membership functions to convert continuous measurements into a discrete representation. The range of the membership function represents the degree to which a value belongs to a fuzzy set. The choice of membership function is subjective and context dependent. In the framework described here, we employ a membership function (Figure 5(a)) consisting of three fuzzy sets (low, medium, and high expression). This membership function was selected to maximize computational efficiency, exactly reproduce monotonic linear negative and positive interactions and avoid the introduction of systematic errors through fuzzification. Given three fuzzy sets , fuzzification of a gene expression value x results in the generation of a fuzzy set y = as follows: The following example demonstrates how normalized gene expression values from three different genes (, and ) are represented in fuzzy space (): A similar scheme could be used for fuzzification of phenotype data. In this study, phenotype is considered as an output only. Accordingly, it is not necessary to fuzzify the observed fraction of budding cells. However, model predictions are defined in fuzzy space. In order to evaluate and interpret model predictions, it is necessary to defuzzify the predicted fraction of budding cells. Defuzzification schemes are dependent on membership functions. With this in mind, the membership function for fuzzification of the fraction of budding cells is described as follows, for completeness: Through fuzzification, continuous data is discretized to increase computational efficiency in the rule configuration stage. Importantly, information needed to derive qualitative relationships between nodes remains observable in the fuzzy data.
Rule configuration is the specification of if-then relationships between variables in fuzzy space. For example, an inhibitory relationship is represented by the rule vector (i.e., if input is low (r1), then output is high (3); if input is medium (r2), then output is medium (2), etc.). The state of an output node z = [z1 z2 z3] is determined by the fuzzy state of an input gene y = [y1 y2 y3] and the rule describing the relation from input to output as follows: Extending the example given above, assume that expression of gene 1 inhibits or negatively regulates the output gene. Given the expression of gene 1 and a rule describing the relationship between gene 1 and the output gene, the value of z in fuzzy space can be predicted as follows: In biological networks, the state of output nodes is generally dependent on multiple input nodes. By convention, multiple inputs are integrated in fuzzy logic using the logical AND connective (if gene 1 is low and gene 2 is high, then the output gene is low). This leads to a combinatorial rule explosion in which the addition of inputs to the fuzzy logic system causes an exponential increase in the number of rules to be evaluated and computational time . Alternatively, the relation of each input to the output can be evaluated separately and joined using the logical OR connective. This alternative rule configuration is equivalent to the logical AND rule configuration in propositional logic . Furthermore, the addition of inputs to the fuzzy logic system under the alternative configuration results in a linear increase in computational time. The logical OR connective, or union, can be interpreted as the algebraic sum in fuzzy logic [12, 13]. Under this interpretation, rules describing the relation of each input gene to the output gene are evaluated separately resulting in intermediate outputs (zi). The intermediate outputs are summed to determine the expression of the output gene (z) in fuzzy space: where is equal to the number of input genes that regulate the expression of the output gene. The example below demonstrates the application of this rule configuration given that gene 1 negatively regulates the output gene and gene 3 positively regulates the output gene as follows: The complexity of the rule configuration step is dependent on the number of possible rules describing relations between nodes (with three fuzzy sets, the number of rules = 33 = 27) and the number of input genes for a given node. In this work, we limit the number of input genes to less than or equal to five to bound the computational cost.
Defuzzification is the inverse transformation of variables from fuzzy representation to continuous space. This step is necessary prior to evaluation of model predictions against independent test data. Predicted expression values defined in continuous space can be derived from discrete, fuzzy values via the simplified centroid method with point set definitions as shown in Figure 5(b) . Given the fuzzy values of a gene y = [y1 y2 y3], the defuzzified expression value can be defined as The location of the centroids in the simplified centroid method is dependent on the location of the apex of the corresponding membership functions used in fuzzification. With this in mind, defuzzification of phenotype values is accomplished by a similar function with the point set definitions shifted to reflect the shift in the centroids of membership functions defined in (3).
Following defuzzification, expression measures are reverse transformed back to log2 expression values by multiplying by π/2 and applying the tangent function. Similarly, the defuzzified fraction of budding cells should be transformed to remove the sigmoidal bias that originates from arctangent transformation of the gene expression values. The fraction of budding cells is defined on the interval . Accordingly, phenotype measurements were reverse transformed using the logistic function: where is equal to 6 and the independent variable on the right side of (9) is set equal to . Parameter values of the logistic function were selected to evenly distribute the transformed data over the range of .
Best fit models describing the relationships between genes and between genes and the fraction of budding cells were generated using an exhaustive search through the parameter space. For a given output node, all combinations of input genes and rules were evaluated by comparing the predicted expression value against the experimental data. The coefficient of determination metric was used for comparison. The coefficient of determination is based on the Euclidean distance between the predicted and observed values. Models with high coefficient of determination accurately predict the magnitude of expression. Models analyzed in this study represent the best fit to the data as determined using this metric.
5.4. Incorporating Redundancy in the Model for Phenotype
In the fuzzy logic framework described above, each input rule affects the state of associated output nodes through separate, independent relations. However, biological pathways are often populated with redundant mechanisms. To obtain a model that accurately represents the underlying biology, these homologous relationships must be incorporated. We have manually modified the inferred model to represent pairs of functionally homologous genes as the maximum of the two expression values. All instances of homologous gene pairs (CLN1 and CLN2, CLB1 and CLB2, CLB5 and CLB6) in the input of gene or phenotype modes were modified in this manner. For example, the model for the fraction of budding yeast phenotype was modified as described below: inferred model: CLN3 & CLB6 & CLB1 & SWI5 & SIC1⇒ phenotype,modified input: CLN3 & (CLB5/CLB6) & (CLB1/CLB2) & SWI5 & SIC1⇒ phenotype, where, (CLB5/CLB6) = Max(CLB5, CLB6) (CLB1/CLB2) = Max(CLB1, CLB2).
5.5. Analysis of the Network Model
Given the inferred models for each node, a composite network model was generated to investigate the behavior of the system as a whole. Node-specific models were integrated into a single global model by consolidating all instances of a gene into a single node. An iterative scheme was employed to determine the state of the network at equilibrium. Experimentally observed values of gene expression were used as initial conditions (I0) for the state of the corresponding nodes. New values of each node (I1) were calculated based on the initial conditions and the fuzzy relations inferred from the data. Values in the next iteration were calculated as a linear combination of the inferred values (In) and the initial values (In-1) as follows: Calculation of new values continued until the convergence condition of was reached. Linear combination of new and old values ensures that the system smoothly converges towards equilibrium. The value of the mixing parameter (α) can be chosen to minimize the number of iterations required to reach a solution while allowing for convergence. As the cost of the calculations was minimal, we chose a conservative value of 0.01 and found convergence could be reached after a few thousand iterations which required only a few seconds of simulation time. Larger choices of (α) could decrease the number of iterations but can also cause the algorithm to diverge from the true solution.
Model building and the exhaustive search was implemented in Fortran. Dynamic network simulations were implemented in Matlab.
M. Gormley and Viswanadha U. Akella developed the dynamic model software, performed the analysis in the paper and prepared the paper. Judy N. Quong participated in study design and in the preparation of the paper for publication. Andrew A. Quong conceived of the study, developed the software used for model specification, participated in study design, and preparation of the paper. All authors read and approved the final paper. M. Gormley and Viswanadha U. Akella contributed equally to the paper.
This work was supported by a Grant from the Pennsylvania Department of Health.
- S. Hautaniemi, S. Kharait, A. Iwabu, A. Wells, and D. A. Lauffenburger, “Modeling of signal-response cascades using decision tree analysis,” Bioinformatics, vol. 21, no. 9, pp. 2027–2035, 2005.
- A. R. Asthagiri and D. A. Lauffenburger, “Bioengineering models of cell signaling,” Annual Review of Biomedical Engineering, vol. 2, no. 2000, pp. 31–53, 2000.
- M. W. Covert, E. M. Knight, J. L. Reed, M. J. Herrgard, and B. O. Palsson, “Integrating high-throughput and computational data elucidates bacterial networks,” Nature, vol. 429, no. 6987, pp. 92–96, 2004.
- S. Kharait, S. Hautaniemi, S. Wu, A. Iwabu, D. A. Lauffenburger, and A. Wells, “Decision tree modeling predicts effects of inhibiting contractility signaling on cell motility,” BMC Systems Biology, vol. 1, article 9, 2007.
- K. C. Chen, L. Calzone, A. Csikasz-Nagy, F. R. Cross, B. Novak, and J. J. Tyson, “Integrative analysis of cell cycle control in budding yeast,” Molecular Biology of the Cell, vol. 15, no. 8, pp. 3841–3862, 2004.
- K. A. Janes, J. G. Albeck, S. Gaudet, P. K. Sorger, D. A. Lauffenburger, and M. B. Yaffe, “Cell signaling: a systems model of signaling identifies a molecular basis set for cytokine-induced apoptosis,” Science, vol. 310, no. 5754, pp. 1646–1653, 2005.
- B. B. Aldridge, J. Saez-Rodriguez, J. L. Muhlich, P. K. Sorger, and D. A. Lauffenburger, “Fuzzy logic analysis of kinase pathway crosstalk in TNF/EGF/insulin-induced signaling,” PLoS Computational Biology, vol. 5, no. 4, article e1000340, 2009.
- S. Datta and B. A. Sokhansanj, “Accelerated search for biomolecular network models to interpret high-throughput experimental data,” BMC Bioinformatics, vol. 8, article 258, 2007.
- B. A. Sokhansanj, J. P. Fitch, J. N. Quong, and A. A. Quong, “Linear fuzzy gene network models obtained from microarray data by exhaustive search,” BMC Bioinformatics, vol. 5, article 108, 2004.
- M. Kanehisa and S. Goto, “KEGG: kyoto encyclopedia of genes and genomes,” Nucleic Acids Research, vol. 28, no. 1, pp. 27–30, 2000.
- L. Glass and S. A. Kauffman, “The logical analysis of continuous, non-linear biochemical control networks,” Journal of Theoretical Biology, vol. 39, no. 1, pp. 103–129, 1973.
- L. A. Zadeh, “Fuzzy sets,” Information and Control, vol. 8, no. 3, pp. 338–353, 1965.
- J. M. Mendel, “Fuzzy logic systems for engineering: a tutorial,” Proceedings of the IEEE, vol. 83, no. 3, pp. 345–377, 1995.
- G. Giaever, A. M. Chu, L. Ni et al., “Functional profiling of the Saccharomyces cerevisiae genome,” Nature, vol. 418, no. 6896, pp. 387–391, 2002.
- P. T. Spellman, G. Sherlock, M. Q. Zhang et al., “Comprehensive identification of cell cycle-regulated genes of the yeast Saccharomyces cerevisiae by microarray hybridization,” Molecular Biology of the Cell, vol. 9, no. 12, pp. 3273–3297, 1998.
- F. R. Cross, V. Archambault, M. Miller, and M. Klovstad, “Testing a mathematical model of the yeast cell cycle,” Molecular Biology of the Cell, vol. 13, no. 1, pp. 52–70, 2002.
- F. Li, T. Long, Y. Lu, Q. Ouyang, and C. Tang, “The yeast cell-cycle network is robustly designed,” Proceedings of the National Academy of Sciences of the United States of America, vol. 101, no. 14, pp. 4781–4786, 2004.
- M. D. Mendenhall and A. E. Hodge, “Regulation of Cdc28 cyclin-dependent protein kinase activity during the cell cycle of the yeast Saccharomyces cerevisiae,” Microbiology and Molecular Biology Reviews, vol. 62, no. 4, pp. 1191–1243, 1998.
- L. H. Hartwell, “Saccharomyces cerevisiae cell cycle,” Bacteriological Reviews, vol. 38, no. 2, pp. 164–198, 1974.
- K. C. Chen, A. Csikasz-Nagy, B. Gyorffy, J. Val, B. Novak, and J. J. Tyson, “Kinetic analysis of a molecular model of the budding yeast cell cycle,” Molecular Biology of the Cell, vol. 11, no. 1, pp. 369–391, 2000.
- U. Güldener, M. Münsterkötter, G. Kastenmüller et al., “CYGD: the comprehensive yeast genome database,” Nucleic Acids Research, vol. 33, pp. D364–D368, 2005.
- B. Andrews and V. Measday, “The cyclin family of budding yeast: abundant use of a good idea,” Trends in Genetics, vol. 14, no. 2, pp. 66–72, 1998.
- S. R. Engel, R. Balakrishnan, G. Binkley et al., “Saccharomyces Genome Database provides mutant phenotype data,” Nucleic Acids Research, vol. 38, no. 1, pp. D433–D436, 2009.
- D. Knapp, L. Bhoite, D. J. Stillman, and K. Nasmyth, “The transcription factor Swi5 regulates expression of the cyclin kinase inhibitor p40(SIC1),” Molecular and Cellular Biology, vol. 16, no. 10, pp. 5701–5707, 1996.
- S. Piatti, C. Lengauer, and K. Nasmyth, “Cdc6 is an unstable protein whose de novo synthesis in G1 is important for the onset of S phase and for preventing a “reductional” anaphase in the budding yeast Saccharomyces cevevisiae,” EMBO Journal, vol. 14, no. 15, pp. 3788–3799, 1995.
- H. Althoefer, A. Schleiffer, K. Wassmann, A. Nordheim, and G. Ammerer, “Mcm1 is required to coordinate G2-specific transcription in Saccharomyces cerevisiae,” Molecular and Cellular Biology, vol. 15, no. 11, pp. 5917–5928, 1995.
- F. Cvrckova and K. Nasmyth, “Yeast G1 cyclins CLN1 and CLN2 and a GAP-like protein have a role in bud formation,” EMBO Journal, vol. 12, no. 13, pp. 5277–5286, 1993.
- M. D. Mendenhall, “An inhibitor of p34(CDC28) protein kinase activity from Saccharomyces cerevisiae,” Science, vol. 259, no. 5092, pp. 216–219, 1993.
- K. Nasmyth, “Control of the yeast cell cycle by the Cdc28 protein kinase,” Current Opinion in Cell Biology, vol. 5, no. 2, pp. 166–179, 1993.
- M. H. Kuo and E. Grayhack, “A library of yeast genomic MCM1 binding sites contains genes involved in cell cycle control, cell wall and membrane structure, and metabolism,” Molecular and Cellular Biology, vol. 14, no. 1, pp. 348–359, 1994.
- D. Lydall, G. Ammerer, and K. Nasmyth, “A new role for MCM1 in yeast: cell cycle regulation of SWI5 transcription,” Genes and Development, vol. 5, no. 12, pp. 2405–2419, 1991.
- M. Maher, F. Cong, D. Kindelberger, K. Nasmyth, and S. Dalton, “Cell cycle-regulated transcription of the CLB2 gene is dependent on Mcm1 and a ternary complex factor,” Molecular and Cellular Biology, vol. 15, no. 6, pp. 3129–3137, 1995.
- C. J. McInerny, J. F. Partridge, G. E. Mikesell, D. P. Creemer, and L. L. Breeden, “A novel Mcm1-dependent element in the SWI4, CLN3, CDC6, and CDC47 promoters activates M/G1-specific transcription,” Genes and Development, vol. 11, no. 10, pp. 1277–1288, 1997.
- E. Queralt and J. C. Igual, “Functional connection between the Clb5 cyclin, the protein kinase C pathway and the Swi4 transcription factor in Saccharomyces cerevisiae,” Genetics, vol. 171, no. 4, pp. 1485–1498, 2005.
- R. A. Irizarry, B. Hobbs, F. Collin et al., “Exploration, normalization, and summaries of high density oligonucleotide array probe level data,” Biostatistics, vol. 4, no. 2, pp. 249–264, 2003.
- C. Li and W. Hung Wong, “Model-based analysis of oligonucleotide arrays: model validation, design issues and standard error application,” Genome Biology, vol. 2, no. 8, p. RESEARCH0032, 2001.
- C. Li and W. H. Wong, “Model-based analysis of oligonucleotide arrays: expression index computation and outlier detection,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 1, pp. 31–36, 2001.
- L. M. Cope, R. A. Irizarry, H. A. Jaffee, Z. Wu, and T. P. Speed, “A benchmark for Affymetrix GeneChip expression measures,” Bioinformatics, vol. 20, no. 3, pp. 323–331, 2004.
- A. Subramanian, P. Tamayo, V. K. Mootha et al., “Gene set enrichment analysis: a knowledge-based approach for interpreting genome-wide expression profiles,” Proceedings of the National Academy of Sciences of the United States of America, vol. 102, no. 43, pp. 15545–15550, 2005.
- V. G. Tusher, R. Tibshirani, and G. Chu, “Significance analysis of microarrays applied to the ionizing radiation response,” Proceedings of the National Academy of Sciences of the United States of America, vol. 98, no. 9, pp. 5116–5121, 2001.
- A. Brazma, P. Hingamp, J. Quackenbush et al., “Minimum information about a microarray experiment (MIAME)—toward standards for microarray data,” Nature Genetics, vol. 29, no. 4, pp. 365–371, 2001.
- V. R. Iyer, C. E. Horak, C. S. Scafe, D. Botstein, M. Snyder, and P. O. Brown, “Genomic binding sites of the yeast cell-cycle transcription factors SBF and MBF,” Nature, vol. 409, no. 6819, pp. 533–538, 2001.
- B. Ren, F. Robert, J. J. Wyrick et al., “Genome-wide location and function of DNA binding proteins,” Science, vol. 290, no. 5500, pp. 2306–2309, 2000.
- W. E. Combs and J. E. Andrews, “Combinatorial rule explosion eliminated by a fuzzy rule configuration,” IEEE Transactions on Fuzzy Systems, vol. 6, no. 1, pp. 1–11, 1998.