Dataset Information

Exploring inconsistencies in genome-wide protein function annotations: a machine learning approach.

ABSTRACT:

Background

Incorrectly annotated sequence data are becoming more commonplace as databases increasingly rely on automated techniques for annotation. Hence, there is an urgent need for computational methods for checking consistency of such annotations against independent sources of evidence and detecting potential annotation errors. We show how a machine learning approach designed to automatically predict a protein's Gene Ontology (GO) functional class can be employed to identify potential gene annotation errors.

Results

In a set of 211 previously annotated mouse protein kinases, we found that 201 of the GO annotations returned by AmiGO appear to be inconsistent with the UniProt functions assigned to their human counterparts. In contrast, 97% of the predicted annotations generated using a machine learning approach were consistent with the UniProt annotations of the human counterparts, as well as with available annotations for these mouse protein kinases in the Mouse Kinome database.

Conclusion

We conjecture that most of our predicted annotations are, therefore, correct and suggest that the machine learning approach developed here could be routinely used to detect potential errors in GO annotations generated by high-throughput gene annotation projects. Editors Note: Authors from the original publication (Okazaki et al.: Nature 2002, 420:563-73) have provided their response to Andorf et al, directly following the correspondence.

SUBMITTER: Andorf C

PROVIDER: S-EPMC1994202 | biostudies-literature | 2007 Aug

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Exploring inconsistencies in genome-wide protein function annotations: a machine learning approach.

Andorf Carson C Dobbs Drena D Honavar Vasant V

BMC bioinformatics 20070803

<h4>Background</h4>Incorrectly annotated sequence data are becoming more commonplace as databases increasingly rely on automated techniques for annotation. Hence, there is an urgent need for computational methods for checking consistency of such annotations against independent sources of evidence and detecting potential annotation errors. We show how a machine learning approach designed to automatically predict a protein's Gene Ontology (GO) functional class can be employed to identify potential ...[more]

PMID: 17683567

Similar Datasets

Project description:We previously developed EFICAz, an enzyme function inference approach that combines predictions from non-completely overlapping component methods. Two of the four components in the original EFICAz are based on the detection of functionally discriminating residues (FDRs). FDRs distinguish between member of an enzyme family that are homofunctional (classified under the EC number of interest) or heterofunctional (annotated with another EC number or lacking enzymatic activity). Each of the two FDR-based components is associated to one of two specific kinds of enzyme families. EFICAz exhibits high precision performance, except when the maximal test to training sequence identity (MTTSI) is lower than 30%. To improve EFICAz's performance in this regime, we: i) increased the number of predictive components and ii) took advantage of consensual information from the different components to make the final EC number assignment.We have developed two new EFICAz components, analogs to the two FDR-based components, where the discrimination between homo and heterofunctional members is based on the evaluation, via Support Vector Machine models, of all the aligned positions between the query sequence and the multiple sequence alignments associated to the enzyme families. Benchmark results indicate that: i) the new SVM-based components outperform their FDR-based counterparts, and ii) both SVM-based and FDR-based components generate unique predictions. We developed classification tree models to optimally combine the results from the six EFICAz components into a final EC number prediction. The new implementation of our approach, EFICAz2, exhibits a highly improved prediction precision at MTTSI < 30% compared to the original EFICAz, with only a slight decrease in prediction recall. A comparative analysis of enzyme function annotation of the human proteome by EFICAz2 and KEGG shows that: i) when both sources make EC number assignments for the same protein sequence, the assignments tend to be consistent and ii) EFICAz2 generates considerably more unique assignments than KEGG.Performance benchmarks and the comparison with KEGG demonstrate that EFICAz2 is a powerful and precise tool for enzyme function annotation, with multiple applications in genome analysis and metabolic pathway reconstruction. The EFICAz2 web service is available at: http://cssb.biology.gatech.edu/skolnick/webservice/EFICAz2/index.html.

Project description:Spontaneous activity is a common feature of immature neuronal networks throughout the central nervous system and plays an important role in network development and consolidation. In postnatal rodents, spontaneous activity in the spinal cord exhibits complex, stochastic patterns that have historically proven challenging to characterize. We developed a software tool for quickly and automatically characterizing and classifying episodes of spontaneous activity generated from developing spinal networks. We recorded spontaneous activity from in vitro lumbar ventral roots of 16 neonatal [postnatal day (P)0-P3] mice. Recordings were DC coupled and detrended, and episodes were separated for analysis. Amplitude-, duration-, and frequency-related features were extracted from each episode and organized into five classes. Paired classes and features were used to train and test supervised machine learning algorithms. Multilayer perceptrons were used to classify episodes as rhythmic or multiburst. We increased network excitability with potassium chloride and tested the utility of the tool to detect changes in features and episode class. We also demonstrate usability by having a novel experimenter use the program to classify episodes collected at a later time point (P5). Supervised machine learning-based classification of episodes accounted for changes that traditional approaches cannot detect. Our tool, named SpontaneousClassification, advances the detail in which we can study not only developing spinal networks, but also spontaneous networks in other areas of the nervous system. NEW & NOTEWORTHY Spontaneous activity is important for nervous system network development and consolidation. Our software uses machine learning to automatically and quickly characterize and classify episodes of spontaneous activity in the spinal cord of newborn mice. It detected changes in network activity following KCl-enhanced excitation. Using our software to classify spontaneous activity throughout development, in pathological models, or with neuromodulation, may offer insight into the development and organization of spinal circuits.

Project description:BACKGROUND: The genome-wide identification of both morbid genes, i.e., those genes whose mutations cause hereditary human diseases, and druggable genes, i.e., genes coding for proteins whose modulation by small molecules elicits phenotypic effects, requires experimental approaches that are time-consuming and laborious. Thus, a computational approach which could accurately predict such genes on a genome-wide scale would be invaluable for accelerating the pace of discovery of causal relationships between genes and diseases as well as the determination of druggability of gene products. RESULTS: In this paper we propose a machine learning-based computational approach to predict morbid and druggable genes on a genome-wide scale. For this purpose, we constructed a decision tree-based meta-classifier and trained it on datasets containing, for each morbid and druggable gene, network topological features, tissue expression profile and subcellular localization data as learning attributes. This meta-classifier correctly recovered 65% of known morbid genes with a precision of 66% and correctly recovered 78% of known druggable genes with a precision of 75%. It was than used to assign morbidity and druggability scores to genes not known to be morbid and druggable and we showed a good match between these scores and literature data. Finally, we generated decision trees by training the J48 algorithm on the morbidity and druggability datasets to discover cellular rules for morbidity and druggability and, among the rules, we found that the number of regulating transcription factors and plasma membrane localization are the most important factors to morbidity and druggability, respectively. CONCLUSIONS: We were able to demonstrate that network topological features along with tissue expression profile and subcellular localization can reliably predict human morbid and druggable genes on a genome-wide scale. Moreover, by constructing decision trees based on these data, we could discover cellular rules governing morbidity and druggability.

Dataset Information

Exploring inconsistencies in genome-wide protein function annotations: a machine learning approach.

Background

Results

Conclusion

Publications

Exploring inconsistencies in genome-wide protein function annotations: a machine learning approach.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure