<title>Background</title> <p>Determination of gene function is a central goal of modern biology, and is a starting point for detailed mechanistic studies. Computational approaches can provide predictions of gene function based on the integration of heterogeneous data sources [##REF##16680138##1##, ####REF##15585665##2##, ##REF##15703479##3##, ##REF##14981259##4##, ##REF##15130933##5##, ##REF##16845022##6##, ##REF##16420673##7##, ##UREF##0##8##, ##REF##12826619##9##, ##REF##16723004##10####16723004##10##]. These predictions can serve as a principled method of 'triage', focusing experimental resources on the hypotheses (predictions) that are more likely to be true. Moreover, predictions that are associated with measures of confidence allow experimental biologists to adjust the number of predictions they are willing to consider based on the trade-off between false positive rate, the importance of the biological question, and the cost of follow-up experiments. For example, mouse researchers have been faced for years with the problem of deciding which genes to mutate in reverse-genetic studies, and the problem of deciding which physiological and molecular phenotypes to assay for each mutant strain. Today, there are thousands of Gene Trap alleles [##REF##17203654##11##], and within a few years investigators will have access to a virtually complete collection of engineered knockouts [##REF##17218247##12##]. Issues of both expense and ethics that are associated with model organism experiments motivate the thoughtful justification of planned experiments.</p> <p>Several algorithms have been applied to heterogeneous data sources to predict gene function [##REF##16680138##1##, ####REF##15585665##2##, ##REF##15703479##3##, ##REF##14981259##4##, ##REF##15130933##5##, ##REF##16845022##6##, ##REF##16420673##7##, ##UREF##0##8##, ##REF##12826619##9##, ##REF##16723004##10####16723004##10##,##REF##12855458##13##], with the integration of these sources clearly improving prediction performance [##REF##15998909##14##,##REF##16729037##15##]. However, these studies have been primarily focused on the yeast <italic>Saccharomyces cerevisiae </italic>and other non-mammalian model organisms [##REF##16481336##16##, ####REF##11119305##17##, ##REF##12711213##18####12711213##18##], and it has not been clear how well such algorithms will scale to the large genomes and networks of mammals, despite the basic genetic, biochemical and cellular organizational principles that are shared across the eukaryotic kingdom [##REF##12399590##19##, ####REF##12399572##20##, ##REF##15588312##21####15588312##21##]. Moreover, it is unclear whether accurate function predictions can be made given the amount and quality of genomic and function annotation data available for mammals. (Although genes with even a single annotation are often referred to as genes of 'known function', only a minority has been exhaustively studied. Therefore, most 'known function' genes are still incompletely annotated.) Although comparisons using standardized data sets and performance criteria are the best way to assess the strengths and weaknesses of the algorithms employed [##REF##17611711##22##, ####REF##17160037##23##, ##REF##16869964##24####16869964##24##], our ability to predict gene function using integrated genomic data has not been systematically compared in this way across multiple bioinformatics groups in any organism.</p> <p>We assembled a large collection of <italic>Mus musculus </italic>data, independently developed nine different computational methods using these data to predict gene functions, and compared the predictive performance of each submission using held-out genes, a prospective evaluation, and a focused literature-based assessment of the top novel predictions. We have provided confidence scores and estimates of prediction accuracy (precision) at different levels of sensitivity (recall), and combined the best submissions in a single set of predictions. We report thousands of predicted functions for mouse genes that are supported by multiple data types and algorithms, and share the results via a web resource that facilitates searching and browsing in the context of the underlying supporting evidence.</p> <p>This community effort has suggested new function assignments or refinements of previous annotations for the majority of mouse genes. Based on a prospective evaluation of entirely novel predictions, including many for uncharacterized (without any function annotations) genes, we expect that predictions provided here will productively guide further experimentation towards more likely hypotheses.</p>
<title>Materials and methods</title> <title>Performance statistics</title> <p>To assess performance of function predictions by each method, we obtained the ROC curve and the AUC for each GO term using the trapezoidal rule [##UREF##6##42##]. (The AUC corresponds to the probability that a random positive instance will be scored higher than a random negative instance.) For this assessment, GO annotations were up-propagated. That is, if a gene is associated with a GO term, then this gene is also associated with all the ancestor GO terms of that GO term. During evaluation, refinement predictions are considered false positives.</p> <p>We assessed whether observed differences in AUC between submissions X and Y were statistically significant [##REF##6878708##34##] and computed the precision at various recall rates as previously described [##UREF##7##43##]. Precision is defined as the number of genes correctly classified as having a given GO term divided by the total number of genes classified as having that GO term . Recall is defined as the percentage of genes annotated with a given GO term that were classified as having that GO term . Other performance measures included the AUC up to the first 50 false positives, and the recall obtained at 1% false positive rate. False positive rate is defined as the fraction of genes not annotated with a given GO term that were classified as having that GO term . Tables with the median, mean and standard deviation of all performance measures over the GO terms in each evaluation category are provided for each submission (Additional data files ##SUPPL##6##7## to ##SUPPL##9##10##).</p> <title>Assessing the predictive value of each data type</title> <p>To determine the value of each data type in predicting function, we used the following simple guilt-by-association method; for protein-protein interaction data, we counted the number of times each GO term is annotated among direct interaction partners ('neighbors'). For data sets composed of binary gene features, we considered the neighbors of gene X to be those genes annotated to have the same specific feature, for example, a specific phenotype, disease association, or protein sequence pattern annotation. In the case of non-binary data, for example, expression or phylogenetic profile, neighbors are genes that correlate with X (Pearson correlation coefficient &gt; 0.5). After determining the neighbors of each gene, we sum for each GO term, based on the type of data, either the correlation coefficients, or the number of shared features per neighbor, or the number of the neighbors annotated with GO term X. This value is then used as a score of the function prediction. The contribution of each data set is then assessed considering genes with at least one annotated neighbor in the data set. Tables with the median, mean, and standard deviation of the performance measures over GO terms in each evaluation category per data set are provided in Additional data file ##SUPPL##17##18##.</p> <title>Score transformation</title> <p>Since scores were not necessarily calibrated across GO terms, we developed a monotonic transformation to make scores for different GO terms more comparable. Letting <italic>n </italic>be the total number of genes considered, <italic>t </italic>be the number of existing positive annotations for the current GO term, and <italic>s</italic><sub><italic>i </italic></sub>be the un-calibrated score for the <italic>i</italic><sup>th </sup>gene, the calibrated score for the <italic>i</italic><sup>th </sup>gene  is defined as:  where <italic>L </italic>is the free (non-negative) parameter chosen such that . <italic>L </italic>is found separately for each GO term via a MATLAB optimization routine. After this transformation, the average score for each GO term is equal to the fraction of genes currently annotated with that GO term.</p> <title>Generating a list of high scoring novel predictions for manual investigation</title> <p>To evaluate the quality of top-scoring predictions more closely, we identified the set of submitted predictions that performed best within each of the 12 evaluation categories (according to the P20R measure on held-out genes). Within each of the 12 evaluation categories, gene/term pairs were pooled and ranked by calibrated scores (described above). All currently annotated gene/term pairs were removed, resulting in a ranked list of predictions that are considered classification errors according to current GO annotations, but may in fact be correct. To focus on the highly novel predictions, we also excluded re-predictions and refinement predictions from the list.</p>
<title>Results</title> <title>Organization of a community function prediction comparison</title> <p>The overall structure of our study was to provide groups of investigators (participants) with a collection of data sets in which the gene identifiers were standardized and associated with known functional annotations. The participants then used their algorithms to assign a score reflecting confidence in whether each gene had each function. To enable evaluation of the results, and to calibrate confidence scores for novel predictions within each category, a subset of genes with known functions was 'held out' (that is, function annotations were not given to the participants).</p> <p>We therefore began by assembling an extensive collection of <italic>M. musculus </italic>data, including gene expression across multiple tissues, protein sequence pattern annotations, protein-protein interactions, phenotype annotations, disease associations (of human orthologs), gene function annotations, and phylogenetic profiles from a variety of publicly available sources. (Table ##TAB##0##1## summarizes the data sources; for a full description of the data see the references cited in Table ##TAB##0##1##.) These data sets were chosen because they encompass many genes, and have been shown to contain information reflecting gene function [##REF##16420673##7##,##REF##15588312##21##,##REF##12769716##25##, ####REF##12209140##26##, ##REF##12458004##27####12458004##27##]. Protein interaction data include 'interologs' transferred from other organisms via orthology [##REF##15657099##28##,##REF##15173116##29##]. To avoid circularity, the data collection did not directly include protein or DNA sequences, since homology was employed in establishing many of the annotations, but allowed sequenced-based inference indirectly via phylogenetic profiles and matches to protein sequence patterns. The complete data collection is available from the MouseFunc I website [##UREF##1##30##].</p> <p>To integrate these diverse data sets and associate them with functional annotations, we mapped the gene (or gene product) identifiers used in each data set to a common set of Mouse Genome Informatics (MGI) gene identifiers (as defined 21 February 2006), which are, in turn, associated with Gene Ontology (GO) terms curated by MGI [##REF##10802651##31##,##UREF##2##32##]. Thus, annotations for each gene were the union of annotations made to the set of the gene products for that gene. We excluded GO annotations based solely on the 'inferred from electronic annotation' (IEA) evidence code, since many of these annotations are themselves computational predictions that have not been reviewed by a curator [##UREF##3##33##]. We also excluded GO terms with too few training examples, that is, those annotated to fewer than three genes in the training set, expecting that it would be extremely difficult for current classifiers to deal with such a limited number of positive training examples. To focus on predictions most likely to suggest specific follow-up experiments, we considered only GO terms associated with 300 or fewer mouse genes in the training set. (This threshold was chosen by manually examining GO terms ranked in descending order by the number of genes currently annotated to each term, and subjectively assessing whether predictions of that GO term would immediately suggest a follow-up validation experiment.) The final data collection contained information on 21,603 MGI genes, of which 8,506 were associated with at least one of the 2,815 individual GO terms we considered.</p> <p>An invitation to participate in this assessment was circulated among research groups known to work in gene function prediction. Nine groups ultimately participated by submitting predictions. (For a brief description of the methods used by each, see Table ##TAB##1##2##; for more details see Additional data files ##SUPPL##19##20## and ##SUPPL##20##21##.) The data and annotations were distributed in a form intended to prevent participants from using additional data sources, and to enable cross-validation. First, data were distributed to participants in an 'anonymized' form, with each MGI gene identifier replaced with a randomly generated identifier and presented to participants in permuted order. Thus, participants made predictions without knowing the gene identities or any gene information outside the training data. Second, annotations were omitted for a randomly selected 10% of genes (the 'held-out set').</p> <p>Each group developed and implemented their prediction methodology independently. Each submission was required, for each gene-GO term combination, to include a score (ranging from 0 to 1) reflecting prediction confidence. The data collection was released in July 2006 (with GO annotations obtained from the GO website on 17 February 2006; version 1.612). Initial prediction results were submitted in October 2006, with seven groups submitting complete prediction sets. After viewing performance measures (but not gene identities or information on the veracity of any specific prediction), it was noted that some groups did not provide a complete set of predictions; also, one group withdrew their predictions upon discovering a coding error. In an effort to increase the number and quality of submitted predictions, all groups were given the opportunity to alter their methods and submit new predictions for a second December 2006 deadline, and five groups did so.</p> <title>Performance evaluation</title> <p>To evaluate each set of predictions, we first used the set of held-out genes. GO annotations are an evolving target (annotations are continuously added, deleted, and modified), which enabled us also to perform a prospective evaluation. For this purpose, we also identified the set of genes that had newly acquired an association to a GO term during the eight months since downloading of the version of MGI GO annotation used in training. The GO annotations used for prospective evaluation were obtained from the GO website on 20 October 2006 (version 1.641). To obtain a baseline performance against which to compare predictions from each approach, we employed a naïve Bayes 'straw man' approach. To train this 'straw man' classifier, we used the six sets of binary gene features that are natively in the (gene, property) form, and did not use feature selection (Additional data file ##SUPPL##20##21##). We assessed success for each GO term using area under the receiver operating characteristic (ROC) curve (AUC) [##REF##6878708##34##]; precision was assessed at several fixed recall values (all measures used are defined in Materials and methods). For evaluation purposes, we grouped GO terms in twelve evaluation categories corresponding to all combinations of the three GO branches - Biological process, Molecular function, or Cellular component - with four ranges of 'specificity', that is, the number of genes in the training set with which each term is annotated ({3-10}, {11-30}, {31-100}, and {101-300}).</p> <p>Figure ##FIG##0##1## shows some performance measures of the first round of submissions. Note that team I submitted partial results and was, therefore, not assessed for overall performance in each evaluation category. Team E's results for the prospective evaluation were based on a partial implementation of their algorithm (see details in Additional data file ##SUPPL##19##20##, Box 5). Figure ##FIG##0##1a,b## shows the mean AUC of GO terms within each evaluation category, evaluated using the held-out and newly annotated genes, respectively. Figure ##FIG##0##1c,d## shows for each submission how often its AUC value was significantly better (or worse) than the AUC value of another submission. We assessed significance of difference in AUC between two submissions for each GO term (α = 0.05) using a Z-test [##REF##6878708##34##].</p> <p>In this analysis, most submissions beat the 'straw man' in all categories (both by mean AUC and by number of wins and losses); however, the overall differences among groups were not dramatic. (See Additional data file ##SUPPL##0##1## for a summary of the number of significant wins and losses per evaluation category.) The complete set of performance measures evaluated with the held-out gene set may be found in Additional data file ##SUPPL##6##7## (initial predictions) and Additional data file ##SUPPL##8##9## (revised predictions), while the corresponding prospective evaluation results may be found in Additional data files ##SUPPL##7##8## and ##SUPPL##9##10##. Performance measures reported here are conservative in the sense that false positive predictions (genes predicted as having a GO term that were not currently annotated with that GO term) may actually be correct but not yet annotated as such.</p> <p>In contrast to AUC, the precision at fixed recall values was dramatically higher for all submissions than for the 'straw man'; Figure ##FIG##0##1e,f## shows the proportion of GO annotations reaching various precision values at 20% recall (a threshold selected as 'midrange' for display). Additional data file ##SUPPL##1##2## shows the mean precision at 20% recall for GO terms within each evaluation category, evaluated using both held-out and newly annotated genes. Due to the small number of positives (genes carrying a given annotation) relative to negatives (genes that do not carry the annotation), this characteristic would usually be reflected only in the very left part of the ROC, and is not generally captured by the more commonly used AUC measure. However, precision is a more relevant measure to many end users, since it reflects the proportion of validation experiments for top-scoring predictions that would prove successful.</p> <p>Performance of all submissions differed markedly depending on whether evaluation was on the held-out genes or on newly annotated genes (Figure ##FIG##0##1a,c,e## compared with Figure ##FIG##0##1b,d,f##), suggesting that emerging annotations are qualitatively different from a random sample of previously existing annotations - a variable that is only rarely considered in large-scale predictions of gene function.</p> <p>In fact, the main type of evidence supporting the annotations differs between the new and the held-out annotations; while 50% and 2.5% of newly acquired annotations were derived from sequence or structural similarity (ISS) and reviewed computational analysis (RCA), respectively, the corresponding proportions for held-out annotations were 9% and 31% (Additional data file ##SUPPL##2##3##).</p> <p>Figure ##FIG##1##2## shows the performance of the second round of submissions (Additional data file ##SUPPL##1##2##). In most cases, revised predictions slightly outperform the original ones. All subsequent analyses described here used only one submission per group, choosing the most recent where there were two submissions. The complete evaluation results are available from the MouseFunc I website [##UREF##1##30##].</p> <title>Factors affecting prediction performance</title> <p>To ask whether some data sets were more useful than others, and how their value might vary among evaluation categories, we applied a simple guilt-by-association approach similar to a previously described method [##REF##10573421##35##]. The confidence score for gene X and GO term Y is simply the number of 'neighbors' of X that are currently annotated with Y (see Materials and methods). We evaluated performance after applying this method to only one data set at a time. Figure ##FIG##2##3a## shows precision at 20% recall (P20R) values obtained by each submission on every GO term, and by using each one of the data types as input to the guilt-by-association approach. A striking observation is that protein sequence pattern annotations are the most predictive data type overall and are especially useful for predicting Molecular function GO terms. Expression data, and phenotype and disease associations are important contributors for more general Cellular component and Biological process GO terms. Moreover, interaction data comprise a remarkably useful evidence source, considering that only a small proportion of protein interactions in mammals is known. Figure ##FIG##2##3a## also indicates that hard to learn GO terms are the ones where there is absence of predictive power in all data types. This is especially clear in the specificity range {3-10} in all GO branches. We also examined maximum coverage (number of genes present in a given data set with at least one annotated 'neighbor' when using the simple guilt-by-association method), noting that this coverage allowed functional associations for at most 30% of the 21,603 genes to be predicted given any single data set (Figure ##FIG##2##3b##).</p> <p>Analysis of variance (ANOVA; Additional data file ##SUPPL##10##11##) verified what is clear from Figures ##FIG##0##1a,b##, ##FIG##1##2a,b## and ##FIG##2##3a##; the branch of the ontology is the main factor to explain variance in performance as shown in Figure ##FIG##2##3c,d##. Biological process GO terms, which reflect what biologists would typically consider to be physiological function of genes and most related to phenotypes, are apparently more difficult to predict than Molecular function or Cellular component terms. As expected, more specific GO terms in each evaluation category were more difficult to predict.</p> <p>To explore whether there were commonalities in pattern of performance among the submissions, we examined the correlations among P20R values and grouped the submissions using hierarchical clustering (Additional data file ##SUPPL##3##4##). We identified three pairs of submissions that were grouped together by several correlation measures (data not shown). These pairs of submissions were ('F', 'G'), ('A', 'B'), and ('C', 'D'). Submissions 'F' and 'G' both employ functional linkage, while submissions 'A' and 'B' are mainly kernel-based methods. (Despite the fact that submissions 'E' and 'I' also used functional linkage, their results were uncorrelated with 'F' and 'G'.) Submissions 'A', 'B', 'C', and 'D' each used weighted combinations of diverse data sets, but neither 'A' nor 'B' gave highly correlated results with 'C' or 'D'. Since all participant methods combine several algorithms, require the use of multiple parameters, and vary the procedure for feature design and selection, it is not surprising that differences in results cannot be simply attributed to any one algorithmic choice.</p> <p>To assess the stability of the prediction performance, we measured the performance variability in five randomly chosen subsets of the training data and measured the standard deviations of AUC and P20R performance measures within each evaluation category. The median standard deviations of AUC and P20R across all evaluation categories were 0.01 and 0.02, respectively, suggesting that our performance measures were robustly determined (Additional data file ##SUPPL##11##12##).</p> <p>One of the major challenges in training a classifier is overfitting, that is, generating models that precisely fit the idiosyncrasies of training data at the expense of their accuracy when applied to new data. We assessed overfitting using a standard approach - examining the extent to which performance estimates are exaggerated when one calculates them based on the training data rather than on the held-out test set (Additional data file ##SUPPL##11##12##). For example, Biological process GO terms with specificity {31-100} had a mean P20R value that was increased by a factor of 1.3 (averaged over all submissions) when it was calculated based on the training data rather than the held-out gene set.</p> <p>We note that submissions 'C', 'D' and 'G' are among the top performers on most evaluation categories by various measures. The performance of submission 'C' was particularly strong with respect to AUC. Submission 'D' performs stably across the range of the number of genes annotated to each GO term and its performance was especially good for prospective predictions. Submission 'G' has a strong performance in precision across a range of recalls (Additional data files ##SUPPL##4##5## and ##SUPPL##5##6##). Submission 'E' and 'H' perform better for the most specific evaluation categories. Thus, different methods had different strengths and no prediction method was clearly superior by every criterion.</p> <title>Integration of submissions in a single set of predictions</title> <p>To simplify subsequent analyses for ourselves and other investigators, we derived a single set of prediction scores from the set of submitted scores. We unified the independent submissions for each evaluation category by adopting the scores from the submission with the best P20R value for that evaluation category (evaluated using held-out genes). The combined predictions averaged 41% precision at 20% recall with 26% of GO terms having a P20R value greater than 90%. Figure ##FIG##3##4## indicates the proportion of GO terms at different precision and recall values. (Also see Additional data file ##SUPPL##18##19##; Additional data file ##SUPPL##12##13## lists the precision achieved by the unified predictions at several recall values for each GO term.) To put this prediction performance into perspective, random predictions for a GO term with 30 genes left to be identified would be expected to yield a P20R value of 0.15%. In addition, these precision estimates are conservative since many predictions may ultimately prove correct despite not being currently annotated.</p> <title>Impact of predictions among GO terms for which precision can be well estimated</title> <p>To gain insight into the potential impact of predictions on the current state of gene function annotation, we more closely examined a subset of GO terms in the unified set of predictions. For each GO term, we established the lowest score at which a precision of 30% or better was achieved while recovering at least 10 true positives within the held-out test set (allowing precision to be well estimated). There were 71 GO terms with predictions meeting this criterion (tending to be the less specific GO terms due to the number of required positive genes in the training set). Figure ##FIG##4##5## shows the number of currently annotated and predicted genes for each GO term, including 9,429, 2,087, and 19,849 predictions in the Biological process, Cellular component, and Molecular function branches, respectively. (The maximum number of predictions displayed was limited to 1,000.) This figure illustrates the potential future impact of these predictions on the state of function annotation should the expected 30% or more of these predictions prove true.</p> <p>While Figure ##FIG##4##5## shows the impact for more general GO terms, we note that performance for more specific GO terms was also quite good. For example, the mean P20R from the best-performing submission for the most specific {3-10} versus least specific {101-300} category was 21% versus 37%, 38% versus 50%, and 51% versus 53% for Biological process, Cellular component, and Molecular function branches, respectively. Thus, predictions for more specific GO terms offer a similarly high impact on current function annotation (and there are many more specific GO terms than general GO terms).</p> <p>Predictions have varying degrees of novelty, ranging from 're-predictions' and 'refinement predictions' to 'highly novel'. Re-predictions are cases in which the gene is currently annotated with that GO term based solely on IEA evidence; these are often unverified predictions made previously by others. Refinement predictions are cases in which the gene is currently annotated with an ancestor of the predicted GO term. We describe all other predictions as 'highly novel'. Among the number of predictions displayed in Figure ##FIG##4##5##, the percentages of refinements are 18%, 21%, and 17% for Biological process, Cellular component, and Molecular function branches, respectively, while the percentages of re-predictions are 43%, 37%, and 32%. Thus, 3,677 (39%), 877 (42%), and 10,123 (51%) predictions for Biological process, Cellular component, and Molecular function branches, respectively, were highly novel.</p> <title>Literature evaluation for top-scoring predictions with a high degree of novelty</title> <p>To gain intuition into the quality of those predictions with the highest degree of novelty, we performed a focused literature analysis on highly novel top-scoring predictions. For this, we identified the top three predictions from each of the twelve evaluation categories, excluding re-predictions and refinement predictions.</p> <p>To avoid over-weighting particular GO terms or genes, we also allowed only one prediction per evaluation category for any given gene or GO term. Investigators with extensive experience with literature curation and knowledge of mouse gene function (DPH and JAB) examined published literature relating to these 36 high-scoring highly novel predictions, and scored each prediction according to the nature of published evidence. Additional data file ##SUPPL##13##14## contains the list of highly novel predictions investigated.</p> <p>Out of the 36 high-scoring predictions examined, 21 (58%) were found to be true or likely to be true based on experimental data reported in the literature. Since six other cases could neither be confirmed nor refuted by current literature, we estimate that the true precision for top novel high-scoring predictions lies between 58% and 75%. Of the 21 found to be true, 9 (43%) were strongly supported but were not annotated simply because the literature had not yet been curated. For example, annotation of the gene encoding Slfn8 (schlafen 8) with the GO term 'negative regulation of cell proliferation' is supported [##REF##15351786##36##], with evidence corresponding to the inferred from direct assay (IDA) evidence code [##UREF##3##33##]. This gene currently does not have any functional annotation in the MGI system, and thus exemplifies the novel assignment of function to unannotated genes.</p> <p>Other reasonable annotations identified in this set of 36 examples include 12 cases where the genes are members of characterized gene families. It is likely that the genes play at least a similar role as predicted, although the evidence is not strong enough to support the annotation using GO Consortium annotation policy. An example of this is the mouse gene 4930430D24Rik, which is predicted to be involved in biological process 'protein amino acid methylation'. This gene is defined solely by cDNA clone data and has no experimental information associated with it. However, it has sequence similarity with the gene encoding Btg1, which has been documented as interacting with protein methyl transferases.</p> <p>Another 6 cases (17%) of the 36 examined could be neither confirmed nor refuted by current literature. For example, the gene <italic>Klhl12 </italic>(encoding Kelch-like 12) was associated with the cellular component term 'stress fiber'. This gene is homologous to members of the kelch family of genes found in <italic>Drosophila</italic>. The <italic>Drosophila </italic>gene products are found in a variety of cellular locations. Although some members of this family regulate stress fiber formation through the Ras pathway, there is evidence that the human ortholog binds proteins in a variety of locations and that this protein functions in the context of the ubiquitin E3 ligase complex. As a result, we currently cannot infer cellular location of this gene product and thereby judge the prediction.</p> <p>The remaining 9 (25%) of the 36 predictions examined were considered to be incorrect based on current literature (see Additional data file ##SUPPL##13##14## for the list of predictions investigated). For example, the gene <italic>Grm4 </italic>(encoding the metabotropic glutamate receptor 4) is predicted to have the molecular function 'calcium channel regulator activity'. However, although other G protein coupled receptors regulate calcium levels, there is no current evidence that this gene functions in this way.</p> <p>Taken together, these results suggest that high-scoring predictions based on large-scale data integration comprise a promising resource to guide both curators and experimentalists to correct hypotheses about gene function in mammals.</p> <title>A resource for browsing predictions and underlying evidence</title> <p>So that researchers may browse predictions and gain intuition about evidence that underlies predicted annotations, an online resource allowing browsing by GO term or gene is available [##UREF##4##37##]. To facilitate follow-up experimental study, this resource contains links to existing Gene Trap alleles available as heterozygous mouse embryonic stem cell lines.</p> <title>Illustration of the evidence underlying predictions for two GO terms</title> <p>To gain insight into the prediction process and the nature of supporting evidence, we examined predictions for two specific GO terms in greater detail. Genes currently annotated with 'Cell adhesion' (Figure ##FIG##5##6##) and 'Mitochondrial part' (Figure ##FIG##6##7##) are shown together with genes newly predicted to have these GO terms, in the context of supporting evidence. These GO terms were chosen to illustrate different facets of biology and the utility of multiple data types. Based on the predictive power of each data source in isolation, protein sequence pattern annotations are the most useful source to predict genes involved in cell adhesion, while gene expression data are more relevant for predictions of mitochondrial part. (The value of each data set is based on precision of predictions at 20% recall based solely on that data set, considering genes present in each data set.)</p> <p>To further validate mitochondrial part predictions, we asked if mitochondrially localized proteins (according to [##REF##16615898##38##]) were enriched among mitochondrial part predictions. Indeed, out of 108 mitochondrial part predictions with available data [##REF##16615898##38##], 83 were mitochondrially localized (<italic>P </italic>= 2.3 × 10<sup>-7</sup>; cumulative hypergeometric test). Additional data file ##SUPPL##14##15## contains mitochondrial part predictions with available mitochondrial localization data [##REF##16615898##38##].</p> <p>Figures ##FIG##5##6## and ##FIG##6##7## illustrate that, as intuitively expected, the patterns of expression and other data types among genes annotated and predicted in these categories are quite similar. In addition, the graph formed by protein interactions among annotated and predicted genes contains a connected component (that is, a subset of nodes that are mutually connected by some path) that is larger than expected by chance (<italic>P </italic>&lt; 0.0001; based on a permutation test of 10,000 random networks). Collectively, this figure illustrates the origin of predictions within diverse genomic and proteomic evidence (see Additional data files ##SUPPL##15##16## and ##SUPPL##16##17## for the data underlying Figures ##FIG##5##6## and ##FIG##6##7##).</p>
<title>Discussion</title> <p>Prediction confidence scores fall along a continuum from 0 (predicted not to be true) to 1 (predicted to be true). Whether a score between 0 and 1 should be treated as a prediction for or against the annotation (or as a non-prediction) depends on the user's application-dependent trade-off between precision and recall, and an expert biologist may wish to filter the list further based on their knowledge and intuition before proceeding to carry out experiments. Users performing medium-scale genomic experiments may favor recall over precision and select predictions using a higher recall threshold where the search space (and costs) will be reduced without losing recall. Alternatively, users requiring higher precision can take only the top few predictions.</p> <p>The performance differences among the methods examined here could have a substantial practical impact. For example, suppose a user plans to order ten mouse mutant strains at a cost of $10,000 each to assay a physiological phenotype caused by 20 unidentified genes. Since the combined predictions averaged 41% precision at 20% recall, the user may expect to see four mutants showing the expected phenotype at a cost of $25,000 per successful experiment; on the other hand, if a simple guilt-by-association approach having only one source of evidence as input (with average precision at 20% recall of 10%) is used to select the genes to assay, the user may expect to see only one mutant with the desired phenotype at a cost of $100,000 per successful experiment.</p> <p>Annotation efforts such as FANTOM [##REF##16683036##39##] have populated a high-quality reference database of function assignments in which each annotation is highly likely to be true. This encyclopedic approach is valuable, but necessarily discards partial information, or 'medium-confidence' predictions. A full spectrum of confidence measures can serve as a form of principled triage, in which experimentalists are guided towards those hypotheses that are more likely to prove true but which have not yet been proven. Furthermore, quantitative function prediction should also prove useful as a resource to assist more qualitative encyclopedic efforts.</p> <p>Variation in performance between submissions is more substantial when the evaluation criterion is precision at a given recall, rather than AUC, as shown in Figure ##FIG##2##3##. The variation in performance between groups and between first and second submissions from the same group indicates that, as a community, we have not yet converged on an asymptotic limit to performance. Also, ANOVA results indicate that GO branch is a greater contributor to variation in performance than the prediction method used. The difficulty of predicting GO terms is highest in the Biological process branch followed by the Cellular component and then Molecular function branches. Also, the difficulty decreases as the number of genes currently annotated to that GO term increases.</p> <p>Our assessment indicates that many submissions were more successful in predicting for held-out genes than for the newly annotated set of genes. This suggests the problem of predicting novel annotations may be qualitatively different from the problem of predicting previously known but held-out annotations. Approximately 50% of new annotations were annotated on the basis of sequence or structural similarity (evidence code ISS; Additional data file ##SUPPL##2##3##), as opposed to 9% for held-out annotations. This indicates that a greater proportion of recent annotations has been made by transfer of annotation from other species via homology.</p> <p>Although we considered homology to proteins in other species through phylogenetic profiling and use of protein domain matches, we did not allow transfer of functions from other species via orthology for several reasons. First, function transfer by orthology is the most mature method for function prediction and we consider that the need is greatest to improve methods that integrate and analyze newer large-scale experimental data types. Second, use of GO annotation from other species would have rendered our cross-validation performance estimates uninterpretable by allowing circular predictions. For example, a held-out mouse GO annotation that had previously been transferred by homology from a mouse gene to a human gene might then be transferred back to mouse as a 'prediction'. Third, a function determined in a single organism can quickly spread via orthology to many organisms so that a single piece of evidence might be overcounted as an independent fact in multiple organisms. The second and third issues might be circumvented by only considering annotation from other species based on experiments carried out in that organism. While some evidence codes in GO annotations indicate within-organism support (for example, IDA, IMP [inferred from mutant phenotype], IEP [inferred from expression pattern], IPI [inferred from physical interaction]), other evidence codes such as TAS [traceable author statement], NAS [non-traceable author statement], ISS, and RCA are ambiguous [##UREF##3##33##]. Careful curation of the organism from which function annotation evidence has been derived would greatly facilitate the use of orthology-based function transfer in future integrative studies.</p> <p>We found that submissions from every group were subject to overfitting in most GO categories. While the presence of overfitting is not surprising given the paucity of available training data, it does suggest that future performance gains will come from classifier training methodology that further limits overfitting. Another future improvement to predictions might be a unified score based on all submissions, via an ensemble or 'combination of experts' method [##UREF##5##40##]. In addition, to facilitate interpretation, scores might be transformed to accurately reflect the probability that a prediction is correct. Another possible improvement would be the use of a more refined subset of GO terms as gold standard. For example, predictions could be judged according to a reduced subset of GO terms that are relatively independent of one another and each specific enough to suggest a follow-up experiment [##REF##16869964##24##]. Furthermore, to improve prediction accuracy in future function prediction efforts, data sources containing additional evolutionary, structural, enzymatic and sequence similarity information might be integrated. It would also be interesting to perform a factorial analysis on variations of the classifiers that performed best here, in order to obtain biological intuition or insight into why these classifiers performed well. Our prediction effort was focused on identifying 'errors of omission' in GO annotation. It would also be worthwhile to explore whether low prediction scores for current annotations (apparently 'false negatives') could be useful in recognizing erroneous functional annotations ('errors of commission').</p> <p>A major implication of our analysis is that protein sequence patterns from Pfam and InterPro are extremely useful evidence sources not only for Molecular function GO terms (as expected, since these primarily reflect biochemical activities) but also for inference of Cellular component and Biological process terms. This trend may be due, in part, to the incorporation of biochemical terms in the Biological process ontology (for example, 'protein amino acid phosphorylation' is listed as a Biological process, and its known members overlap with 'protein kinase activity', which is a Molecular function) as well as the fact that protein sequence patterns do relate to substrates associated with specific physiological processes and cellular compartments (for example, DNA-binding proteins are primarily found in the nucleus). Nevertheless, we note that the proportion of genes with protein sequence pattern annotations is much lower in the 8,851 unannotated genes (62%; this includes genes with annotations based solely on IEA evidence) than it is among the 12,752 annotated mouse genes (90%) in the data collection. This indicates that sequence features may be less useful in future predictions of function for currently uncharacterized genes. This is particularly true of Biological process terms, which are the least predictable using sequence features alone, and conceptually most closely related to phenotype. In future, it will be valuable to predict phenotypes as well as functions. Phenotype predictions are immediately testable, and phenotype data in mammalian organisms and cell culture models have a rapid rate of emergence that will permit prospective evaluation of predictions.</p>
<title>Conclusion</title> <p>We performed a systematic evaluation of diverse, independently developed computational approaches for predicting gene function from heterogeneous data sources in mammals. The results show that currently available data for mammals allow predictions with both breadth and accuracy. At a recall rate of 20%, a unified set of predictions averaged 41% precision, with 26% of GO terms achieving a precision better than 90%. Predictions with comparable precision have been successfully used in yeast [##REF##12837249##41##]. A striking finding is that predictions for GO terms in the most specific evaluation category (ten or fewer annotated genes) have a precision comparable to that obtained in the more general evaluation categories. For Biological process GO terms, we achieved a mean precision at 20% recall for blinded predictions ranging from 28% to 46%, depending on evaluation category specificity. Corresponding performance for Cellular component and Molecular function terms was even higher, ranging from 38% to 58% and from 56% to 64%, respectively. Importantly, many highly novel function predictions emerge for the 38% of mouse genes that remain uncharacterized.</p>
<p>This is an open access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background:</title> <p>Several years after sequencing the human genome and the mouse genome, much remains to be discovered about the functions of most human and mouse genes. Computational prediction of gene function promises to help focus limited experimental resources on the most likely hypotheses. Several algorithms using diverse genomic data have been applied to this task in model organisms; however, the performance of such approaches in mammals has not yet been evaluated.</p> <title>Results:</title> <p>In this study, a standardized collection of mouse functional genomic data was assembled; nine bioinformatics teams used this data set to independently train classifiers and generate predictions of function, as defined by Gene Ontology (GO) terms, for 21,603 mouse genes; and the best performing submissions were combined in a single set of predictions. We identified strengths and weaknesses of current functional genomic data sets and compared the performance of function prediction algorithms. This analysis inferred functions for 76% of mouse genes, including 5,000 currently uncharacterized genes. At a recall rate of 20%, a unified set of predictions averaged 41% precision, with 26% of GO terms achieving a precision better than 90%.</p> <title>Conclusion:</title> <p>We performed a systematic evaluation of diverse, independently developed computational approaches for predicting gene function from heterogeneous data sources in mammals. The results show that currently available data for mammals allows predictions with both breadth and accuracy. Importantly, many highly novel predictions emerge for the 38% of mouse genes that remain uncharacterized.</p>
<title>Abbreviations</title> <p>ANOVA, analysis of variance; AUC, area under the ROC curve; GO, Gene Ontology; IDA, inferred from direct assay; IEA, inferred from electronic annotation; ISS, inferred from sequence or structural similarity; MGI, Mouse Genome Informatics; P20R, precision at 20% recall; RCA, reviewed computational analysis; ROC, receiver operating characteristic.</p> <title>Competing interests</title> <p>The authors declare that they have no competing interests.</p> <title>Authors' contributions</title> <p>The study was designed and organized by LP-C, TRH, and FPR, with advice from many others. LP-C assembled the data set (with help from GFB), anonymized gene identifiers in isolation from all participants, and calculated performance measures. Team A analysis was performed by GO with contributions from GL, JQ, CG, and MJ, and design and supervision from WSN. Team B analysis was performed by HL with contributions from MD and design and supervision from TC and FS. Team C analysis was performed by SM with contributions from CG, DW-F, and DR, and design and supervision from QM. Team D analysis was performed by YG and CLM with contributions by ZB, and design and supervision from OGT. Team E analysis was performed by WKK and CK with design and supervision from EMM. Team F analysis was performed by TJ and CZ with contributions from GNL and design and supervision from DX. Team G analysis was performed by MT and WT with contributions from FDG, and design and supervision from FPR. Team H analysis was performed by YQ with design and supervision from JK and ZB. Team I analysis was designed and implemented by ML and AP. Post-submission analysis was performed by LP-C, except that CLM performed ANOVA on submission performance and MT generated 'straw man' predictions and classified prediction novelty. DPH and JAB performed literature evaluation. The manuscript was prepared by LP-C, TRH, and FPR and figures by LP-C. All authors read and approved the final manuscript.</p> <title>Additional data files</title> <p>The following additional data are available with the online version of this paper. Additional data file ##SUPPL##0##1## is a figure showing bar graphs of pairwise comparisons of AUC within each evaluation category. Additional data file ##SUPPL##1##2## is a figure showing bar graphs of mean P20R values within each evaluation category. Additional data file ##SUPPL##2##3## is a figure showing bar graphs comparing properties of GO annotations in the held-out gene set, in the newly annotated gene set, and in the training set. Additional data file ##SUPPL##3##4## is a figure showing a clustergram indicating Pearson correlation coefficients of the P20R performance measure among different submissions. Additional data file ##SUPPL##4##5## is a figure showing heatmaps of precision at several recall values evaluated using held-out annotations on all GO terms within each of the 12 evaluation categories for each submission. Additional data file ##SUPPL##5##6## is a figure showing a heatmap of median precision at several recall values evaluated using held-out annotations within each of the 12 evaluation categories per submission. Additional data file ##SUPPL##6##7## is a table listing performance measures for the initial round of GO term predictions within each evaluation category evaluated using held-out genes. Additional data file ##SUPPL##7##8## is a table listing performance measures for the initial round of GO term predictions within each evaluation category evaluated using the newly annotated genes (prospective evaluation). Additional data file ##SUPPL##8##9## is a table listing performance measures for the second round of GO term predictions within each evaluation category evaluated using held-out genes. Additional data file ##SUPPL##9##10## is a table listing performance measures for the second round of GO term predictions within each evaluation category evaluated using the newly annotated genes (prospective evaluation). Additional data file ##SUPPL##10##11## is a table listing the results of the analysis of variance in prediction performance. Additional data file ##SUPPL##11##12## is a table listing performance and variance on five subsets of the training data. Additional data file ##SUPPL##12##13## is a table listing performance measures of the unified predictions for each GO term. Additional data file ##SUPPL##13##14## is a table listing high-scoring predictions evaluated against existing literature. Additional data file ##SUPPL##14##15## is a table listing mitochondrial part predictions with data from a previous study [##REF##16615898##38##]. Additional data file ##SUPPL##15##16## is a table listing data underlying Figure ##FIG##5##6##. Additional data file ##SUPPL##16##17## is a table listing data underlying Figure ##FIG##6##7##. Additional data file ##SUPPL##17##18## is a table listing performance measures for various individual evidence sources within each evaluation category evaluated using held-out genes. Additional data file ##SUPPL##18##19## is a Flash animation showing a fraction of GO terms with higher precision and recall than a given precision/recall point for the unified predictions. Additional data file ##SUPPL##19##20## contains a 300 word description of the function prediction method used in each submission. Additional data file ##SUPPL##20##21## describes in detail the submission methods and the straw man classifier (57 pages in total).</p> <title>Supplementary Material</title>
<title>Acknowledgements</title> <p>Team A (GO, GL, JQ, CG, MJ, and WSN) was supported by NIH award R33 HG003070. Team B (HL, MD, TC, and FS) was supported by NIH/NSF joint mathematical biology initiative DMS-0241102 and NIH P50 HG 002790; HL is supported by the systems biology infrastructure establishment grant provided by Gwangju Institute of Science and Technology in 2008; MD is supported by the National Natural Science Foundation of China (No. 30570425), the National Key Basic Research Project of China (No. 2003CB715903), and Microsoft Research Asia (MSRA). Team C (SM, DW-F, CG, DR, QM) was supported by an NSERC operating grant to QM as well as a Genome Canada grant administered by the Ontario Genomics Institute. Team D (YG, CLM, ZB, and OGT) was partially supported by NIH grant R01 GM071966 and NSF grant IIS-0513552 to OGT and NIGMS Center of Excellence grant P50 GM071508. Team E (WKK, CK, and EMM) was supported by grants from the NIH, NSF, Packard and Welch Foundations. Team F (TJ, CZ, GNL, and DX) was supported by USDA/CSREES-2004-25604-14708 and NSF/ITR-IIS-0407204. Team G (MT, WT, FDG, GFB, and FPR) was supported by NIH grants (HG003224, HG0017115, HL81341, HG004233 and HG004098), by the Keck Foundation, and by NSF TeraGrid resources. Team H (YQ, JK, and ZB) was supported in part by National Science Foundation NSF grants EIA0225656, EIA0225636, CAREER CC044917 and National Institutes of Health NIH grant LM07994-01. Team I (ML and AP) warmly thanks A Vazquez for his support. DPH and JAB were supported by HG002273. LP-C and TRH were supported by a CIHR grant and thank O Meruvia for helping with the design of figures.</p> <p>This article has been published as part of <italic>Genome Biology </italic>Volume 9 Supplement 1, 2008: Quantitative inference of gene function from diverse large-scale datasets. The full contents of the supplement are available online at <ext-link ext-link-type="uri" xlink:href="http://genomebiology.com/supplements/9/S1"/></p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p>Measures of performance for the initial round of GO term predictions. <bold>(a) </bold>Mean area under the receiver operating characteristic curve (AUC) within each evaluation category, evaluated using the held-out genes. Gene Ontology Biological process (GO-BP), Cellular component (GO-CC), and Molecular function (GO-MF) branches are indicated on the x-axis, grouped by specificity (indicated by the minimum number of genes in the training set associated with each GO term in a given category). Upper case letters associated with the color code correspond to submission identifier. <bold>(b) </bold>Mean AUC within each evaluation category, evaluated prospectively using newly annotated genes. <bold>(c) </bold>For each pair of submissions X and Y, we test for difference in AUC value for every GO term (evaluated using held-out genes). Color bars indicate fraction of pairwise comparisons for which X's AUC is significantly higher (blue), not significantly different (beige), and significantly lower (maroon). <bold>(d) </bold>As (c), except evaluated using the newly annotated genes. <bold>(e) </bold>The fraction of GO terms exceeding the indicated precision at 20% recall (P20R) value, evaluated using held-out genes. The black line corresponds to the fraction of GO terms for which the 'straw man' approach achieved the indicated precision. <bold>(f) </bold>As (e), except with P20R values derived prospectively from newly annotated genes.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p>Measures of performance for the second round of GO term predictions. <bold>(a, b) </bold>As described in Figure 1a, b, except that the gray color area indicates performance in the first set of submissions. <bold>(c-f) </bold>As described in Figure 1c-f, except that asterisks in (c) and (d) indicate second-round submissions and dashed lines in (e) and (f) indicate the performance of an earlier submission by the same group. GO, Gene Ontology.</p></caption></fig> <fig position="float" id="F3"><label>Figure 3</label><caption><p>Factors affecting prediction performance. <bold>(a) </bold>Precision at 20% recall (P20R) values evaluated using held-out annotations on all Gene Ontology (GO) terms (vertical axis) within each of the 12 evaluation categories for each submission (left panel) and for a simple guilt-by association using each data set in turn as its sole evidence source (right panel). The number of genes in each evaluation category is shown in parentheses. GO-BP, GO Biological process; GO-CC, GO Cellular component; GO-MF, GO Molecular function; NB, naïve Bayes. Data sets are described in Table 1. <bold>(b) </bold>Fraction of the 21,603 genes in the data collection with at least one annotated neighbor per data set. <bold>(c) </bold>Analysis of variance (ANOVA), exploring the effects of various factors on P20R values. <bold>(d) </bold>Fraction of total variance in P20R values that is explained by each effect. Asterisks in (c, d) indicate interaction between two factors.</p></caption></fig> <fig position="float" id="F4"><label>Figure 4</label><caption><p>Distribution of GO terms at several precision/recall performance points. Proportion of Gene Ontology (GO) terms per evaluation category with a precision/recall performance point that is both above and to the right of a given precision/recall point in the contour plots. GO-BP, GO Biological process; GO-CC, GO Cellular component; GO-MF, GO Molecular function.</p></caption></fig> <fig position="float" id="F5"><label>Figure 5</label><caption><p>Number of high-precision predictions among GO terms for which precision can be confidently estimated. Number of currently annotated (green) versus predicted genes (orange, predictions expected to be correct; gray, predictions expected to be incorrect) for a subset of Gene Ontology (GO) terms for which 30% precision on held-out annotations was achieved while recovering at least 10 positives in the held-out set. The number of predicted genes displayed was limited to 1,000. GO terms were ordered according to similarity of prediction/annotation patterns. Terminal digits of GO term identifiers are shown in parentheses. GO-BP, GO Biological process; GO-CC, GO Cellular component; GO-MF, GO Molecular function.</p></caption></fig> <fig position="float" id="F6"><label>Figure 6</label><caption><p>Illustration of evidence underlying predictions for the GO term 'Cell adhesion'. As an assessment of predictive usefulness, the precision at 20% recall (P20R) value based on each single data source is shown in parentheses. <bold>(a) </bold>Expression levels of annotated genes (dark green) and predictions (orange), grouped by Pearson correlation and complete-linkage hierarchical clustering. <bold>(b) </bold>Protein domains in common among predictions and annotated genes. <bold>(c) </bold>Largest protein-protein interaction network among predictions and annotated genes. OPHID, Online Predicted Human Interaction Database. <bold>(d) </bold>Disease and <bold>(e) </bold>phenotype annotations in common between predictions and annotated genes. Terminal digits of identifiers are shown in parentheses. OMIM, Online Mendelian Inheritance in Man.</p></caption></fig> <fig position="float" id="F7"><label>Figure 7</label><caption><p>Illustration of evidence underlying predictions for the GO term 'Mitochondrial part'. <bold>(a-e) </bold>As described in Figure 6a-e. GO, Gene Ontology.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>Data collection description: summary of the data sources</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Data type</td><td align="left">Description</td><td align="left">Representation</td></tr></thead><tbody><tr><td align="left">Gene expression</td><td align="left">Expression data from oligonucleotide arrays for 13,566 genes across 55 mouse tissues (Zhang <italic>et al</italic>. [##REF##15588312##21##])</td><td align="left">Median-subtracted, arcsinh intensity measurements</td></tr><tr><td/><td align="left">Expression data from Affymetrix arrays for 18,208 genes across 61 mouse tissues (Su <italic>et al</italic>. [##REF##15075390##44##])</td><td align="left">gcRMA-condensed intensity measurements</td></tr><tr><td/><td align="left">Tag counts at quality 0.99 cut-off from 139 SAGE libraries for 16,726 genes [##REF##16352711##45##]</td><td align="left">Average and total tag counts</td></tr><tr><td align="left">Sequence patterns</td><td align="left">Protein sequence pattern annotations from Pfam-A (release 19) for 15,569 genes with 3,133 protein families [##REF##16381856##46##]</td><td align="left">Binary annotation patterns</td></tr><tr><td/><td align="left">Protein sequence pattern annotations from InterPro (release 12.1) for 16,965 genes with 5,404 sequence patterns [##REF##15608177##47##]</td><td align="left">Binary annotation patterns</td></tr><tr><td align="left">Protein interactions</td><td align="left">Protein-protein interactions from OPHID for 7,125 genes [##REF##15657099##28##] (downloaded on 20 April 2006)</td><td align="left">Binary interaction patterns and shortest path between genes</td></tr><tr><td align="left">Phenotypes</td><td align="left">Phenotype annotations from MGI for 3,439 genes with 33 phenotypes [##REF##17135206##48##] (downloaded on 21 February 2006 from [##UREF##8##49##])</td><td align="left">Binary annotation patterns</td></tr><tr><td align="left">Conservation profile</td><td align="left">Conservation pattern from Ensembl (v38) for 15,939 genes across 18 species [##REF##14707178##50##]</td><td align="left">Binary conservation patterns and conservation scores</td></tr><tr><td/><td align="left">Conservation pattern from Inparanoid (v4.0) for 15,703 genes across 21 species [##REF##15608241##51##]</td><td align="left">Binary conservation patterns and Inparanoid scores</td></tr><tr><td align="left">Disease associations</td><td align="left">Disease associations from OMIM for 1,938 genes to 2,488 diseases/phenotypes [##REF##17170002##52##,##REF##15608251##53##] (downloaded on 6 June 2006 from [##UREF##9##54##])</td><td align="left">Binary annotation patterns</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>Brief description of function prediction methods used</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Submission identifier</td><td align="left">Approach</td><td align="left">Name</td><td align="left">Author initials</td></tr></thead><tbody><tr><td align="left">A</td><td align="left">Compute several kernel matrices (SVM) for each data matrix, train one GO term specific SVM per kernel, and map SVMs' discriminants to probabilities using logistic regression</td><td align="left">Calibrated ensembles of SVMs</td><td align="left">GO, GL, JQ, CG, MJ, and WSN</td></tr><tr><td align="left">B</td><td align="left">Four different kernels are used per data set. Integration of best kernels and data sources is done using the kernel logistic regression model</td><td align="left">Kernel logistic regression [##REF##16584317##55##]</td><td align="left">HL, MD, TC, and FS</td></tr><tr><td align="left">C</td><td align="left">Construct similarity kernels, assign a weight to each kernel using linear regression, combine the weighted kernels, and use a graph based algorithm to obtain the score vector</td><td align="left">geneMANIA</td><td align="left">SM, DW-F, CG, DR, and QM</td></tr><tr><td align="left">D</td><td align="left">Train SVM classifiers on each GO term and individual data sets, construct several Bayesian networks that incorporate diverse data sources and hierarchical relationships, and chose for each GO term the Bayes net or the SVM yielding the highest AUC</td><td align="left">Multi-label hierarchical classification [##REF##16410319##56##] and Bayesian integration</td><td align="left">YG, CLM, ZB, and OGT</td></tr><tr><td align="left">E</td><td align="left">Combination of an ensemble of classifiers (naïve Bayes, decision tree, and boosted tree) with guilt-by-association in a functional linkage network, choosing the maximum score</td><td align="left">Combination of classifier ensemble and gene network</td><td align="left">WKK, CK, and EMM</td></tr><tr><td align="left">F</td><td align="left">Code the relationship between functional similarity and the data into a functional linkage graph and predict gene functions using Boltzmann machine and simulated annealing</td><td align="left">GeneFAS (gene function annotation system) [##REF##15585665##2##,##REF##15703479##3##]</td><td align="left">TJ, CZ, GNL, and DX</td></tr><tr><td align="left">G</td><td align="left">Two methods with scores combined by logistic regression: guilt-by-association using a weighted functional linkage graph generated by probabilistic decision trees; and random forests trained on all binary gene attributes</td><td align="left">Funckenstein</td><td align="left">WT, MT, FDG, and FPR</td></tr><tr><td align="left">H</td><td align="left">Pairwise similarity features for gene pairs were derived from the available data. A Random Forest classifier was trained using pairs of genes for each GO term. Predictions are based on similarity between the query gene and the positive examples for that GO term</td><td align="left">Function prediction through query retrieval</td><td align="left">YQ, JK, and ZB</td></tr><tr><td align="left">I</td><td align="left">Construct an interaction network per data set, merge data set graphs into a single graph, and apply a belief propagation algorithm to compute the probability for each protein to have a specific function given the functions assigned to the proteins in the rest of the graph</td><td align="left">Function prediction with message passing algorithms [##REF##15377508##57##]</td><td align="left">ML and AP</td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="gb-2008-9-S1-S2-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="gb-2008-9-S1-S2-i2" overflow="scroll"><mml:semantics><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="gb-2008-9-S1-S2-i3" overflow="scroll"><mml:semantics><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mrow><mml:mfrac><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow><mml:mrow><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow></mml:mfrac></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="gb-2008-9-S1-S2-i4" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="gb-2008-9-S1-S2-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>L</mml:mi><mml:mo>⋅</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mo>⋅</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>−</mml:mo><mml:msub><mml:mi>s</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>+</mml:mo><mml:mn>1</mml:mn></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6" name="gb-2008-9-S1-S2-i6" overflow="scroll"><mml:semantics><mml:mrow><mml:mstyle displaystyle="true"><mml:msubsup><mml:mo>∑</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mi>n</mml:mi></mml:msubsup><mml:mrow><mml:msubsup><mml:mi>s</mml:mi><mml:mi>i</mml:mi><mml:mo>∗</mml:mo></mml:msubsup><mml:mo>=</mml:mo><mml:mi>t</mml:mi></mml:mrow></mml:mstyle></mml:mrow></mml:semantics></mml:math></inline-formula>
<supplementary-material content-type="local-data" id="S1"><caption><title>Additional data file 1</title><p>Bar graphs of pairwise comparisons of AUC within each evaluation category.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S2"><caption><title>Additional data file 2</title><p>Bar graphs of mean P20R values within each evaluation category</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S3"><caption><title>Additional data file 3</title><p>Bar graphs comparing properties of GO annotations in the held-out gene set, in the newly annotated gene set and in the training set.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S4"><caption><title>Additional data file 4</title><p>Clustergram indicating Pearson correlation coefficients of the P20R performance measure among different submissions.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S5"><caption><title>Additional data file 5</title><p>Heatmaps of precision at several recall values evaluated using held-out annotations on all GO terms within each of the 12 evaluation categories for each submission.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S6"><caption><title>Additional data file 6</title><p>Heatmap of median precision at several recall values evaluated using held-out annotations within each of the 12 evaluation categories per submission</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S7"><caption><title>Additional data file 7</title><p>Performance measures for the initial round of GO term predictions within each evaluation category evaluated using held-out genes.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S8"><caption><title>Additional data file 8</title><p>Performance measures for the initial round of GO term predictions within each evaluation category evaluated using the newly annotated genes (prospective evaluation).</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S9"><caption><title>Additional data file 9</title><p>Performance measures for the second round of GO term predictions within each evaluation category evaluated using held-out genes.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S10"><caption><title>Additional data file 10</title><p>Performance measures for the second round of GO term predictions within each evaluation category evaluated using the newly annotated genes (prospective evaluation).</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S11"><caption><title>Additional data file 11</title><p>Results of the analysis of variance in prediction performance.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S12"><caption><title>Additional data file 12</title><p>Performance and variance on five subsets of the training data.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S13"><caption><title>Additional data file 13</title><p>Performance measures of the unified predictions for each GO term.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S14"><caption><title>Additional data file 14</title><p>High-scoring predictions evaluated against existing literature.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S15"><caption><title>Additional data file 15</title><p>Mitochondrial part predictions with data from a previous study [##REF##16615898##38##].</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S16"><caption><title>Additional data file 16</title><p>Data underlying Figure ##FIG##5##6##.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S17"><caption><title>Additional data file 17</title><p>Data underlying Figure ##FIG##6##7##.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S18"><caption><title>Additional data file 18</title><p>Performance measures for various individual evidence sources within each evaluation category evaluated using held-out genes.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S19"><caption><title>Additional data file 19</title><p>Fraction of GO terms with higher precision and recall than a given precision/recall point for the unified predictions.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S20"><caption><title>Additional data file 20</title><p>Description of the function prediction method used in each submission.</p></caption></supplementary-material> <supplementary-material content-type="local-data" id="S21"><caption><title>Additional data file 21</title><p>Detailed description of the submission methods and the straw man classifier.</p></caption></supplementary-material>
<table-wrap-foot><p>gcRMA, robust multi-array analysis with background adjustment for GC content of probes; OMIM, Online Mendelian Inheritance in Man; OPHID, Online Predicted Human Interaction Database; SAGE, serial analysis of gene expression.</p></table-wrap-foot> <table-wrap-foot><p>AUC, area under the receiver operating characteristic curve; GO, Gene Ontology.</p></table-wrap-foot>
<graphic xlink:href="gb-2008-9-s1-s2-1"/> <graphic xlink:href="gb-2008-9-s1-s2-2"/> <graphic xlink:href="gb-2008-9-s1-s2-3"/> <graphic xlink:href="gb-2008-9-s1-s2-4"/> <graphic xlink:href="gb-2008-9-s1-s2-5"/> <graphic xlink:href="gb-2008-9-s1-s2-6"/> <graphic xlink:href="gb-2008-9-s1-s2-7"/>
<media xlink:href="gb-2008-9-s1-s2-S1.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S2.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S3.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S4.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S5.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S6.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S7.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S8.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S9.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S10.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S11.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S12.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S13.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S14.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S15.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S16.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S17.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S18.xls" mimetype="application" mime-subtype="vnd.ms-excel"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S19.swf" mimetype="application" mime-subtype="x-shockwave-flash"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S20.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media> <media xlink:href="gb-2008-9-s1-s2-S21.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media>
[{"surname": ["Shenouda", "Morris", "Bonner", "King I, Wang J, Chan L, Wang DL"], "given-names": ["EAMA", "Q", "AJ"], "article-title": ["Connectionist approaches for predicting mouse gene function from gene expression."], "source": ["Neural Information Processing: 13th International Conference, ICONIP 2006, Hong Kong, China, October 3-6, 2006, Proceedings"], "year": ["2006"], "publisher-name": ["Heidelberg, Berlin; Springer"], "fpage": ["280"], "lpage": ["289"]}, {"article-title": ["MouseFunc I"]}, {"article-title": ["The Jackson Laboratory Mouse Genome Database (MGD), Mouse Genome Informatics Web Site"]}, {"article-title": ["Guide to GO Evidence Codes"]}, {"article-title": ["MFunc: Predictions of Gene Function"]}, {"surname": ["Kittler", "Hatef", "Duin", "Matas"], "given-names": ["J", "M", "RPW", "J"], "article-title": ["On combining classifiers."], "source": ["IEEE Trans Pattern Analysis Machine Intelligence"], "year": ["1998"], "volume": ["20"], "fpage": ["226"], "lpage": ["239"]}, {"surname": ["Fawcett"], "given-names": ["T"], "article-title": ["An introduction to ROC analysis."], "source": ["Pattern Recogn Lett"], "year": ["2006"], "volume": ["27"], "fpage": ["861"], "lpage": ["874"]}, {"surname": ["Davis", "Goadrich", "Cohen WW, Moore A"], "given-names": ["J", "M"], "article-title": ["The relationship between Precision-Recall and ROC curves."], "source": ["Proceedings of the 23rd International Conference on Machine Learning: June 25-29, 2006; Pittsburgh, Pennsylvania"], "year": ["2006"], "publisher-name": ["New York: ACM Press"], "fpage": ["233"], "lpage": ["240"]}, {"article-title": ["Phenotype Annotations from MGI"]}, {"article-title": ["Disease Associations from OMIM"]}]
Genome Biol. 2008 Jun 27; 9(Suppl 1):S2