- About this Journal ·
- Abstracting and Indexing ·
- Advance Access ·
- Aims and Scope ·
- Annual Issues ·
- 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

Computational and Mathematical Methods in Medicine

Volume 2012 (2012), Article ID 586246, 5 pages

http://dx.doi.org/10.1155/2012/586246

## A Gene Selection Method for Cancer Classification

^{1}Faculty of Mathematics and Computer Science, Fuzhou University, Fuzhou 350002, China^{2}School of Public Health, Fujian Medical University, Fuzhou 350004, China

Received 19 July 2012; Revised 11 October 2012; Accepted 22 October 2012

Academic Editor: Reinoud Maex

Copyright © 2012 Xiaodong Wang and Jun Tian. 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

This paper proposes a method to select a set of genes from a large number of genes with the ability of classifying types of diseases. The proposed gene selection method is designed according to correlation analysis and the concept of 95% reference range. The method is very simple and uses the information of all genes. We have used the method in leukemia patients and achieved good classification results.

#### 1. Introduction

In the clinical treatment of cancer, the corresponding treatment methods and measures are based on the correct classification of tumors. The traditional classification methods are based on tumor cell morphology, but sometimes tumors with the same histopathological type have different responses to treatment. So it becomes the current hot research topic to classify the tumor type using genomics [1, 2].

The gene chip experimental technology has provided a strong technology platform for tumor classification in genomics. By the discrimination analysis of gene expression levels in patients with different types of disease, the discrimination function established can be used to assist classification of clinical cases [3, 4].

As the gene chips have a very large number of genes, not all of these genes will provide information on the classification of type. When the expression levels of genes in different types of tissue samples do not change much, these genes have statistically no or only small discrimination capability. These genes are redundant.

Excluding these genes without classification capabilities will help to optimize the gene discrimination function which will be convenient for practical use. Therefore, it is necessary to select the genes with classification capabilities from a large number of genes [5].

Stepwise discrimination analysis is a commonly used statistical method for variable selection. However, for tissue samples containing thousands of genes, the stepwise discrimination analysis module in commonly used statistical software packages such as SAS and SPSS cannot function properly.

This paper presents a gene screening method that can analyze the classification capabilities of genes from thousands of genes and select the genes helpful to gene classification. The present new method has achieved good results in practice.

In the following sections we describe our studies on the statistical method for gene screening with discriminating ability in tumor classification.

In Methods we describe our new method for gene screening.

In Results we provide an application of our method in the study of the classification of leukemia patients.

Some concluding remarks are presented in Discussion.

#### 2. Methods

Let a kind of disease have two subtypes and . There are in total cases of the disease. Of these, cases are type and cases are type . One tumor tissue sample was obtained from each of the patients. The expression levels of the genes of each tissue sample were detected by gene chip.

##### 2.1. The Correlation Coefficients Computation for Each Gene and the Classification Vector

If we list the cases of type first and the cases of type come in the tail, then the corresponding classification vector will be , where corresponds to the case . If the case is of type , then , otherwise , . Therefore, the classification vector has the form .

Let the mean and standard deviation of the score for gene in the tissue samples of type be and , respectively. Similarly, the mean and standard deviation of the score for gene in the tissue samples of type will be and .

The correlation coefficient for gene and the classification vector is defined as

The greater the absolute value of , the stronger the correlation of gene and the classification vector . In other words, the gene has the ability to distinguish between type and type .

From formula (1) we can compute for genes .

##### 2.2. Determine the Critical Value of Gene Screening

Let be random permutation vectors of the classification vector .

We now perform the following three steps of computation for each random permutation vector , .(1)Collect the first cases in to a set denoted as and the remaining cases in to a set denoted as .(2)For , compute and corresponding to in and and corresponding to in , respectively.(3)For , compute

From the computation above, we obtain the correlation coefficients for the gene expression levels and the random permutation vector , as follows:

