ArticlePLoS computational biology2014
Negative example selection for protein function prediction: the NoGO database.
Article in PLoS computational biology, 2014. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
19 citing papers in PubMed.
- Article
- Architectural good practices for reproducible benchmarking in protein machine learning.Frontiers in bioinformatics · 2026Article
- Revisiting co-expression-based automated function prediction in yeast with neural networks and updated Gene Ontology annotations.PloS one · 2026Article
- Defining the extent of gene function using ROC curvature.Bioinformatics (Oxford, England) · 2022Article
- Bioinformatic Analyses of Peroxiredoxins and RF-Prx: A Random Forest-Based Predictor and Classifier for Prxs.Methods in molecular biology (Clifton, N.J.) · 2022Article
- A roadmap for metagenomic enzyme discovery.Natural product reports · 2021Review
- Computational Methods for Prediction of Human Protein-Phenotype Associations: A Review.Phenomics (Cham, Switzerland) · 2021Review
- Review
- Benchmarking gene ontology function predictions using negative annotations.Bioinformatics (Oxford, England) · 2020Article
- Supervised learning is an accurate method for network-based gene classification.Bioinformatics (Oxford, England) · 2020Article
- A Literature Review of Gene Function Prediction by Modeling Gene Ontology.Frontiers in genetics · 2020Review
- Combining learning and constraints for genome-wide protein annotation.BMC bioinformatics · 2019Article
- Evaluating the impact of topological protein features on the negative examples selection.BMC bioinformatics · 2018Article
- Prototyping a precision oncology 3.0 rapid learning platform.BMC bioinformatics · 2018Article
- Large-scale identification of human protein function using topological features of interaction network.Scientific reports · 2016Article
- Review
- Predicting protein functions using incomplete hierarchical labels.BMC bioinformatics · 2015Article
- Integrating multiple networks for protein function prediction.BMC systems biology · 2015Article
- Genome-scale identification and characterization of moonlighting proteins.Biology direct · 2014Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
Negative examples - genes that are known not to carry out a given protein function - are rarely recorded in genome and proteome annotation databases, such as the Gene Ontology database. Negative examples are required, however, for several of the most powerful machine learning methods for integrative protein function prediction. Most protein function prediction efforts have relied on a variety of heuristics for the choice of negative examples. Determining the accuracy of methods for negative example prediction is itself a non-trivial task, given that the Open World Assumption as applied to gene annotations rules out many traditional validation metrics. We present a rigorous comparison of these heuristics, utilizing a temporal holdout, and a novel evaluation strategy for negative examples. We add to this comparison several algorithms adapted from Positive-Unlabeled learning scenarios in text-classification, which are the current state of the art methods for generating negative examples in low-density annotation contexts. Lastly, we present two novel algorithms of our own construction, one based on empirical conditional probability, and the other using topic modeling applied to genes and annotations. We demonstrate that our algorithms achieve significantly fewer incorrect negative example predictions than the current state of the art, using multiple benchmarks covering multiple organisms. Our methods may be applied to generate negative examples for any type of method that deals with protein function, and to this end we provide a database of negative examples in several well-studied organisms, for general use (The NoGO database, available at: bonneaulab.bio.nyu.edu/nogo.html).
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.