About this Journal Submit a Manuscript Table of Contents
The Scientific World Journal
Volume 2012 (2012), Article ID 753430, 6 pages
http://dx.doi.org/10.1100/2012/753430
Research Article

Gene Expression Network Reconstruction by LEP Method Using Microarray Data

School of Mathematics & Computational Science, Sun Yat-Sen University, Guangzhou, Guangdong 510275, China

Received 28 September 2012; Accepted 25 November 2012

Academic Editors: R. Jiang, W. Tian, J. Wan, and X. Zhao

Copyright © 2012 Na You 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.

Abstract

Gene expression network reconstruction using microarray data is widely studied aiming to investigate the behavior of a gene cluster simultaneously. Under the Gaussian assumption, the conditional dependence between genes in the network is fully described by the partial correlation coefficient matrix. Due to the high dimensionality and sparsity, we utilize the LEP method to estimate it in this paper. Compared to the existing methods, the LEP reaches the highest PPV with the sensitivity controlled at the satisfactory level. A set of gene expression data from the HapMap project is analyzed for illustration.

1. Introduction

Genes on the chromosomes behave interactively controlling the gene expression profiles of a cluster of genes, and their own expressions are in turn regulated by a bundle of genes. Exploring the gene expression regulatory network is essentially important to understand the progress of complex diseases, find the causal genes, and develop new drugs. In the past decades, the development of microarray technology allows us to measure the expression levels of tens of thousands of genes simultaneously, providing an opportunity to study the complex relationships among genes. In order to reconstruct the gene expression network, for any two particular genes, the conditional independence given all other genes needs to be investigated.

Because of the convenience of describing the interactions among variables, the graphical models become a common choice to study the relationships between variables, including but not limited to Boolean network [1], Bayesian network [24], autoregression model [5], and graphical Gaussian model [6]. However, the statistical inference on the independence is not easy. Under the Gaussian assumption, the independence is identical to being uncorrelated, and the conditional dependence between variables is able to be represented by the partial correlation coefficient matrix. When the number of observations is equal or greater than the number of variables , [7] mentioned two ways to estimate the partial correlation coefficient matrix in the graphical Gaussian model. If , neither of these two ways is applicable due to the singular matrix.

As a typical high-dimensional data, there are usually not many available chips, while a great number of genes are included in the microarray data analysis. Fortunately, more and more studies [810] showed that the gene expression network is sparse, which means, for a particular gene, it only interacts with a few other genes. This fact implies that the majority entries of the partial correlation coefficient matrix are zero. To efficiently explore the sparsity and identify non-zero entries, the penalized linear regression is established where the sum of squared residuals (SSR) plus a penalty term is minimized, and has been widely used to estimate the sparse partial correlation coefficient matrix to reconstruct the gene expression network using microarray data [7, 11].

The most pioneering penalized linear regression method, the least absolute shrinkage and selection operator (LASSO) proposed by [12], utilizes the penalty to shrink the estimate which is close to zero from non-zero to zero, but it shrinks the estimates for parameters farther away from zero more severely, leading to a substantial bias. The authors in [13] indicated that LASSO may cause a bias even in a simple regression and suggested the smoothly clipped absolute deviation (SCAD) method, where a nonconcave penalty term with desirable statistical properties, such as unbiasedness, sparsity, and continuity, was introduced. However, the SCAD penalty is not smooth, resulting in the optimization problem being complicated. Upon this, [14] proposed the Laplace error penalty (LEP) method with a penalty which is unbiased, sparse, continuous, and almost smooth.

In this paper, we will apply the LEP method to reconstruct the gene expression network, and compare it to LASSO and SCAD in the performance of estimating the partial correlation coefficient matrix. The paper is structured as follows. In Section 2, the LASSO, SCAD, and LEP methods will be briefly described. In Section 3, we will report the results of simulations and a real data analysis. A short discussion is given in Section 4.

2. Methods