For a given value and vector , denote the number of genes having correlation coefficients not less than as and the number of genes having correlation coefficients not greater than as .

For all , , we can define the following formulas: where is the number of genes having correlation coefficients with vector not less than and is the number of genes having correlation coefficients with vector not greater than , .

The right 5% quantile of the items is denoted as and the right 5% quantile of the items is denoted as .

By increasing the value of gradually we can get

If we draw two curves of and on the plane, we can see they have one intersection. The abscissa of the intersection is denoted as (see Figure 1).

Similarly, for each we also have

If we draw two curves of and on the plane, we can see they have one intersection. The abscissa of the intersection is denoted as (see Figure 2).

Let . If , then gene is considered to have the ability to distinguish between type and type . Therefore, it can be used as the index of the discrimination function for all , .

#### 3. Results

We have applied our method in the study of the classification of leukemia patients. We obtained a data matrix by taking tissue samples from 38 cases of clinically diagnosed leukemia patients and 7129 gene expression levels being detected for tissue samples of each case. Of the 38 cases, 27 cases had been diagnosed as acute lymphoblastic leukemia (ALL) and 11 cases are acute myeloid leukemia (AML). Before the two-type discrimination analysis, the 7129 genes are screened first using the method presented in this paper.

There are 38 components in the classification vector , whichrepresentsthe original classificationvector. The first 27 components of are 1 and the last 11 components of are 0. The correlation coefficients of the expression level for each gene and the classification vector are computed by formula (1). Table 1 is the frequency distribution table for the 7129 absolute values of the correlation coefficients.

We generate 500 random permutation vectors by 500 times of random permutation of the vector . The correlation coefficients of the expression level for each gene and the classification vector are computed by formula (1) (, ).

For the 6 values of between and all (), we compute and by formula (5) then their right 5% quantiles and . The computation results are shown in Tables 2 and 3.

From the data of Tables 2 and 3, we can draw the corresponding curves as shown in Figures 3 and 4.

From Figures 3 and 4 we can read and .

Therefore, .

There are in total 893 genes satisfying .

By a two-type discrimination analysis for the tissue samples of the 38 leukemia patients using the 893 gene expression levels as variables, we can build a discrimination function. The 38 patients were identified and classified by using the discrimination function (discrimination function retrospective assessment). The miscarriage of justice was 0.

We have established a prospective evaluation of the discrimination function.

The data are taken from the website of the Broad Institute of MIT [6]. There are total 34 cases of leukemia patients (of which 20 cases of ALL and 14 cases of AML). The 893 gene data were substituted into the discrimination function and classified by type. The miscarriage of justice was 0.02.

Based on the above assessment, we believe the discrimination function established by selecting 893 genes with distinguishing capability from the 7129 genes using our method can be a good discrimination function for classifying leukemia patients and it will provide a good reference for the effective treatment.

#### 4. Discussion

In the statistical methods of classification, the stepwise discrimination analysis is mainly used for variable selection. As the number of data in gene microarrays can be very large, the stepwise discrimination analysis module in commonly used statistical software packages such as SAS and SPSS would not function properly. We have tried to filter genes with classification ability for the whole sample of 7129 genes of the 27 cases of lymphoblastic leukemia and the 11 cases acute myeloid leukemia. The computer program crashed when a discriminant analysis or principal component analysis method was applied since the number of genes was too large. Therefore, we cannot perform discriminant analysis or principal component analysis for the data set on a personal computer.

Therefore, on such a large number of gene chip data for screening, using stepwise discrimination analysis to filter genes with classification ability in a personal computer is infeasible.

A common solution to this problem is to divide the large number of gene data into several groups of genes. The genes with classification ability in each group are selected by the stepwise discrimination analysis of the gene expression levels within each group. Finally, these discrimination functions of each group are combined to build a discrimination function for the whole of genes.

