<title>Background</title> <p>Elucidating protein functions is a challenging task and essential to better understand biological processes, cellular mechanisms, evolutionary changes and the onset of diseases. A special electronic resource has been created to capture knowledge on protein function in bioinformatics data resources: the Gene Ontology (GO) [##REF##16381878##1##,##REF##10802651##2##]. The annotation of proteins with GO terms is an ongoing work which is carried out by professional database curators based on literature information and thus tends to be time-consuming. Accordingly, only a relatively small number of proteins has yet been annotated, covering less than 3% of UniProtKb [##REF##17181854##3##]. To increase coverage and to speed up the annotation process, new techniques are required that support curators, for instance by providing them with automatically generated annotation suggestions. However, these suggestions are only helpful if they exhibit very high quality and are rarely wrong.</p> <p>There are numerous ways to predict protein function [##UREF##0##4##]. Predictions can be based on the analysis of protein sequences and 3D-structures [##REF##11560060##5##], on orthology relationships, on domain structures, or on the position of proteins within their networks of interacting partners [##REF##12648675##6##,##REF##17353930##7##]. However, many of these methods when used in isolation do not reach the level of precision that is considered as helpful by database curators. A promising way to improve precision (though usually at the cost of recall) is to combine different methods. In particular, text mining could be helpful for generating or validating predictions [##REF##16563163##8##,##REF##16766558##9##]. For instance, Shatkay <italic>et al</italic>. introduced a comprehensive system for predicting the cellular location of eukaryotic proteins by integrating several types of sequence-derived and text-based features [##REF##17392328##10##]. Overall they were able to predict protein localizations with an accuracy of 71% achieving a significant improvement to earlier prediction methods.</p> <p>Different text mining approaches have been proposed to automatically find GO terms in the literature, e.g., GoPubMed [##REF##15980585##11##] and EBIMed [##REF##17237098##12##]. Using these approaches for function prediction typically results in predictions with less than 35% precision [##REF##15960821##13##]. The main reason accounting for this low precision is that most sentences contain several proteins and GO terms, and thus highly discriminative natural language processing would be needed to detect true associations. Furthermore, it is still difficult to identify GO terms in text in first place which also results in low recall. A number of reasons explain this. First, the GO terminology has not been designed for text mining and does not necessarily mimic the language used in the scientific literature. Second, there is yet little motivation for authors to comply to GO terminology in their publications. Third, natural language is constantly evolving and offers ways to sub-specify existing terminology according to individual needs. Last, authors tend to hedge their statements leading to convoluted expressions [##REF##17471254##14##]. In any case, methods with such a level of precision do not efficiently support the annotation process.</p> <p>In this paper, we present a novel approach to precisely predict GO terms for poorly annotated proteins. Our approach combines two prediction methods that use complementary data from different resources. In the initial step we generated conserved subgraphs from protein-protein-interaction (PPI) networks from various species. From these subgraphs GO annotations for proteins are predicted, if orthologous proteins with known molecular function are available [##UREF##1##15##]. These hypothetical new annotations are validated against annotations that are automatically extracted from the scientific literature. Our combined approach for predicting GO terms achieves on automatically preselected proteins a very promising precision (actually 100% for all proteins we probed for), and thus efficiently supports GO curation. Our approach also shows that scientific literature contains relevant information that is complementary to the rich and valuable information contained in public databases.</p>
<title>Methods</title> <p>The main components of our approach are the selection of proteins from topologically conserved subgraphs in protein-protein interaction networks and the identification of GO annotation in the scientific literature. Both methods are described in the following sections.</p> <title>Predicting protein functions</title> <p>In [##UREF##1##15##], we reported on a system which exploits conservation of PPIs for function prediction. For completeness, we briefly describe this method here; see [##UREF##1##15##] for details.</p> <p>We generated protein-protein-interaction graphs for <italic>H. sapiens</italic>, <italic>M. musculus</italic>, <italic>D. melanogaster </italic>and <italic>S. cerevisiae </italic>from the Database of Interacting Proteins [##REF##14681454##16##], BIND [##REF##12519993##17##], Mammalian MIPS [##REF##15531608##18##], IntAct [##REF##14681455##19##] and the Human Protein Reference Database [##REF##14525934##20##]. We chose yeast and fly as one of the best studied model organisms in several research fields to compare them on the level of PPIs with human and mouse which hardly have been analysed so far.</p> <p>We first computed sets of orthologous proteins from different species based on sequence similarity. Subsequently, we detected conserved interactions (interologs [##REF##11731503##21##]) in the interactions graphs of all considered species between those orthologs. Next, we identified maximally connected subgraphs in different species that are topologically isomorph by assembling interologs. Such subgraphs are called conserved and connected subgraphs (CCSs). A CCS (see Figure ##FIG##0##1##) is defined by a set of orthologous proteins detected in each species and their set of interactions that have been identified in all of the considered species. Proteins in a CCS are associated with available functional annotation obtained from Swiss-Prot [##REF##12520024##22##]. We used a GO-based scoring scheme [##UREF##2##23##] to measure functional similarity of CCSs to assess how far structural homogeneity given by the CCSs correlates with functional similarity of proteins in the CCSs.</p> <p>Functional similarity of a CCS can be inferred from proteins contained in a CCS under the following three assumptions. (1) Proteins in the CCS have orthologous proteins in different species. Orthologous proteins evolved from a common ancestor protein and therefore are most likely to have the same function. (2) Orthologous proteins in the CCS interact with again orthologous proteins ("orthologous interactions" – interologs). Proteins interacting with each other usually are involved in similar processes and functions and it has been shown that 70–80% of proteins share at least one function with its interaction partner [##REF##15966804##24##]. (3) Proteins and their interactions forming the topological structure of the CCS are part of the same biological context of a CCS as proteins group within networks according to their biological function [##REF##14517352##25##]. Therefore, the function of proteins in a CCS complement each other in a way that the CCS itself represents a module which is biological coherent and meaningful.</p> <p>Based on those observations, we devised an algorithm which infers GO-terms based on the annotations of proteins in the same CCS for proteins with missing annotations. All CCSs with at least three interactions and a high functional similarity are considered as candidates. For qualifying CCSs we determined orthologous protein groups whose function differ significantly (p-value ≤ 0.01) from the average similarity of the CCS (dissimilar orthologous proteins) due to missing/unknown annotations. We selected those proteins and predicted the functions annotated to their orthologous partner proteins.</p> <title>Identifying GO terms in text passages</title> <p>In a second phase, we tried to confirm predicted GO annotations using a novel method for the automatic identification of GO terms in natural language text [##REF##18437221##27##]. We briefly describe this approach here, see [##REF##18437221##26##] for more details. In general, GO terms are often constituted by several words. In this method, the decision whether or not a particular GO term is mentioned in a fraction of text is determined by a set of features. The most important feature is the occurrence of individual words constituting GO terms. However, such evidence could as well refer to other terms. The selection of the most specific term is an important aspect to avoid loss of detail. Another feature is the proximity of all the words that form the evidence of a term's mention. This idea is based on the assumption that a long distance between individual words does not support the hypothesis that they are related in the sense of forming a GO term.</p> <p>The method we propose integrates the concepts of Evidence, Specificity and Proximity as described in the following. Let <italic>t </italic>be a GO term and let <italic>tok</italic>(<italic>t</italic>) be a set of unique words in <italic>t</italic>. The Specificity of a GO term <italic>t </italic>in a given text is defined as the amount of information carried by the term:</p> <p></p> <p>where <italic>p</italic>(<italic>w</italic>) is the probability that a word <italic>w </italic>occurs in that text.</p> <p>The Evidence that a GO term <italic>t </italic>is mentioned in a continuous stretch <italic>z </italic>of text (also called zone) is defined as the proportion of information carried by the words present in the zone and in the term:</p> <p></p> <p>The Proximity of words constituting a term <italic>t </italic>occurring in a text is defined as the divergence of the dispersion of the term's words in the text from the term's minimum dispersion where dispersion describes the spreading of words constituting a term <italic>t </italic>in a zone <italic>z</italic>. A set of words <italic>W </italic>of a term <italic>t </italic>mentioned in the zone <italic>z </italic>is defined as:</p> <p></p> <p>The dispersion of those words <italic>W </italic>in the zone <italic>z </italic>is given by the sum of distances (<italic>dist</italic>(<italic>w</italic><sub><italic>i</italic></sub>, <italic>w</italic><sub><italic>j</italic></sub>, <italic>z</italic>)) between a pair of words <italic>w</italic><sub><italic>i</italic></sub>, <italic>w</italic><sub><italic>j </italic></sub>of <italic>W </italic>in <italic>z</italic>:</p> <p></p> <p>The minimum dispersion of the words <italic>D</italic><sub><italic>min</italic></sub>(<italic>W</italic>) is computed as follows:</p> <p></p> <p>Finally, the Proximity is given by:</p> <p></p> <p>Evidence, Specificity and Proximity are the three parameters that are combined to score the likelihood that a term <italic>t </italic>is mentioned in a text zone <italic>z</italic>. In this work, we defined a zone <italic>z </italic>as a sentence. As final score, we use a weighted product:</p> <p></p> <p>The parameters can be learned from annotated text. We used the second Biocreative corpus.</p> <title>Validation of GO annotations from CCSs through literature analysis</title> <p>Scientific articles are primary data that contain the conceptualization of facts provided by the author from his real world perception. Human curators take this primary data source and interpret it to identify and extract protein annotations [##REF##17181854##3##]. There is no solution available that automates the manual curation process and that generates results comparable to the work of a curator. Furthermore, few is yet known on how a curator derives from the text the evidence for the concepts that represent the functional annotation of a protein.</p> <p>For our PPI network comparisons we considered the species <italic>H. sapiens </italic>(HS), <italic>M. musculus </italic>(MM), <italic>S. cerevisiae </italic>(SC) and <italic>D. melanogaster </italic>(DM) to identify conserved and connected subgraphs. We selected the comparisons of HS-DM, HS-SC, HS-MM and DM-SC as input data to predict and validate GO annotations against the scientific literature. Although biomedical research groups tend to focus their research on a single species and thus generate annotations for proteins of a particular organism, often their results are reported in a species independent way and due to relationships between species their research tends to be meaningful for studies in other species as well.</p> <p>For each protein under consideration we retrieved abstracts from EBIs Medline distribution (provided from the National Library of Medicine (NLM), Bethesda, U.S.A. Last release date: 04/06/2007). All abstracts are indexed based on IDs from UniProtKb/Swiss-Prot [##UREF##3##27##]. For the indexing all names and synonyms from UniProtKb/Swiss-Prot [##REF##16381842##28##] have been considered and ambiguous terms have been disambiguated using the methods described by Rebholz-Schuhmann <italic>et al</italic>. [##UREF##3##27##]. Retrieval of Medline abstracts has been performed using the Whatizit retrieval engine for Medline abstracts which is also accessible from outside of the EBI [##REF##18006544##29##]. Furthermore, we enriched this retrieval by additional references that are contained in the BioLexicon (work in progress). The BioLexicon is a new data resource that combines the protein term repository called "BioThesaurus" with other terminological resources (e.g., NCBI taxonomy, ChEBI) and adds linguistically relevant information [##REF##16267085##30##]. We used terms from the BioLexicon to retrieve additional references to Medline abstracts. All retrieved abstracts were processed and contained GO terms were automatically annotated in the document as described before (see Figure ##FIG##1##2##). Note that a given zone (e.g., a sentence) in the text can be annotated with several GO terms.</p> <p>As a result of the text processing, every sentence was enriched with several annotations: (1) all GO terms that have been identified in a particular zone, (2) annotations of terms with protein UniProtKb IDs and (3) species names (tagged by a species tagger). We associated a given protein with a GO term when protein, GO term and species name were identified in the same sentence. However, requiring that the species of the protein is mentioned in the same sentence is a strong restriction, since any UniProtKb ID itself encodes already its species. Therefore, we also extracted pairs consisting of the GO term associated to a certain UniProt ID without considering the species.</p> <p>We compared all identified GO terms to our predicted annotations of the proteins from the CCSs and to the annotations from other resources such as protein databases. For the comparison we use exact matching of GO terms and relative matching, where in the case of the relative matching we counted a GO term (e.g., from Medline) as a match if the term was identical to or was a direct ancestor or descendant of the term from the other sources (e.g., from CCS). Based on the relative matching we take into account the fact that GO differs in its granularity in the different branches of GO and that the specificity of terms differs across GO. Therefore, direct neighbors of a predicted term are considered to be valid and still highly specific for the annotation. Note that considering only direct neighbors is a rather strict criterion (see e.g. supplementary material of [##REF##15687504##31##] for a less strict criteria).</p> <p>We further studied all four combinations of the following two methods to assess annotations against literature (see Figure ##FIG##1##2##): (1) extraction of GO annotations of proteins with or without identification of the species and (2) comparison of GO annotations between resources based on exact versus relative matching.</p> <p>Furthermore, we distinguished different sets of proteins according to the way how we derived GO annotations from the CCS data. The first set (<bold>Set 1: Annotation by Orthology</bold>) is composed of 1000 proteins that have been randomly selected from the sets of orthologous proteins identified in the first step of the algorithm. This set has been chosen to serve as a baseline for the validation of predicted GO terms.</p> <p>In the second set (<bold>Set 2: Annotations of Proteins contained in CCSs</bold>) we included only proteins that are contained in a CCS which is the result of a pair-wise comparison between species. Proteins of this set are thus involved in interologs. We therein used species pairs HS-DM, HS-SC, HS-MM and DM-SC. The third set imposes more restrictions on the selection of proteins than Set 2 and forms a true subset of Set 2. In this set (<bold>Set 3: Annotations and Predictions of Proteins contained in CCSs with high functional coherence</bold>) we also considered protein annotations from the UniProtKb/Swiss-Prot database for the selection of proteins. Taking these annotations into account allows to select CCSs and proteins with high functional similarity. Set 3 can be divided into two subsets:</p> <p>1. Subset <bold>3a </bold>includes hypothetical new GO annotations that have been transferred between orthologous proteins as described in the method section.</p> <p>2. Subset <bold>3b </bold>comprises all protein annotations available in UniProtKb/Swiss-Prot of proteins contained in highly conserved CCSs.</p> <p>We expect an increasing recall from the first to the last set due to an increase in biological conservation (see Figure ##FIG##2##3##). The reason is that on the one hand the number of selected proteins and annotations is going down due to stricter selection conditions. Otherwise we expect to find more proteins and their annotations in text because of their higher biological relevance in several species.</p> <title>Evaluation of extracted results</title> <p>In information extraction precision and recall are defined as follows.</p> <p>• Precision: Percentage of correct findings amongst all findings by a method (= 100 * true positives/(true positives + false positives)).</p> <p>• Recall: Percentage of facts correctly identified by a method amongst all facts mentioned in the text. (= 100 * true positives/(true positives + false negatives))</p> <p>These definitions are suitable to evaluate the performance of an analytical method on individual instances of terms and facts in the text. The gold standard is defined by the content of databases where proteins are annotated with ontological concepts by curators. This implies, that new findings are counted as false positives. Therefore, the precision of the automatically generated annotation (predicted annotation) can only be assessed from one or several curators, since they form the gold standard for the content in the public databases.</p>
<title>Results</title> <p>The relative matching approach was used for all proteins and their annotations from Set 1 and 2. For these sets the known GO annotations from UniProtKb/Swiss-Prot were compared with the extracted GO annotations from the literature. For proteins from Set 3 all annotations were validated by using all four combinations of the extraction methods as explained above (Figure ##FIG##1##2##).</p> <p>The recall figures presented in the following are referring to annotations of a protein that have been verified by at least one occurrence of an annotation in the literature. This means that we distinguish between a validated and a non-validated annotation by counting each evidence for an association between a given protein and the mention of a GO annotation only once.</p> <title>Validation of predictions for Set 1, 2 and 3 based on annotations from the literature</title> <p>Table ##TAB##0##1## shows the results for proteins from Set 1. Annotations of orthologs have been confirmed for fly in 23% of the cases, for mouse in 27%, for human in 52% and for yeast in 55% resulting in an average recall of ~44% across all species. The low outcome for fly is the result of a low number of retrieved abstracts for fly proteins and protein functions of mouse are sparsely covered in literature, resulting in such a low recall (see Discussion).</p> <p>Table ##TAB##1##2## lists the number of confirmed annotations of proteins from Set 2, i.e. the use of CCSs to identify conservation in the structure of subnetworks yet without consideration of functional similarities. The average recall of annotations for topological conserved proteins is now increased to ~51% in comparison to the previous set. This increase indicates that more annotations for proteins constituting interologs are represented in the literature. Similar to Table ##TAB##0##1## the recall involving fly (especially for HS-DM) is lower compared to the rest. For DM-SC the lower results seem to be equalized by a higher accuracy of yeast.</p> <p>Table ##TAB##2##3## shows the recall of predicted and known GO annotations of Set 3. The number of confirmed GO annotations is the lowest when species matching and exact matching have been used and is highest when relative matching is used without requiring the species in the same sentence. When considering only the known annotations the average recall for any of the used methods on Set 3b is higher than the previously reported average recall for proteins from Set 1 and Set 2. In contrast to the results in Table ##TAB##0##1## and ##TAB##1##2## the recall for the known annotations with relative matching improved significantly for Set 3b up to ~82%.</p> <p>For the results of the relative matching method of Set 2 and 3 we also determined the redundancy of evidences in Medline. By redundancy, we mean the total number of occurrences of a specific protein – GO term association in Medline abstracts (which are represented in the recall as one hit). In detail, we gathered for Set 2 and 3 the median, the maximum and the average frequency of protein – GO term associations in text summarized in Table ##TAB##3##4##. Furthermore, we specified those frequencies separately for the three ontologies. We computed a median frequency of 11 for Set 2, and 33 and 9 respectively for Set 3 considering known and predicted annotations separately. Overall the highest frequencies have been observed for the subontology molecular function (MF).</p> <p>Similar observations have been made when considering the distribution of the detected terms across the three branches of GO in Set 3. Table ##TAB##4##5## shows the recall of known GO terms measured for the three subontologies of GO. Again the recall increased when moving from exact matching to relative matching and moving away from considering the species increased the recall again. Recall was lowest for biological process (BP) and was higher for cellular component (CC) and highest for molecular function (MF). Regarding the identification of GO terms in text other research shows that cellular location can be more precisely identified than for example molecular function [##REF##16287934##32##,##REF##15960834##33##].</p> <p>The GoTagger tags a sentence with a list of GO terms occurring within this sentence sorted by the significance and evidence of the GO terms. The distribution of the confirmed GO terms of Set 3 (predicted and known) across this list was considered as well as observed in which position of the list they were placed. The list was divided into blocks of positions 1 – 5, 6 – 10, 11 – 20 and &gt; 20. The occurrences of predicted and known GO terms in these ranges are shown in Table ##TAB##5##6##. Except for the first row in the table of the predicted terms the majority of the confirmed GO terms is always in first part of the list, and thus belongs to the more significant terms in the text which shows that our GO tagging method is reasonable.</p> <title>Prediction precision</title> <p>Set 3a comprised in total 88 predicted GO annotations. Out of this set 34 GO annotations (see supplementary Table S7 in Additional file ##SUPPL##0##1##) were confirmed from the literature based on relative matching. To estimate the accuracy of these predicted annotations the findings were given to a GO curator for assessment.</p> <p>All predictions were found to be correct (100% precision) and all have been verified through evidence gathered from the electronic data resources available to the GO curators. Be reminded that all 34 annotations are not yet contained in UniProtKb/Swiss-Prot (but will be soon).</p> <p>15 predicted GO annotations were verified through evidence retrieved in QuickGO and thus were not completely new annotations for the respective proteins. This discrepancy can be explained by the fact that we used only manually curated annotations as a basis for functional assessment and function prediction. Annotations from QuickGO confirming the predicted GO terms are inferred by electronic annotation using automatically methods such as Interpro or UniProt Enzyme Code mapping. This means that these 15 GO annotations were approved by other automatic prediction approaches and that they would still require manual annotation. The combination of our methods could be used to filter out such annotations for automatic integration into UniProtKb/Swiss-Prot.</p> <p>The remaining GO annotations in our set accounted for truly novel GO annotations for the considered proteins. Those terms differed in their specificity. Beside a few unspecific annotations, such as <italic>protein binding or transcriptional activator activity</italic>, the majority of proposed terms was rather specific, e.g. <italic>interleukin-7 receptor activity, α-glucosidase II complex and histone acetyltransferase activity</italic>. Validation of the proposed protein functions was approved by the CC lines of the corresponding UniProtKb/Swiss-Prot entries which are given in the supplementary Table S8 in Additional file ##SUPPL##0##1##. The CC lines contain free text comments on an entry to convey additional relevant information for a protein. Those comments are categorized into different topics according to the information they cover and especially the topics function, subunit or subcellular location yielded information to verify our predictions. Within these comments implicit protein information about function, biological process or cellular location are represented.</p> <p>However, these information have not been used for annotating the proteins explicitly with the corresponding GO terms, but those free text comments seem to be suited to identify and extract GO terms.</p>
<title>Discussion</title> <p>In this study, we analysed proteins and annotations of publicly available PPI data from several species. Considering the species separately, yeast proteins and their functions seem to be most frequently described in Medline. This is not surprising to us because yeast is known as one of the main model organism in different research areas. Surprisingly, we achieved the lowest recall of confirmed GO terms for fly proteins.</p> <p>We expected annotations of fly proteins to be found more frequently in literature because <italic>D. melanogaster </italic>is also a common model organism as yeast. The low recall in this analysis is probably strongly influenced by the difficulties in retrieving abstracts for the majority of fly proteins indicating the challenge of recognizing protein names of <italic>D. melanogaster </italic>in literature [##REF##15960821##13##]. Therefore, it was problematic to link GO terms to protein IDs in text, and consequently a smaller number GO terms have been extracted and compared. The recall of mouse and human protein functions lies in-between yeast and fly, where human protein functions are more frequent described and the recall is close to the one of yeast. The recall of mouse is similar to the recall of fly but slightly higher. Since mouse and human are very close we expected a similar recall for both species, but human proteins and their functions are more frequently discussed than mouse protein functions. Proteins of human seem to be more often subject of detailed small-scale studies because of their increased relevance in the onset of diseases and their functions are therefore more frequently covered in the scientific literature what accounts for the difference between the recalls.</p> <p>When considering only protein sets with known annotations, the average recall for annotations validated by published evidences increased starting from orthologous proteins (Set 1, ~44%) to proteins involved in conserved interactions (Set 2, ~51%) to proteins showing not only topological but also a strong functional conservation (Set 3b – known, ~82%). The increase of the recall in these three sets correlates to the level of biological conservation of the involved proteins and interologs (see Figure ##FIG##2##3##). This correlation indicates that proteins that are strongly conserved across various species are often well-studied and thus are described more explicitly in literature. This phenomenon could be called conservation of facts similar to the conservation of protein functions in CCSs.</p> <p>We considered 3a as a separate set, since it contains only predicted GO annotations in contrast to Set 1, 2 and 3b. The recall for predicted terms (3a) in Medline is 39%, half of the recall for known terms obtained from UniProtKb/Swiss-Prot (82%). This means that ~40% of the predicted annotations are described in the literature but are not yet contained in UniProtKb/Swiss-Prot. The question is why the remaining 60% of the predicted annotations are not contained in the literature. 18% of the known annotations are not found in the current form in Medline abstracts. Those annotations are curated information from literature and should be found in biomedical text. This could be explained by the fact that the GO terminology is not designed for text mining and therefore the undetected GO terms are difficult to identify with the current techniques. This probably accounts also for the number of unconfirmed predicted annotations since the annotations from UniprotKb/Swiss-Prot provide the basis for function prediction. Another reason is the inhomogeneous distribution of GO terms within Medline, i.e. there are GO terms more frequently described in abstracts and others mentioned less frequently or not at all. Furthermore, until now we considered only annotations contained in abstracts. We expect different results when applying the known techniques to full papers.</p> <p>Our method is not optimized to predict large amounts of novel protein functions, but for achieving a very high precision level. This emphasises the importance of combining different prediction approaches and shows that our method and results are applicable for protein function prediction.</p>
<title>Conclusion</title> <p>In our approach for automatic annotation of proteins with gene ontology terms we combine two distinct methods, i.e. the generation of connected and conserved subgraphs (CCSs) from PPI graphs with literature mining. To our knowledge such an approach has not been followed up to now. Applying these methods we achieved predictions at a high precision level outperforming other methods.</p> <p>This excellent result is mainly due to the fact that the molecular function of conserved proteins is well known to researchers even if the annotation is not yet contained in the public scientific databases. This interpretation is supported from our finding that the predicted annotations were found in the scientific literature for verification. Finally, a trained GO curator confirmed that all our newly predicted GO annotations which were approved by literature were correct. This result suggests that conserved proteins and their functions are explicitly discussed in the literature, i.e. these facts could be called conserved facts from the literature.</p> <p>Our approach shows that both data resources, databases and literature coalesce regarding their information content which is necessary for a reliable resourcing of biological data and in case of protein annotations for a sufficient coverage of proteins with GO terms. Our findings should encourage other scientists to increasingly rely on automatic prediction methods that integrate different resources including literature to generate reliable results based on automatic processing techniques.</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>Functional annotation of proteins remains a challenging task. Currently the scientific literature serves as the main source for yet uncurated functional annotations, but curation work is slow and expensive. Automatic techniques that support this work are still lacking reliability. We developed a method to identify conserved protein interaction graphs and to predict missing protein functions from orthologs in these graphs. To enhance the precision of the results, we furthermore implemented a procedure that validates all predictions based on findings reported in the literature.</p> <title>Results</title> <p>Using this procedure, more than 80% of the GO annotations for proteins with highly conserved orthologs that are available in UniProtKb/Swiss-Prot could be verified automatically. For a subset of proteins we predicted new GO annotations that were not available in UniProtKb/Swiss-Prot. All predictions were correct (100% precision) according to the verifications from a trained curator.</p> <title>Conclusion</title> <p>Our method of integrating CCSs and literature mining is thus a highly reliable approach to predict GO annotations for weakly characterized proteins with orthologs.</p>
<title>Competing interests</title> <p>The authors declare that they have no competing interests.</p> <title>Authors' contributions</title> <p>SJ: developed the method to identify conserved protein interaction subgraphs and to predict missing protein functions, carried out the studies described in this paper and contributed to the manuscript. SG: developed and implemented the text mining method for identifying GO terms in text and contributed to the manuscript. UL: conceived part of the study and contributed to the manuscript. DR: conceived part of the study and contributed to the manuscript. All authors read and approved the final manuscript.</p> <title>Supplementary Material</title>
<title>Acknowledgements</title> <p>This research work has been supported by the Network of Excellence 'Semantic Interoperability and Data Mining in Biomedicine' (NoE 507505). Medline abstracts are provided from the National Library of Medicine (NLM, Bethesda, MD, USA) and PubMed [##REF##16287934##32##] is the premier Web portal to access the data. Sylvain Gaudan is supported by an 'E-STAR' fellowship funded by the EC's FP6 Marie Curie Host fellowship for Early Stage Research Training under contract number MESTCT-2004-504640.</p> <p>Samira Jaeger is supported by NaFöG.</p> <p>Emily Dimmer supported this work by curating the predicted GO annotations.</p> <p>This article has been published as part of <italic>BMC Bioinformatics </italic>Volume 9 Supplement 8, 2008: Selected proceedings of the Fifth International Workshop on Data Integration in the Life Sciences 2008. The full contents of the supplement are available online at <ext-link ext-link-type="uri" xlink:href="http://www.biomedcentral.com/1471-2105/9?issue=S8"/>.</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p><bold>Example CCS detected between <italic>H. sapiens</italic> and<italic> S. cerevisiae</italic></bold>. The figure shows a conserved and connected subgraph between <italic>H. sapiens </italic>(circle) and <italic>S. cerevisiae </italic>(hexagon). Proteins of both species are involved in mRNA splicing and are known to exhibit splicing factor activity to bind the mRNA and support the splicing process. (Solid lines represent conserved PPIs within a species and dashed lines indicate orthology relationships between proteins.)</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Schematic illustration for comparing GO annotations in this study</bold>. The flowchart summarizes all four combinations for comparing GO annotations of different resources. Protein – annotation associations were extracted from text with or without species identification and GO annotations from text and the UniProtKb/Swiss-Prot database were compared based on exact versus relative matching.</p></caption></fig> <fig position="float" id="F3"><label>Figure 3</label><caption><p><bold>Schematic overview of the studied protein annotations</bold>. Schematic overview of the different sets of protein – annotation associations considered in this study.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>Evidences for protein – GO annotation associations in text for Set 1. Evidences in the literature for annotations of randomly chosen orthologous proteins – Set 1 – compared with relative matching.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="center">Species</td><td align="center">Recall</td></tr></thead><tbody><tr><td align="center">DM</td><td align="center">470/2046 (23.0%)</td></tr><tr><td align="center">MM</td><td align="center">859/3141 (27.3%)</td></tr><tr><td align="center">SC</td><td align="center">2747/4974 (55.2%)</td></tr><tr><td align="center">HS</td><td align="center">2801/5419 (51.7%)</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>Evidences for protein – GO annotation associations in text for Set 2. Evidences in the literature for annotations from UniProtKb/Swiss-Prot considering only proteins of structurally conserved subgraphs – Set 2 – compared with relative matching.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="center">PPI Comparison</td><td align="center">Recall</td></tr></thead><tbody><tr><td align="center">DM-SC</td><td align="center">34/78 (43.6%)</td></tr><tr><td align="center">HS-DM</td><td align="center">149/427 (35.0%)</td></tr><tr><td align="center">HS-SC</td><td align="center">1002/1796 (56.0%)</td></tr><tr><td align="center">HS-MM</td><td align="center">3083/6119 (49.6%)</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T3"><label>Table 3</label><caption><p>Evidences for protein – GO annotation associations in text for Set 3. Comparing newly predicted GO terms (Set 3a) and known GO terms (Set 3b) from UniProtKb/Swiss-Prot with protein – GO annotation associations in Medline using different extraction criteria.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="center">Extraction criteria</td><td align="center">GO term Set</td><td align="center">Recall</td></tr></thead><tbody><tr><td align="center">Exact &amp; Species</td><td align="center">predicted GO terms</td><td align="center">19/88 (22%)</td></tr><tr><td/><td align="center">known GO terms</td><td align="center">129/283 (46%)</td></tr><tr><td align="center">Relative &amp; Species</td><td align="center">predicted GO terms</td><td align="center">21/88 (24%)</td></tr><tr><td/><td align="center">known GO terms</td><td align="center">164/283 (58%)</td></tr><tr><td align="center">Exact</td><td align="center">predicted GO terms</td><td align="center">31/88 (35%)</td></tr><tr><td/><td align="center">known GO terms</td><td align="center">201/283 (71%)</td></tr><tr><td align="center">Relative</td><td align="center">new GO terms</td><td align="center">34/88 (39%)</td></tr><tr><td/><td align="center">known GO terms</td><td align="center">234/283 (82%)</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T4"><label>Table 4</label><caption><p>Redundancy of protein – GO term associations in Medline. Median, maximum and average frequencies of protein – GO term associations for proteins of Set 2 and 3 in Medline.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="center">Protein Set</td><td align="center">Frequencies</td><td align="center">Total</td><td align="center">MF</td><td align="center">BP</td><td align="center">CC</td></tr></thead><tbody><tr><td align="center">Set 2</td><td align="center">median</td><td align="center">11</td><td align="center">15</td><td align="center">10</td><td align="center">7</td></tr><tr><td/><td align="center">max.</td><td align="center">19855</td><td align="center">2990</td><td align="center">19855</td><td align="center">3132</td></tr><tr><td/><td align="center">mean</td><td align="center">72</td><td align="center">77</td><td align="center">89</td><td align="center">25</td></tr><tr><td align="center">Set 3a (predicted)</td><td align="center">median</td><td align="center">9</td><td align="center">12</td><td align="center">18</td><td align="center">3</td></tr><tr><td/><td align="center">max.</td><td align="center">907</td><td align="center">907</td><td align="center">88</td><td align="center">66</td></tr><tr><td/><td align="center">mean</td><td align="center">47</td><td align="center">55</td><td align="center">40</td><td align="center">3</td></tr><tr><td align="center">Set 3b (known)</td><td align="center">median</td><td align="center">33</td><td align="center">51</td><td align="center">18</td><td align="center">27</td></tr><tr><td/><td align="center">max.</td><td align="center">6566</td><td align="center">6566</td><td align="center">2053</td><td align="center">1823</td></tr><tr><td/><td align="center">mean</td><td align="center">199</td><td align="center">328</td><td align="center">153</td><td align="center">87</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T5"><label>Table 5</label><caption><p>Distribution of confirmed GO terms across the three subontologies of GO. Subontology specific consideration of known GO terms (Set 3b) confirmed by literature.</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="center">Extraction criteria</td><td align="center">Recall – MF</td><td align="center">Recall – BP</td><td align="center">Recall – CC</td></tr></thead><tbody><tr><td align="center">Exact &amp; Species</td><td align="center">56/107 (52%)</td><td align="center">31/85 (36%)</td><td align="center">42/91 (46%)</td></tr><tr><td align="center">Relative &amp; Species</td><td align="center">71/107 (66%)</td><td align="center">41/85 (48%)</td><td align="center">52/91 (57%)</td></tr><tr><td align="center">Exact</td><td align="center">83/107 (77%)</td><td align="center">51/85 (60%)</td><td align="center">67/91 (73%)</td></tr><tr><td align="center">Relative</td><td align="center">90/107 (84%)</td><td align="center">69/85 (81%)</td><td align="center">75/91 (82%)</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T6"><label>Table 6</label><caption><p>Distribution of confirmed GO terms by significance and evidence. Distribution of the identified terms over the list specified by the GoTagger separated into predicted (3a) and known annotations (3b).</p></caption><table frame="hsides" rules="groups"><thead><tr><td/><td align="center" colspan="5">predicted GO terms</td><td align="center" colspan="5">known GO terms</td></tr><tr><td align="left">Extraction criteria</td><td align="center"># terms</td><td align="center">1–5</td><td align="center">6–10</td><td align="center">11–20</td><td align="center">&gt;20</td><td align="center"># terms</td><td align="center">1–5</td><td align="center">6–10</td><td align="center">11–20</td><td align="center">&gt;20</td></tr></thead><tbody><tr><td align="left">Exact &amp; Species</td><td align="center">19</td><td align="center">5</td><td align="center">6</td><td align="center">3</td><td align="center">5</td><td align="center">129</td><td align="center">60</td><td align="center">35</td><td align="center">16</td><td align="center">18</td></tr><tr><td align="left">Relative &amp; Species</td><td align="center">21</td><td align="center">10</td><td align="center">8</td><td align="center">2</td><td align="center">1</td><td align="center">164</td><td align="center">82</td><td align="center">37</td><td align="center">20</td><td align="center">25</td></tr><tr><td align="left">Exact</td><td align="center">31</td><td align="center">18</td><td align="center">7</td><td align="center">3</td><td align="center">3</td><td align="center">201</td><td align="center">125</td><td align="center">39</td><td align="center">22</td><td align="center">15</td></tr><tr><td align="left">Relative</td><td align="center">34</td><td align="center">25</td><td align="center">5</td><td align="center">3</td><td align="center">1</td><td align="center">234</td><td align="center">163</td><td align="center">36</td><td align="center">17</td><td align="center">18</td></tr></tbody></table></table-wrap>
<disp-formula id="bmcM1"><label>(1)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1471-2105-9-S8-S2-i1" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:mi>I</mml:mi>
                           <mml:mo stretchy="false">(</mml:mo>
                           <mml:mi>t</mml:mi>
                           <mml:mo stretchy="false">)</mml:mo>
                           <mml:mo>=</mml:mo>
                           <mml:mstyle displaystyle="true">
                              <mml:munder>
                                 <mml:mo>∑</mml:mo>
                                 <mml:mrow>
                                    <mml:mi>w</mml:mi>
                                    <mml:mo>∈</mml:mo>
                                    <mml:mi>t</mml:mi>
                                    <mml:mi>o</mml:mi>
                                    <mml:mi>k</mml:mi>
                                    <mml:mo stretchy="false">(</mml:mo>
                                    <mml:mi>t</mml:mi>
                                    <mml:mo stretchy="false">)</mml:mo>
                                 </mml:mrow>
                              </mml:munder>
                              <mml:mrow>
                                 <mml:mo>−</mml:mo>
                                 <mml:mi>l</mml:mi>
                                 <mml:mi>o</mml:mi>
                                 <mml:mi>g</mml:mi>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:mi>p</mml:mi>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:mi>w</mml:mi>
                                 <mml:mo stretchy="false">)</mml:mo>
                                 <mml:mo stretchy="false">)</mml:mo>
                              </mml:mrow>
                           </mml:mstyle>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM2"><label>(2)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1471-2105-9-S8-S2-i2" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:mi>e</mml:mi>
                           <mml:mo stretchy="false">(</mml:mo>
                           <mml:mi>z</mml:mi>
                           <mml:mo>,</mml:mo>
                           <mml:mi>t</mml:mi>
                           <mml:mo stretchy="false">)</mml:mo>
                           <mml:mo>=</mml:mo>
                           <mml:mfrac>
                              <mml:mrow>
                                 <mml:mi>I</mml:mi>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:mi>z</mml:mi>
                                 <mml:mo>∩</mml:mo>
                                 <mml:mi>t</mml:mi>
                                 <mml:mo stretchy="false">)</mml:mo>
                              </mml:mrow>
                              <mml:mrow>
                                 <mml:mi>I</mml:mi>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:mi>t</mml:mi>
                                 <mml:mo stretchy="false">)</mml:mo>
                              </mml:mrow>
                           </mml:mfrac>
                           <mml:mo>=</mml:mo>
                           <mml:mfrac>
                              <mml:mrow>
                                 <mml:mstyle displaystyle="true">
                                    <mml:msub>
                                       <mml:mo>∑</mml:mo>
                                       <mml:mrow>
                                          <mml:mi>w</mml:mi>
                                          <mml:mo>∈</mml:mo>
                                          <mml:mi>t</mml:mi>
                                          <mml:mi>o</mml:mi>
                                          <mml:mi>k</mml:mi>
                                          <mml:mo stretchy="false">(</mml:mo>
                                          <mml:mi>z</mml:mi>
                                          <mml:mo stretchy="false">)</mml:mo>
                                          <mml:mo>∩</mml:mo>
                                          <mml:mi>t</mml:mi>
                                          <mml:mi>o</mml:mi>
                                          <mml:mi>k</mml:mi>
                                          <mml:mo stretchy="false">(</mml:mo>
                                          <mml:mi>t</mml:mi>
                                          <mml:mo stretchy="false">)</mml:mo>
                                       </mml:mrow>
                                    </mml:msub>
                                    <mml:mrow>
                                       <mml:mo>−</mml:mo>
                                       <mml:mi>l</mml:mi>
                                       <mml:mi>o</mml:mi>
                                       <mml:mi>g</mml:mi>
                                       <mml:mo stretchy="false">(</mml:mo>
                                       <mml:mi>p</mml:mi>
                                       <mml:mo stretchy="false">(</mml:mo>
                                       <mml:mi>w</mml:mi>
                                       <mml:mo stretchy="false">)</mml:mo>
                                       <mml:mo stretchy="false">)</mml:mo>
                                    </mml:mrow>
                                 </mml:mstyle>
                              </mml:mrow>
                              <mml:mrow>
                                 <mml:mstyle displaystyle="true">
                                    <mml:msub>
                                       <mml:mo>∑</mml:mo>
                                       <mml:mrow>
                                          <mml:mi>w</mml:mi>
                                          <mml:mo>∈</mml:mo>
                                          <mml:mi>t</mml:mi>
                                          <mml:mi>o</mml:mi>
                                          <mml:mi>k</mml:mi>
                                          <mml:mo stretchy="false">(</mml:mo>
                                          <mml:mi>t</mml:mi>
                                          <mml:mo stretchy="false">)</mml:mo>
                                       </mml:mrow>
                                    </mml:msub>
                                    <mml:mrow>
                                       <mml:mo>−</mml:mo>
                                       <mml:mi>l</mml:mi>
                                       <mml:mi>o</mml:mi>
                                       <mml:mi>g</mml:mi>
                                       <mml:mo stretchy="false">(</mml:mo>
                                       <mml:mi>p</mml:mi>
                                       <mml:mo stretchy="false">(</mml:mo>
                                       <mml:mi>w</mml:mi>
                                       <mml:mo stretchy="false">)</mml:mo>
                                       <mml:mo stretchy="false">)</mml:mo>
                                    </mml:mrow>
                                 </mml:mstyle>
                              </mml:mrow>
                           </mml:mfrac>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM3"><label>(3)</label><italic>W </italic>= <italic>tok</italic>(<italic>z</italic>) ⋂ <italic>tok</italic>(<italic>t</italic>) = {<italic>w</italic><sub>0</sub>,..., <italic>w</italic><sub><italic>n </italic>- 1</sub>}.</disp-formula> <disp-formula id="bmcM4"><label>(4)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1471-2105-9-S8-S2-i3" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:mi>D</mml:mi>
                           <mml:mo stretchy="false">(</mml:mo>
                           <mml:mi>W</mml:mi>
                           <mml:mo>,</mml:mo>
                           <mml:mi>z</mml:mi>
                           <mml:mo stretchy="false">)</mml:mo>
                           <mml:mo>=</mml:mo>
                           <mml:mstyle displaystyle="true">
                              <mml:munder>
                                 <mml:mo>∑</mml:mo>
                                 <mml:mrow>
                                    <mml:msub>
                                       <mml:mi>w</mml:mi>
                                       <mml:mi>i</mml:mi>
                                    </mml:msub>
                                    <mml:mo>∈</mml:mo>
                                    <mml:mi>W</mml:mi>
                                    <mml:mo>,</mml:mo>
                                    <mml:msub>
                                       <mml:mi>w</mml:mi>
                                       <mml:mi>j</mml:mi>
                                    </mml:msub>
                                    <mml:mo>∈</mml:mo>
                                    <mml:mi>W</mml:mi>
                                 </mml:mrow>
                              </mml:munder>
                              <mml:mrow>
                                 <mml:mi>d</mml:mi>
                                 <mml:mi>i</mml:mi>
                                 <mml:mi>s</mml:mi>
                                 <mml:mi>t</mml:mi>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:msub>
                                    <mml:mi>w</mml:mi>
                                    <mml:mi>i</mml:mi>
                                 </mml:msub>
                                 <mml:mo>,</mml:mo>
                                 <mml:msub>
                                    <mml:mi>w</mml:mi>
                                    <mml:mi>j</mml:mi>
                                 </mml:msub>
                                 <mml:mo>,</mml:mo>
                                 <mml:mi>z</mml:mi>
                                 <mml:mo stretchy="false">)</mml:mo>
                              </mml:mrow>
                           </mml:mstyle>
                           <mml:mo>.</mml:mo>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM5"><label>(5)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1471-2105-9-S8-S2-i4" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:msub>
                              <mml:mi>D</mml:mi>
                              <mml:mrow>
                                 <mml:mi>m</mml:mi>
                                 <mml:mi>i</mml:mi>
                                 <mml:mi>n</mml:mi>
                              </mml:mrow>
                           </mml:msub>
                           <mml:mo stretchy="false">(</mml:mo>
                           <mml:mi>W</mml:mi>
                           <mml:mo stretchy="false">)</mml:mo>
                           <mml:mo>=</mml:mo>
                           <mml:mstyle displaystyle="true">
                              <mml:munderover>
                                 <mml:mo>∑</mml:mo>
                                 <mml:mrow>
                                    <mml:mi>i</mml:mi>
                                    <mml:mo>=</mml:mo>
                                    <mml:mn>0</mml:mn>
                                 </mml:mrow>
                                 <mml:mrow>
                                    <mml:mi>n</mml:mi>
                                    <mml:mo>−</mml:mo>
                                    <mml:mn>1</mml:mn>
                                 </mml:mrow>
                              </mml:munderover>
                              <mml:mrow>
                                 <mml:mstyle displaystyle="true">
                                    <mml:munderover>
                                       <mml:mo>∑</mml:mo>
                                       <mml:mrow>
                                          <mml:mi>j</mml:mi>
                                          <mml:mo>=</mml:mo>
                                          <mml:mn>0</mml:mn>
                                       </mml:mrow>
                                       <mml:mrow>
                                          <mml:mi>n</mml:mi>
                                          <mml:mo>−</mml:mo>
                                          <mml:mn>1</mml:mn>
                                       </mml:mrow>
                                    </mml:munderover>
                                    <mml:mrow>
                                       <mml:mo>|</mml:mo>
                                       <mml:mi>i</mml:mi>
                                       <mml:mo>−</mml:mo>
                                       <mml:mi>j</mml:mi>
                                       <mml:mo>|</mml:mo>
                                    </mml:mrow>
                                 </mml:mstyle>
                              </mml:mrow>
                           </mml:mstyle>
                           <mml:mo>.</mml:mo>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM6"><label>(6)</label><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1471-2105-9-S8-S2-i5" overflow="scroll">
                     <mml:semantics>
                        <mml:mrow>
                           <mml:mi>p</mml:mi>
                           <mml:mi>r</mml:mi>
                           <mml:mo stretchy="false">(</mml:mo>
                           <mml:mi>W</mml:mi>
                           <mml:mo>,</mml:mo>
                           <mml:mi>z</mml:mi>
                           <mml:mo stretchy="false">)</mml:mo>
                           <mml:mo>=</mml:mo>
                           <mml:mfrac>
                              <mml:mrow>
                                 <mml:msub>
                                    <mml:mi>D</mml:mi>
                                    <mml:mrow>
                                       <mml:mi>m</mml:mi>
                                       <mml:mi>i</mml:mi>
                                       <mml:mi>n</mml:mi>
                                    </mml:mrow>
                                 </mml:msub>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:mi>W</mml:mi>
                                 <mml:mo stretchy="false">)</mml:mo>
                              </mml:mrow>
                              <mml:mrow>
                                 <mml:mi>D</mml:mi>
                                 <mml:mo stretchy="false">(</mml:mo>
                                 <mml:mi>W</mml:mi>
                                 <mml:mo>,</mml:mo>
                                 <mml:mi>z</mml:mi>
                                 <mml:mo stretchy="false">)</mml:mo>
                              </mml:mrow>
                           </mml:mfrac>
                           <mml:mo>≤</mml:mo>
                           <mml:mn>1.</mml:mn>
                        </mml:mrow>
                        
                     </mml:semantics>
                  </mml:math></disp-formula> <disp-formula id="bmcM7"><label>(7)</label><italic>s</italic>(<italic>z</italic>, <italic>t</italic>) = <italic>e</italic>(<italic>z</italic>, <italic>t</italic>)<sup><italic>α</italic></sup>·<italic>I</italic>(<italic>t</italic>)<sup><italic>β</italic></sup>·<italic>pr</italic>(<italic>W</italic>, <italic>z</italic>)<sup><italic>γ</italic></sup>.</disp-formula>