The graphical Gaussian model, or GGM for abbreviation, is an undirected graphical model. Let indicate a -dimensional random variable, subject to the multivariate normal distribution , where is the mean vector and is the variance-covariance matrix. Given samples from , , the partial correlation coefficient matrix , which reflects the conditional dependence between different components of , could be estimated by , where is the estimator for in the linear regression model , and , are independent and identically distributed, and independent of , and is an indicator function, being −1, 0, or 1 when is smaller, equal, or greater than 0, respectively. For the “small N large P” problem, instead of the classical least square optimization, the objective function is minimized to get the estimator for , , where indicates a penalty function on the parameters. The formula is essentially important. It not only determines the way to shrink the estimators, but also directly affects the complexity of the optimization algorithm. A good penalty function should have several desirable statistical properties, unbiasedness, sparsity, continuity [13], and smoothness [14].

The LASSO, proposed by [12], has the penalty . Although it succeeded in many applications of variable selection, it shrinks the estimates of larger parameters more significantly than that of the smaller parameters, causing a substantial bias. The SCAD penalty function, suggested by [13], has the derivative . Beside the sparsity and continuity, it gains the unbiasedness but loses the smoothness. The SCAD penalty is made of piecewise quadratic splines, making the optimization of (2) complicated. To overcome this problem, Wen et al. [14] proposed the LEP with penalty term where and are two tuning parameters.

The LEP penalty not only satisfies the unbiasedness, sparsity, and continuity, but also is an almost smooth function. It emphasizes the smoothness and complexity, since the smooth function is more stable, and the complexity of optimization algorithm highly depends on the complexity of , which determines whether the proposed method could be widely applied, especially in the high-dimensional data situations. In order to solve the optimization problem, [14] extended the block coordinate gradient descent (BCGD) algorithm [15] and provided a faster computing algorithm, as will be shown in the simulation studies. For the details of the LEP method and the optimization algorithm, please refer to [14].

3. Results

3.1. Simulations

Suppose there are microarray chips and genes, then equations with parameters are involved in (1). When is fixed, increasing/decreasing would increase/decrease the number of equations but the number of parameters would remain the same. In this case, the penalized linear regression, including LEP, LASSO and SCAD, performed as expected that is, their estimates became more or less accurate as became larger or smaller (results not shown here). Therefore, in the following simulations, we fixed and only varied or 20.

In order to fully evaluate the performances of LEP, LASSO, and SCAD in different situations, four scenarios were set up. In each scenario, a covariance matrix of size was generated, and random vectors of dimension were sampled from the multivariate normal distribution independently. The partial correlation coefficient matrix was then estimated from the sampled data. We fixed and made 100 repetitions in each scenario to get the average of the estimates for fair comparison. In the first two scenarios , and in scenario 3 and 4. Two data generating procedures used in [11] were employed to generate the covariance matrix . In scenario 1 and 3, the -element of , , where and were generated by setting , following a uniform distribution . In scenario 2 and 4, a sparse precision matrix was generated as proposed in [16], and .

The partial correlation coefficient matrix was estimated by LEP, LASSO or SCAD, respectively, in each scenario. To evaluate the performances of different methods, the sensitivity which is the fraction of “true non-zero and also estimated non-zero parameters” to “true non-zero parameters” and PPV which is the fraction of “true non-zero and also estimated non-zero parameters” to “estimated non-zero parameters” were calculated. Furthermore, the was also presented. The results in four scenarios were listed in Table 1.

tab1
Table 1: The sensitivity, PPV, and values in four scenarios of the simulation studies.

As the number of genes increases, the number of parameters to be estimated increases rapidly. Due to the sparsity of partial correlation coefficient matrix, the number of true zero parameters increases much more than that of true non-zero parameters, causing the chance of estimating a zero parameter to be non-zero increases more than that of estimating a non-zero parameter to be zero. As presented in Table 1, although the sensitivity of LEP did not change significantly as increasing from 10 to 20, its PPV reduced obviously from ~90% in scenario 1 and 2 to ~80% in scenario 3 and 4. The LASSO and SCAD showed similarly. Note that beside the penalty term, the performances of different methods also depend on the true value of covariance matrix , which was generated at the beginning of each scenario.

