New Research In
Physical Sciences
Social Sciences
Featured Portals
Articles by Topic
Biological Sciences
Featured Portals
Articles by Topic
 Agricultural Sciences
 Anthropology
 Applied Biological Sciences
 Biochemistry
 Biophysics and Computational Biology
 Cell Biology
 Developmental Biology
 Ecology
 Environmental Sciences
 Evolution
 Genetics
 Immunology and Inflammation
 Medical Sciences
 Microbiology
 Neuroscience
 Pharmacology
 Physiology
 Plant Biology
 Population Biology
 Psychological and Cognitive Sciences
 Sustainability Science
 Systems Biology
Thousands of samples are needed to generate a robust gene list for predicting outcome in cancer

Communicated by Leo Sachs, The Weizmann Institute of Science, Rehovot, Israel, February 15, 2006

↵ ^{†}L.E.D. and O.Z. contributed equally to this work. (received for review February 1, 2006)
Abstract
Predicting at the time of discovery the prognosis and metastatic potential of cancer is a major challenge in current clinical research. Numerous recent studies searched for gene expression signatures that outperform traditionally used clinical parameters in outcome prediction. Finding such a signature will free many patients of the suffering and toxicity associated with adjuvant chemotherapy given to them under current protocols, even though they do not need such treatment. A reliable set of predictive genes also will contribute to a better understanding of the biological mechanism of metastasis. Several groups have published lists of predictive genes and reported good predictive performance based on them. However, the gene lists obtained for the same clinical types of patients by different groups differed widely and had only very few genes in common. This lack of agreement raised doubts about the reliability and robustness of the reported predictive gene lists, and the main source of the problem was shown to be the small number of samples that were used to generate the gene lists. Here, we introduce a previously undescribed mathematical method, probably approximately correct (PAC) sorting, for evaluating the robustness of such lists. We calculate for several published data sets the number of samples that are needed to achieve any desired level of reproducibility. For example, to achieve a typical overlap of 50% between two predictive lists of genes, breast cancer studies would need the expression profiles of several thousand early discovery patients.
One of the central challenges of clinical cancer research is prediction of outcome, i.e., of the potential for relapse and for metastasis. Identification of aggressive tumors at the time of diagnosis has direct bearing on the choice of optimal therapy for each individual. The need for sensitive and reliable predictors of outcome is most acute for early discovery breast cancer patients. Adjuvant chemotherapy is recognized to be useless for ≈75% of this group (1); it is believed that after surgery a large majority of these patients would remain disease free without any treatment. Nevertheless, they are often submitted to the same therapeutic regimen as the small fraction of those who really need chemotherapy and benefit from it.
Considerable effort has been devoted recently to outcome prediction for several kinds of cancer on the basis of gene expression profiling (2–8), with special emphasis on breast carcinoma (9–13). Several of these studies reported considerable predictive success. These successes were, however, somewhat thwarted by two problems: (i) when one group’s predictor was tested (G. Fuks, L.E.D., and E.D., unpublished data) on another group’s data (for the same type of cancer patients), the success rate decreased significantly; and (ii) comparison of the predictive gene lists (PGLs) discovered by different groups revealed very small overlap. These problems indicate that the currently used PGLs suffer from instability of their membership and of their predictive performance. These statements are well illustrated by two prominent studies of survival prediction in breast cancer. Wang et al. (11), using the Affymetrix technology, analyzed expression data obtained for a cohort of 286 patients with early discovery. They identified and reported a PGL of 76 genes. van’t Veer et al. (9) used Rosetta microarrays to study 96 patients and produced their own list of 70 genes, which were subsequently tested successfully on a larger cohort of 295 patients (10). Each group achieved, using its own genes on its own samples, good prediction performance. However, the overlap between the two lists was disappointingly small: only three genes appeared on both! ^{§}
^{§}Because different platforms were used, the maximal possible number of shared genes is 55.
Furthermore, the discriminatory power of the two classifiers, as found on their own data sets, was not reproduced when testing them on the samples of the other study (G. Fuks, L.E.D., and E.D., unpublished data).These intriguing problems have received great attention by the community of cancer research and have been addressed in several topical studies. The obvious and most straightforward explanation of these apparent discrepancies is to attribute them to (i) different groups using cohorts of patients that differ in a potentially relevant factor (such as age), (ii) the different microarray technologies used, and (iii) different methods of data analysis. EinDor et al. (14) have shown that the inconsistency of the PGLs cannot be attributed only to the three trivial reasons mentioned above. To this end, they focused on a single data set (9) and repeated many times precisely the analysis performed by van’t Veer et al., thereby eliminating all three differences listed above. Generating many different subsets of samples for training, they showed that van’t Veer et al. (9) could have obtained many lists of equally prognostic genes and that two such lists (obtained by using two different training sets generated from the same cohort of patients) share, typically, only a small number of genes. This discovery was supported by Michiels et al. (15), who did not limit their attention to breast cancer and investigated the stability of seven PGLs published by seven large microarray studies. They showed that the prediction performances that were reported in each study on the basis of its published gene list were overoptimistic in comparison with results obtained by reanalysis of the same data performed (using different training sets) by Michiels et al. (15). Furthermore, they showed, much in the same way as in ref. 14, that the PGLs reported by the various groups were highly unstable and depended strongly on the selection of patients in the training sets. Ioannidis (16), in a comment to ref. 15, and Lonning et al. (17), in a review on genomic studies in breast cancer, cast doubt on the maturity of the published lists to implementation in a routine clinical use and suggest that small sample sizes might actually hinder identification of truly important genes. Similar criticism was expressed in two recent reviews (18, 19), which raise several methodological problems in the process determining the prognostic signature. They conclude that further research is required before applying the identified markers in a routine clinical use.
An obvious question is: Why does one need a short list of predictive genes? There are at least three reasons for this need. The first reason is technical and goes back to a problem well known in machine learning. In general, the number of genes on the chip is in the ten thousands, and the number of samples is in the hundreds. Hence, by using all genes to classify the samples into good and bad outcome, we take a high risk of overtraining, i.e., of fitting the noise in the data, which may increase the generalization error (the error rate of the resulting predictor on samples that were not used during the training phase). The second reason has to do with our desire to gain some biological insight about the disease: One hopes that the genes that are the most important and relevant for control of the malignancy also will appear on the list of the most predictive ones. Third (and least important), a relatively small number of predictive genes will allow inexpensive mass usage of a customdesigned prognostic chip. The second of these points was questioned by Weigelt et al. (20); these authors addressed further the instability of PGLs and concluded that the membership of a gene in a prognostic list is not necessarily indicative of the importance of that gene in cancer pathology.
These findings raise another question: Why should one worry about the diversity of the derived short PGLs? Clearly, had the predictor based on one group’s genes worked well on patients of other studies, one would not have had to worry about list diversity. However, the observed lack of transferability of predictive power may well be because of the same reason that causes instability of the gene lists. Because one hopes that by generating more stable PGLs one will obtain more robust predictors as well, and in light of their tremendous potential for personalized therapy, assessing the stability of these lists is crucial to guarantee their controlled and reliable utilization.
So far, the lack of stability of these PGLs has been either ignored or demonstrated for a particular experiment by reanalysis of the data. Here, we propose a mathematical framework to define a quantitative measure of a PGL’s stability. Furthermore, we present a method that uses existing data of a relatively small number of samples to project the expected stability one would obtain for a larger set of training samples, thereby helping to design an experiment that generates a list that has a desired stability.
To this end, we introduce a previously undescribed mathematical method for evaluating the stability of outcome PGLs for different cancer types. To measure list stability, we introduce a figure of merit f, which varies between 0 and 1; the higher its value, the more stable the PGL. We show how this figure of merit increases with the number of training samples and determine the number of training samples needed to ensure that the resultant PGL meets a desired level of stability. We perform a comparative study of list quality in several cancer types, using a collection of gene expression data sets supplemented by outcome information for the patients.
Overview and Notation
Denote by N _{g} the number of genes from which a PGL is to be selected: either the total number of genes on the chip or the number of those that pass a relevant filter (such as significant expression in at least a few samples or variance above a threshold). Either way, N _{g} ≈ 10,000. The expression levels measured in n samples are used for gene selection and, subsequently, for construction of a predictor of outcome. These samples are routinely referred to as the “training set”; usually n is on the order of a few tens, up to a few hundreds. For each gene, a predictive score is calculated on the basis of its expression over the training set, and the genes are ranked according to this score. The N _{TOP} topranked genes are selected as members of the PGL. Usually (9) N _{TOP} is determined by incrementing the number of genes on the list and monitoring the success rate of the resulting predictor, using crossvalidation. Broadly speaking, the success rate increases, peaks, and decreases (21, 22), and the optimal number of genes is used as N _{TOP} . Because determination of N _{TOP} is outside the scope of our work, we use a free parameter, α = N _{TOP} /N _{g} , and calculate our results as a function of α. In typical studies N _{TOP} ≈ n; hence, for our problem α ≈ 0.01.
The figure of merit we introduce and use here, f, is the overlap between two PGLs, obtained from two different training sets of n samples in each. That is, 0 ≤ f ≤ 1 is the fraction of shared genes (out of N _{TOP} ) that appear on both PGLs; the closer f is to 1, the more robust and stable are the PGLs obtained from an experiment.
Our central point is that because the n samples of the training sets are chosen at random from the very large population of all patients, the figure of merit f is a random variable. The aim of our work is to calculate P _{n} _{,} _{α} (f), the probability distribution of f.
Once this distribution has been determined, we are able to answer the following question: For given n and α, what is the probability that the robustness f of the PGL exceeds a desired minimal level? This question is related to the classical concept of probably approximately correct (PAC) learning (23), which we generalize here to “PAC sorting.” Alternatively, we can answer a question such as: How many training samples are needed to construct a PGL whose expected f exceeds a desired value?
Results
Analytical Derivation of P_{n} _{,α}(f).
Our central result, correct to order 1/N _{g}, is that this probability distribution has the form Hence, the probability distribution of f is a Gaussian; We have calculated (see Supporting Text, which is published as supporting information on the PNAS web site) the mean f*_{n} and variance Σ_{n} ^{2} as functions of N _{g} , α, and n We have found that Σ _{n} ∼ 1/N _{g} , and hence in the limit of infinite N _{g} the overlap between any two PGLs is fixed at f*_{n} and does not depend on the specific realization of the training set, but only on its size n.
Testing the Validity of Our Assumptions.
As described in Materials and Methods, our analytical calculation is based on several assumptions on the model generating the data we have at hand. The extent to which any of these assumptions is fulfilled for reallife data sets varies from case to case and may affect the extent to which our analytical results can be used for a particular data set. Importantly, one can test the correctness of the assumptions by using the real data. A detailed analysis of our assumptions for each of the data sets we have investigated, presented in Supporting Text, shows that our assumptions hold. Excellent agreement between simulations and the analytic calculation was found in five of the six data sets studied.
Breast Cancer Expression Data.
Fig. 1 b shows the probability distributions of f, estimated from the data of ref. 10. We set α to 0.0046, which corresponds to a PGL of size 70, and present P _{n} _{,} _{α} (f) for several values of n. Note that the analytical calculation can be performed for any n irrespective to the number of samples used in the actual experiment (10). As n increases, the typical overlap f*_{n} increases as well; for the range of n shown, the width of the distribution, Σ _{n} , also increases (for large n it will start to decrease). In Fig. 1 a, we show the variation of f*_{n} with n. Importantly, we see that for these moderate values of n the typical overlap between two PGLs, obtained from two training sets, is of the order of a few percents! For two randomly selected lists of αN _{g} genes, one expects f ≈ α. In Table 1, we show the number of samples needed to achieve a desired level of overlap between a pair of PGLs produced from two randomly chosen training sets. Suppose that we wish to know how many samples are needed to guarantee, with confidence level 1 − δ, that the PGL produced by these samples has an overlap f (with a hypothetical PGL obtained from an independent cohort with the same number of samples) that exceeds a desired level f _{c} = 1 − ε. The number of samples n, needed to achieve this goal is given in column 3 of Table 1 for the data of ref. 10, for a PGL of 70 genes, and in column 4 for ref. 11, for a PGL of 76 genes. When δ = 0.5, we have f _{c} = f*_{n} so that to achieve a typical overlap of f*_{n} = 0.50, n = 2,300 samples are needed for the data of ref. 10 and 3,142 for the data of ref. 11.
Comparing Data from Several Groups and Types of Cancer.
We analyzed the stability of PGLs obtained from geneexpression data from various cancer types: breast (10, 11), lung (3, 7), lymphoma (5) and hepatocellular carcinoma (24). First, we checked the agreement between simulations and our analytic prediction. The results, presented in Fig. 2, show that simulations coincide with the analytical results for the mean and the standard deviation of the overlap between two measured lists, for five of the six data sets studied. Once agreement between simulations and the analytic calculation is established for a particular study, we can rely on the analytic results for values of n that exceed the range that is currently experimentally available. If no agreement is found, we can extrapolate the results of the simulations.
The results are shown in Fig. 3, which presents the expected overlap f*_{n} for all data sets, thus enabling one to compare the robustness of the PGLs obtained using different microarrays and for different cancers. One can see a clear hierarchy of cancers with respect to their PGLs robustness, where hepatocellular carcinoma is most stable, breast cancer ranked second, acute lymphocytic leukemia is third, and lung cancer is characterized by the lowest stability. This result may reflect the difficulty of outcome prediction in the different cancers where survival of hepatocellular carcinoma patients is the easiest to predict, whereas survival prediction in lung cancer is most difficult.
Summary and Conclusions
We introduced probably approximately correct (PAC) sorting, a previously undescribed mathematical method for calculating the quality of the PGLs obtained in an experiment, by measuring the overlap f between pairs of gene lists produced from different training sets of size n. We proved that the method can predict with high accuracy P _{n} _{,} _{α} (f), the probability distribution of f, for any n. Because gene expression profiles are believed to possess high potential of outcome prediction, and such PGLs will be put to clinical prognostic use, obtaining information about their quality and robustness is crucial. Moreover, by discovering the relationship between n, the number of training samples used to obtain a gene list and the quality of the resultant list, our method provides a means for efficient experimental design. Given any desired list quality, we can calculate the number of samples required to achieve it in a particular experiment. Furthermore, by finding the mathematical expressions for P _{n} _{,} _{α} (f), we gain an insight into the problem of instability of PGLs, discussed at the beginning of this work. In Materials and Methods, we introduce two distributions, q(C _{t} ) and p′_{n}(Z; Z _{t} ), and show that the instability is governed mainly by the magnitude of q(C _{t} ) near the values that correspond to the top αN _{g} correlations, and by the variance σ_{n} ^{2} of p′_{n}. These two factors determine the sensitivity of the PGL’s composition to random selection of the training set. Our method can be extended to deal with applications to a wide variety of feature selection problems, including pattern recognition and text categorization.
Materials and Methods
The analytical calculations rely on our ability to use available expression data to estimate two distributions, p′_{n}(Z; Z _{t} ) and q(Z _{t} ), which we define now.
Scoring Genes by Their “Noisy” Correlation with Outcome.
We used one of the accepted ways (9–11, 15) to represent outcome: as a binary variable, with 1 for good and 0 for bad outcome. A sample (patient) is designated as “good outcome” if the metastasis and relapsefree survival time exceeds a threshold, or “bad” if it does not. The simplest score of a gene’s predictive value is the Pearson correlation C of outcome with the gene’s expression levels. ^{¶}
Actually, the absolute values C matter for ranking genes, because negative correlation is as informative as positive.
Measuring a gene’s correlation with outcome over several different training sets of n samples yields different values of C; i.e., our measurement of a gene’s C is noisy, taken from some distribution p _{n} (C; C _{t} ) around the “true” value C _{t} . ^{‖}C _{t} corresponds to measuring C over an infinite number of samples (here, over all of the early discovery cancer patients in the world). Obviously, the numbers C _{t} are not known, but they exist.
The deviation of a gene’s measured C from C _{t} , referred to as “noise,” is due to the variation of the measured correlations when the n samples of the training set are randomly selected; it is one of the factors that governs the diversity or lack of robustness of the PGL. Large noise causes large differences in a gene’s correlation when measured over different subsets of samples, potentially inducing large shifts in a gene’s rank, which induce instability of the PGL.The Distributions p_{n} (C;C_{t} ) Are Different for Each Gene.
A simple transformation on the correlations produces new variables Z = tanh^{−1}(C). Under certain assumptions (25, 26) their distribution, p′_{n}(Z; Z _{t} ), is approximately a Gaussian around the true value Z _{t} = tanh ^{−1} (C _{t} ), with identical variances for all of the genes, given by σ_{n} ^{2} = 1/(n − 3). These assumptions do not necessarily hold for all expression data; we found that the distribution of the noise is Gaussian to a good approximation, and in our analytical calculations we use the same variance for all genes, but this variance has to be estimated for each experiment from the measured data.
The Distribution of the True Correlations,q(Z_{t} ), Is Another Important Factor That Affects the Diversity of the PGL.
When the training set changes, the measured Z of each gene changes (by the noise described above). As a result, genes will move in and out of the interval that contains the N _{TOP} highestranked ones. Higher density of genes in this interval increases the sensitivity (to noise) of a top gene’s rank, resulting in a more unstable PGL. We estimate V _{t} , the variance of q(Z _{t} ), from the data, as described below, and for the analytic calculation approximate q(Z _{t} ) by a Gaussian of variance V _{t} and mean zero.
Analytical Calculation.
Here we present only an outline of the method; a concise description is in Supporting Text and also Figs. 4–6, which are published as supporting information on the PNAS web site. We do review here the assumptions that are made about the expression data and the approximations taken to carry out the calculation.
Assumption 1.
The distributions of the measured Z values are Gaussian, centered for each gene around its Z _{t} .
Assumption 2.
The variance σ_{n} ^{2} is the same for all genes.
Assumption 3.
The noise variables Z − Z_{t} are independent (i.e., uncorrelated noise for different genes).
Assumption 4.
q(Z _{t} ), the distribution of the true correlations, can be approximated by a Gaussian with variance V_{t}. This assumption is easily generalized to represent q(Z _{t} ) as a mixture of Gaussians.
Under these assumptions, we can write down an expression for P _{n} _{,} _{α} (f), which reflects a process of (i) drawing N _{g} independent true correlations Z _{t} from the distribution q(Z _{t} ), (ii) submitting each to a Gaussian noise of variance σ_{n} ^{2}, and (iii) identifying the αN _{g} top genes. Submitting the N _{g} true values to another realization of the noise, we obtain another list of αN _{g} genes. Note that for finite n the lists are expected to be different because of noise (nonvanishing σ_{n} ^{2}). The probability to obtain an overlap f between two PGLs, P _{n} _{,} _{α} (f), is given by where δ(.) is the Kronecker delta, Nr is a normalization factor, and Z _{tj} is the true correlation of the jth gene with outcome. h = (h _{1} , . . ., h _{Ng}) and l = (l _{1} , . . ., h _{Ng}) are binary vectors of size N _{g} whose nonzero elements correspond to the genes included in the measured N _{TOP} of the first and the second realizations, respectively.
Approximation: 1/N_{g} expansion:
By using mathematical manipulations, we represent Eq. 2 as a multivariate integral over N _{g} variables and calculate it using saddlepoint integration and expansion (to first order) in 1/N _{g} , a technique widely used in theoretical physics (27, 28). We have tested and found this to be an excellent approximation, as expected (because N _{g} ≫ 1/α ≈ 100).
Some singlevariable integrations have to be done numerically to obtain the final result, Eq. 1 , i.e., that P _{n} _{,} _{α} (f) is a Gaussian, with mean f *_{n} and variance Σ_{n} ^{2} that we know how to calculate on the basis of available data (see Supporting Text).
Derivation of the Variances σ_{n}^{2} and V_{t} from Real Data.
As mentioned above, the two major components that affect P _{n} _{,} _{α} (f) are q(Z _{t} ), the probability distribution of the true Z values, and the noise variance σ_{n} ^{2}. Yet, for real data sets, one knows only the N _{g} measured Z values, obtained for each of the N _{g} genes on the basis of their expression levels in n samples, n ≤ N _{s} . Hence, we have access to the measured probability distribution q _{n} (Z), and to the expression data, from which we have to reconstruct the true distribution q(Z _{t} ) and the variance of the noise, σ_{n} ^{2}.
If the noises of the different genes are identical independent Gaussian random variables, the measured q _{n} (Z) is obtained from the true one by adding noise to each Z _{t} , yielding To determine σ_{n} ^{2} and V _{t} , we randomly select from the full available set of N _{s} samples, 200 training sets of n samples. For each training set, we calculate the Z values of all genes, and the variance of the resulting “measured” distribution. Thus, we end up with 200 variances obtained from the 200 training sets of n samples. Denote by V(n) the average of these 200 measured variances; this value is our estimate of var[q _{m} (Z)] obtained for n samples. Repeating this procedure for n = n _{0} , …, N _{s} yields a series of variances V(n). Because the noise is due to the finite number n of samples in a training set, the variance of the noise approaches zero as n → ∞; hence, extrapolation of V(n) to n = ∞ yields our estimate of V _{t} .
Motivated by the form σ_{n} ^{2} = 1/(n − 3) given by Fisher (25, 26), we fit the measured V(n) to where b < 0, and hence V _{t} = c. We see from Eqs. 3 and 4 that if the noise is uncorrelated, a·(n − 3) ^{b} = σ_{n} ^{2}. Indeed, we get for most data sets a ≈ 1 and b ≈ −1 (see Table 2, which is published as supporting information on the PNAS web site). Note that our analytical calculation assumes uncorrelated noise. To test this assumption, we estimate the variance of the noise in an independent, more direct way (see below); deviation of this estimate, σ̂_{n} ^{2}, from a·(n − 3) ^{b} implies that the noise is correlated, and Assumption 3 of our analytical method does not hold. We claim that when this assumption breaks down, by setting we create an “effective problem” with uncorrelated noise, which provides a good approximation to the original problem. To prove our claim we used Eq. 5 to get our analytical prediction of f as a function of n. Comparison with simulations (see below) reveals good agreement, which supports our claim.
Simulations to Measure the Distribution of f.
To perform these simulations, we created a model that enables us to generate an unlimited number of samples. The motivation for generating the samples in this particular way is described in Supporting Text. Simulations were performed by measuring, for each gene i, the mean and variance of its expression values, first over all good prognosis samples, yielding μ_{g}(i) and σ _{g} (i), and then over all poor prognosis samples, yielding μ _{p} (i) and σ _{p} (i). These means and variances were used to create, for each gene, two Gaussians, G(μ _{g} (i), σ _{g} (i)) and G(μ _{p} (i), σ _{p} (i)), approximating, for n = N _{s} , the probability distribution of the gene expression over the good and poorprognosis samples, respectively. Note that the true distributions were those corresponding to n = ∞. Therefore, the aforementioned Gaussians had to be rescaled to approximate the true distributions. This rescaling was done by adjusting the difference between the means of each pair of Gaussians, μ _{g} (i) − μ _{p} (i), so that the resulting distribution of Z values would fit the true one (see details in Supporting Text). The ultimate set of N _{g} pairs of Gaussians was used to create artificial good and poorprognosis samples in the following way. An artificial poor (good) prognosis patient was generated by drawing N _{g} gene expression values from the N _{g} Gaussians of the poor (good) prognosis population. In this way, we were able to generate an unlimited number of samples (training cohorts), which allowed us to obtain simulation results for any desired n. We generated the PGL of a given training cohort of n samples by calculating for each gene its Z, ranking the genes according to this score and selecting the αN _{g} topranking genes as members of the PGL. We repeated this procedure for 1,000 different cohorts, ending up with 1,000 PGLs. We then calculated the overlap f between 500 independent pairs of PGLs to obtain the distribution of f.
Independent Estimate of the Noise.
To test directly the validity of Assumption 2, an independent estimate of the noise was obtained by randomly drawing 100 cohorts of n samples (see Simulations to Measure the Distribution of f) and for each gene measuring Z for every cohort. We then calculated the variance of these 100 values of Z and averaged it over all genes. The result is our independent estimate σ̂_{n} ^{2} (see Fig. 5).
Extrapolation.
By using the data of a particular experiment, we determined P _{n} _{,} _{α} (f) analytically and by simulations. The advantages of the analytic method are obvious; the disadvantage is that the calculation relies on the validity of certain assumptions, which need to be tested for each data set. Discrepancy between the analytic results and simulations (that are based on the data) indicates that some of the assumptions do not hold; in such a case we rely on the simulations, which are extrapolated to the regime (e.g., number of training samples n) of interest, which usually lies beyond the current experiment’s range. To extrapolate simulation results, the analytical function was multiplied by the factor that yielded the best fit to the simulation curve.
Acknowledgments
This work was supported by grants from the Ridgefield Foundation and the Wolfson Foundation, by European Community FP6 funding, and by the European Community’s Human Potential Program under Contract HPRNCT200200319, Statistical Physics of Information Processing and Combinatorial Optimisation.
Footnotes
 ^{‡}To whom correspondence should be addressed: Email: eytan.domany{at}weizmann.ac.il