<supplementary-material content-type="local-data" id="S1"><caption><title>Additional file 1</title><p><bold>Predicted GO annotations and supporting evidences</bold>. List of predicted and confirmed GO terms and additional information that support their correctness. This file contains the two supplementary tables S7 and S8. Table S7 presents the set of 34 predicted GO terms that were confirmed from the literature based on relative matching and found to be correct by manual assessment by a GO curator. Table S8 lists truly novel GO terms that were not predicted by other automated function prediction methods as well as the corresponding evidences from the UniProtKb/Swiss-Prot CC lines that support their correctness.</p></caption></supplementary-material>
<graphic xlink:href="1471-2105-9-S8-S2-1"/> <graphic xlink:href="1471-2105-9-S8-S2-2"/> <graphic xlink:href="1471-2105-9-S8-S2-3"/>
<media xlink:href="1471-2105-9-S8-S2-S1.pdf" mimetype="application" mime-subtype="pdf"><caption><p>Click here for file</p></caption></media>
[{"surname": ["Pandey", "Kumar", "Steinbach"], "given-names": ["G", "V", "M"], "article-title": ["Computational Approaches for Protein Function Prediction: A survey"], "source": ["Tech Rep TR-06-028"], "year": ["2006"], "publisher-name": ["Department of Computer Science and Engineering, University of Minnesota"]}, {"surname": ["Jaeger", "Leser", "Falter C, Schliep A, Selbig J, Vingron M, Walther D"], "given-names": ["S", "U"], "article-title": ["High-Precision Function Prediction using Conserved Interactions"], "source": ["German Conference on Bioinformatics, Volume 115 of LNI GI"], "year": ["2007"], "fpage": ["146"], "lpage": ["162"]}, {"surname": ["Couto", "Silva", "Pedro Coutinho"], "given-names": ["FM", "MJ", "PM"], "article-title": ["Measuring semantic similarity between Gene Ontology terms"], "source": ["Data Knowl Eng"], "year": ["2007"], "volume": ["61"], "fpage": ["137"], "lpage": ["152"], "pub-id": ["10.1016/j.datak.2006.05.003"]}, {"surname": ["Rebholz-Schuhmann", "Kirsch", "Gaudan", "Arregui", "Nenadic"], "given-names": ["D", "H", "S", "M", "G"], "article-title": ["Annotation and Disambiguation of Semantic Types in Biomedical Text a Cascaded Approach to Named Entity Recognition. Workshop on multidimensional markup with Xml (XMLNLP)"], "source": ["EACL 2006"], "year": ["2006"]}, {"article-title": ["PubMed"]}]
BMC Bioinformatics. 2008 Jul 22; 9(Suppl 8):S2