Across all the scenarios, although LASSO reached the highest sensitivity, its PPV was far lower than that of SCAD and LEP, which means that LASSO could identify more gene regulatory relationships, but there might be many false positives. Among these three methods, LEP achieved the highest PPV with its sensitivity controlled at similar level to that of SCAD. Its score also reached the highest value in scenario 1, 3, and 4. More importantly, using the algorithm proposed by [14], LEP was the fastest, whose computation time was almost 1/18, 1/10, 1/7 and 1/9 of LASSO and 1/5, 1/4, 1/3, and 1/3 of SCAD in four scenarios, respectively.

For intuitive illustration, we also plotted the relative frequency matrix for each method in each scenario, where the -element indicates the relative frequency of non-zero estimates among 100 repetitions. The darker the color is, the higher the frequency of non-zero estimates is. The true partial correlation coefficient matrix was shown in the first panel of each row in Figure 1. From Figure 1, we can see that the color of LASSO is significantly darker than others, especially the truth, which means that LASSO estimated many true zero parameters to be non-zero, resulting in many false positives. Comparing to LASSO, the SCAD plot became much closer to the truth and LEP made a further improvement upon the SCAD plot.

fig1
Figure 1: The relative frequency matrices in four scenarios of the simulation studies. The first, second, third and forth rows correspond to scenario 1, 2, 3 and 4, respectively.
3.2. A Real Data Example