Author contributions: L.E.D., O.Z., and E.D. designed research; L.E.D., O.Z., and E.D. performed research; L.E.D. and O.Z. analyzed data; and L.E.D., O.Z., and E.D. wrote the paper.

↵ ^{§}Because different platforms were used, the maximal possible number of shared genes is 55.

↵ ¶ Actually, the absolute values C matter for ranking genes, because negative correlation is as informative as positive.

↵ ‖ C _{t} corresponds to measuring C over an infinite number of samples (here, over all of the early discovery cancer patients in the world). Obviously, the numbers C _{t} are not known, but they exist.

Conflict of interest statement: No conflicts declared.
 Abbreviations:
 PGL,
 predictive gene list.
Abbreviations:
 © 2006 by The National Academy of Sciences of the USA
References
 ↵

↵
 Bair E. ,
 Tibshirani R.
 ↵
 ↵
 ↵
 ↵

↵
 Bhattacharjee A. ,
 Richards W. G. ,
 Staunton J. ,
 Li C. ,
 Monti S. ,
 Vasa P. ,
 Ladd C. ,
 Beheshti J. ,
 Bueno R. ,
 Gillette M. ,
 et al.
 ↵
 ↵
 ↵
 ↵

↵
 Sorlie T. ,
 Perou C. M. ,
 Tibshirani R. ,
 Aas T. ,
 Geisler S. ,
 Johnsen H. ,
 Hastie T. ,
 Eisen M. B. ,
 van de Rijn M. ,
 Jeffrey S. S. ,
 et al.

↵
 West M. ,
 Blanchette C. ,
 Dressman H. ,
 Huang E. ,
 Ishida S. ,
 Spang R. ,
 Zuzan H. ,
 Olson J. A., Jr. ,
 Marks J. R. ,
 Nevins J. R.

↵
 EinDor L. ,
 Kela I. ,
 Getz G. ,
 Givol D. ,
 Domany E.
 ↵
 ↵
 ↵
 ↵

↵
 Brenton J. D. ,
 Carey L. A. ,
 Ahmed A. A. ,
 Caldas C.
 ↵

↵
 Hughes G. F.
 ↵
 ↵
 ↵

↵
 Fisher R. A.

↵
 Fisher R. A.

↵
 Huang K.

↵
 Bleistein N. ,
 Handelsman R. A.