However, this method is also inadequate because the links between genes are separated artificially by gene group division. As tumors are diseases with multigene combined effects, separating the links between genes will reduce the classification ability of the final selected genes. It will in turn affect the subsequent analysis of the classification accuracy on new samples and the results are also not easy to explain [7].

In addition, how many groups of genes are to be divided into is also subjective and this will directly affect the final result for screening of the genes.

The principle idea behind our random permutation vectors method is very similar to a statistical approach, called Randomization Test [8], which is widely used in many applications. The application of the method implies that we have to enumerate all possible combinations of the elements in vector and this is often a very difficult task. In the cases of this paper, there are total different combinations if we divide the 38 cases of leukemia patients into two groups of 27 and 11 cases, respectively. This huge number of combinations is really a restriction for us to apply the Randomization Test method to our cases. Therefore, we use the Monte Carlo sampling method further to the vector to generate 500 random combinations. These 500 combinations are 500 random samples of all possible combinations of elements in vector . Although the results of 500 samples do not produce an exact answer, it can be close to the exact answer [9]. In order to make the results closer to the exact answer, we may increase the number of random samples. For example, we may increase the number of random samples to 1000 or more in our cases.

Our presented method applies to selecting the genes with the ability of classifying types of diseases from a large number of genes. Compared to the stepwise discrimination analysis by groups, the new method has an obvious advantage of the full usage of information of all genes.

The new method has a low computational complexity and is very practical in practice. The main costs of computation are in the correlation coefficient computation when we need a random permutation vector from the vector and this is not a difficult task for common personal computers.

In the real analysis circumstance, if there are too many genes with their absolute value greater than , then the value of can be adjusted to . The value of can be adjusted according to the actual situation. The feasibility of the adjusted value of can be checked by a retrospective assessment of the discrimination function established on the selected genes.

#### Conflict of Interests

The authors have declared that no conflict of interests exists.

#### Acknowledgments

The authors would like to thank the anonymous referees for their many constructive comments and suggestions for enhancing the quality of the paper. The work is made available under the Creative Commons CC0 public domain dedication. This work was partially funded by the Foundation of Science and Technology of Fengze under Grants nos. 2009FZ24 and 2010FZ02 and the Haixi Project of Fujian under Grant no. A099.

#### References

- E. R. Dougherty, J. Barrera, M. Brun et al., “Inference from clustering with application to gene-expression microarrays,”
*Journal of Computational Biology*, vol. 9, no. 1, pp. 105–126, 2002. View at Publisher · View at Google Scholar · View at Scopus - T. R. Golub, D. K. Slonim, P. Tamayo et al., “Molecular classification of cancer: class discovery and class prediction by gene expression monitoring,”
*Science*, vol. 286, no. 5439, pp. 531–527, 1999. View at Publisher · View at Google Scholar · View at Scopus - J. Quackenbush, “Computational analysis of microarray data,”
*Nature Reviews Genetics*, vol. 2, no. 6, pp. 418–427, 2001. View at Publisher · View at Google Scholar · View at Scopus - A. Zhang,
*Advanced Analysis of Gene Expression Microarray Data*, World Scientific, London, UK, 2006. - M. Dehmer and F. Emmert-Streib,
*Analysis of Microarray Data: A Network-Based Approach*, Wiley-VCH, 2008. - http://www.broadinstitute.org/.
- J. Dopazo, E. Zanders, I. Dragoni, G. Amphlett, and F. Falciani, “Methods and approaches in the analysis of gene expression data,”
*Journal of Immunological Methods*, vol. 250, no. 1-2, pp. 93–112, 2001. View at Publisher · View at Google Scholar · View at Scopus - J. W. L. Hooton, “Randomization tests: Statistics for experimenters,”
*Computer Methods and Programs in Biomedicine*, vol. 35, no. 1, pp. 43–51, 1991. View at Publisher · View at Google Scholar · View at Scopus - http://www.uvm.edu/~dhowell/StatPages/Resampling/RandomizationTests.html.