In this section, the publicly available gene expression dataset GSE6536 (http://www.ncbi.nlm.nih.gov/geo/query/acc.cgi?acc=GSE6536) was investigated. There are gene expression values of 47,294 human transcripts from 270 HapMap individual samples [17], including 30 Caucasian trios of northern and western European background (CEU), 30 Yoruba trios from Ibadan, Nigeria (YRI), 45 unrelated individuals from Beijing, China (CHB), and 45 unrelated individuals from Tokyo, Japan (JPT). After the microarray data were log2-transformed and background corrected, within and across the population normalized, the gene expression values were saved in a matrix for further analysis, which also could be downloaded from the website mentioned above.

Frommlet et al. [18] listed 44 genes which are significantly differentially expressed across individual samples. Since the platform Sentrix Human-6 Expression BeadChip used in this experiment was publicly available in 2005, so far the gene annotation database has been updated a lot. Of those 44 genes, 14 either were found to be pseudogenes or have been removed as a result of standard genome annotation processing and therefore were excluded from our following analysis. The partial correlation coefficient matrix of the rest 30 genes were estimated using 270 samples data. In the graphical model, one non-zero estimate off diagonal in the partial correlation coefficient matrix corresponds to one edge connecting different genes on the graph. The number of edges connected with each gene was listed in Table 2.

tab2
Table 2: The number of edges connected with each gene in GSE6536 data example.

As shown in Table 2, LASSO identified 76 edges between 30 genes, SCAD found 21 and LEP reported 13. The LASSO recognized that almost all of the genes interacted with others and identified much more edges than SCAD or LEP. To compare the performances of different methods, we only focus on the important genes which carry the most or secondly most number of edges. For LASSO, there is 1 such important gene with 9 edges and 4 with 8 edges each. The SCAD found 2 important genes with 4 edges each and 4 with 3 edges each. The LEP identified 4 with 3 edges each and 4 with 2 edges each.

For the important genes recognized by LASSO, none of them were taken to be important by SCAD or LEP. According to the gene functions described in Table 2, although these genes have very important functions, they usually accomplish these functions together with many others genes, and once they could not be normally expressed, these functions could be completed by other genes, then this would not significantly affect the gene expression in the network. On the contrary, the genes identified by SCAD or LEP usually have unique gene function, which could not be recovered by other genes once they are expressed abnormally, resulting in the irregular expression in the network.

Beside those 5 common genes identified by both of LEP and SCAD, LEP found 3 more exclusive genes and SCAD found 1 more exclusive gene. Those 3 LEP exclusive genes not only play a key role in the cellular mechanism, but also have very close relationships with other genes. Among them, PRPF8 (gene 16) is a component of both U2- and U12-dependent spliceosomes, which removes the vast majority of introns (more than 99%) in mammals [19, 20]. DDR1 (gene 21), one of the receptor tyrosine kinases, is important in the communication between the cells and their microenvironments and gets involved in many cellular activities, like growth, differentiation, and metabolism [21]. UBA7 (gene 26), widely expressed in a variety of cell types, belongs to the ubiquitin conjugation pathway, which is of fundamental and central importance [22]. However, the SCAD exclusive gene, TARDBP (gene 19), although plays an important role in modulating HIV-1 gene expression; it only represses transcription from the HIV-1 long terminal repeat, no other transcription from other promoters [23]. Due to this fact, it should not interact heavily with other genes, as the LEP concluded.

4. Discussion

In this paper, we applied the LEP method to estimate the partial correlation coefficient matrix to reconstruct the gene expression network. Comparing to the existing methods, for example, LASSO and SCAD, LEP reached the highest PPV, and its sensitivity was controlled at the similar level as SCAD. As seen from the relative frequency matrix plot in the simulation studies, LEP showed the superiority in exploring the sparsity of the partial correlation coefficient matrix.

There are two tuning parameters in the LEP penalty function. We used the EBIC criteria [24] to select the approximate values for parameters. But as seen from the simulation results (not shown here), any combination of and which satisfy some certain function relation would return very close estimation results. Therefore, we only need to vary one of and and keep the other a constant for parameter choosing. As in the real data analysis, we set and vary .

Acknowledgments

This work is partially supported by the Major State Basic Research Development Program (2012CB517900), NSFC (11001280), NDFGP (10151027501000066), RFDP (20090171110017), and the Fundamental Research Funds for the Central Universities.

References

  1. P. D'Haeseleer, S. Liang, and R. Somogyi, “Genetic network inference: from co-expression clustering to reverse engineering,” Bioinformatics, vol. 16, no. 8, pp. 707–726, 2000. View at Scopus
  2. N. Friedman, M. Linial, I. Nachman, and D. Pe'er, “Using bayesian networks to analyze expression data,” Journal of Computational Biology, vol. 7, no. 3-4, pp. 601–620, 2000.
  3. E. Segal, M. Shapira, A. Regev et al., “Module networks: identifying regulatory modules and their condition-specific regulators from gene expression data,” Nature Genetics, vol. 34, no. 2, pp. 166–176, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. N. Friedman, “Inferring cellular networks using probabilistic graphical models,” Science, vol. 303, no. 5659, pp. 799–805, 2004. View at Publisher · View at Google Scholar · View at Scopus
  5. R. Opgen-Rhein and K. Strimmer, “Learning causal networks from systems biology time course data: an effective model selection procedure for the vector autoregressive process,” BMC Bioinformatics, vol. 8, supplement 2, article S3, 2007. View at Publisher · View at Google Scholar · View at Scopus
  6. J. Schäfer and K. Strimmer, “An empirical Bayes approach to inferring large-scale gene association networks,” Bioinformatics, vol. 21, no. 6, pp. 754–764, 2005. View at Publisher · View at Google Scholar · View at Scopus
  7. N. Krämer, J. Schäfer, and A. L. Boulesteix, “Regularized estimation of large-scale gene association networks using graphical Gaussian models,” BMC Bioinformatics, vol. 10, no. 1, article 384, 2009. View at Publisher · View at Google Scholar · View at Scopus
  8. T. I. Lee, N. J. Rinaldi, F. Robert et al., “Transcriptional regulatory networks in Saccharomyces cerevisiae,” Science, vol. 298, no. 5594, pp. 799–804, 2002. View at Publisher · View at Google Scholar · View at Scopus
  9. S. Ma, Q. Gong, and H. J. Bohnert, “An Arabidopsis gene network based on the graphical Gaussian model,” Genome Research, vol. 17, no. 11, pp. 1614–1625, 2007. View at Publisher · View at Google Scholar · View at Scopus
  10. R. D. Leclerc, “Survival of the sparsest: robust gene networks are parsimonious,” Molecular Systems Biology, vol. 4, article 213, 2008. View at Publisher · View at Google Scholar · View at Scopus
  11. J. Fan, Y. Feng, and Y. Wu, “Network exploration via the adaptive lasso and scad penalties,” The Annals of Applied Statistics, vol. 3, no. 2, pp. 521–541, 2009.
  12. R. Tibshirani, “Regression shrinkage and selection via the lasso,” Journal of the Royal Statistical Society B, vol. 85, no. 1, pp. 267–288, 1996.
  13. J. Fan and R. Li, “Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties,” Journal of the American Statistical Association, vol. 96, no. 456, pp. 1348–1360, 2001. View at Scopus
  14. C. Wen, S. Wang, and X. Wang, “Ultra-high dimensional variable selection based on global minimizers of penalized least squares,” Tech. Rep., Sun Yat-Sen University, 2012.
  15. P. Tseng and S. Yun, “A coordinate gradient descent method for nonsmooth separable minimization,” Mathematical Programming, vol. 117, no. 1-2, pp. 387–423, 2009. View at Publisher · View at Google Scholar · View at Scopus
  16. H. Li and J. Gui, “Gradient directed regularization for sparse Gaussian concentration graphs, with applications to inference of genetic networks,” Biostatistics, vol. 7, no. 2, pp. 302–317, 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. The International HapMap Consortium, “A haplotype map of the human genome,” Nature, vol. 437, no. 7063, pp. 1299–1320, 2005.
  18. F. Frommlet, F. Ruhaltinger, P. Twarog, and M. Bogdan, “A model selection approach to genome wide association studies,” 2010, http://arxiv.org/abs/1010.0124.
  19. H. R. Luo, G. A. Moreau, N. Levin, and M. J. Moore, “The human Prp8 protein is a component of both U2- and U12-dependent spliceosomes,” RNA, vol. 5, no. 7, pp. 893–908, 1999. View at Publisher · View at Google Scholar · View at Scopus
  20. P. A. Sharp and C. B. Burge, “Classification of introns: U2-type or U12-type,” Cell, vol. 91, no. 7, pp. 875–879, 1997. View at Publisher · View at Google Scholar · View at Scopus
  21. A. N. Shelling, R. Butler, T. Jones, S. H. Laval, J. M. Boyle, and T. S. Ganesan, “Localization of an epithelial-specific receptor kinase (EDDR1) to chromosome 6q16,” Genomics, vol. 25, no. 2, pp. 584–587, 1995. View at Publisher · View at Google Scholar · View at Scopus
  22. K. Kok, R. Hofstra, A. Pilz et al., “A gene in the chromosomal region 3p21 with greatly reduced expression in lung cancer is similar to the gene for ubiquitin-activating enzyme,” Proceedings of the National Academy of Sciences of the United States of America, vol. 90, no. 13, pp. 6071–6075, 1993. View at Scopus
  23. S. H. Ignatius Ou, W. U. Foon , D. Harrich, L. F. García-Martínez, and R. B. Gaynor, “Cloning and characterization of a novel cellular protein, tdp-43, that binds to human immunodeficiency virus type 1 tar dna sequence motifs,” Journal of Virology, vol. 69, no. 6, pp. 3584–3596, 1995.
  24. J. Chen and Z. Chen, “Extended Bayesian information criteria for model selection with large model spaces,” Biometrika, vol. 95, no. 3, pp. 759–771, 2008. View at Publisher · View at Google Scholar · View at Scopus