Evidence map›Paper›PMID 36510133›Full record

ArticleBMC bioinformatics2022

Improving automatic GO annotation with semantic similarity.

Bishnu Sarker, Navya Khare, Marie-Dominique Devignes, Sabeur Aridhi

Open access · goldAbstract read
In one paragraph

Article in BMC bioinformatics, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing papers in PubMed
0.9field-weighted citation impact, top 28% of its field
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

5 citing papers in PubMed, 10 citations in OpenAlex.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors at 2 institutions in 4 countries.

Bishnu SarkerCNRS, Inria, LORIA, University of Lorraine, 54000, Nancy, France.
Navya KhareCNRS, Inria, LORIA, University of Lorraine, 54000, Nancy, France.
Marie-Dominique DevignesCNRS, Inria, LORIA, University of Lorraine, 54000, Nancy, France.
Sabeur AridhiCNRS, Inria, LORIA, University of Lorraine, 54000, Nancy, France. sabeur.aridhi@loria.fr.ORCID http://orcid.org/0000-0002-3657-3762
Centre National de la Recherche Scientifique · FRMeharry Medical College · US

Funding

Agence Nationale de la Recherche ANR-15-RHUS-0004CNRS-INRIA/FAPs PRC2243
6 · The paper itself

Abstract

backgroundAutomatic functional annotation of proteins is an open research problem in bioinformatics. The growing number of protein entries in public databases, for example in UniProtKB, poses challenges in manual functional annotation. Manual annotation requires expert human curators to search and read related research articles, interpret the results, and assign the annotations to the proteins. Thus, it is a time-consuming and expensive process. Therefore, designing computational tools to perform automatic annotation leveraging the high quality manual annotations that already exist in UniProtKB/SwissProt is an important research problem

resultsIn this paper, we extend and adapt the GrAPFI (graph-based automatic protein function inference) (Sarker et al. in BMC Bioinform 21, 2020; Sarker et al., in: Proceedings of 7th international conference on complex networks and their applications, Cambridge, 2018) method for automatic annotation of proteins with gene ontology (GO) terms renaming it as GrAPFI-GO. The original GrAPFI method uses label propagation in a similarity graph where proteins are linked through the domains, families, and superfamilies that they share. Here, we also explore various types of similarity measures based on common neighbors in the graph. Moreover, GO terms are arranged in a hierarchical manner according to semantic parent-child relations. Therefore, we propose an efficient pruning and post-processing technique that integrates both semantic similarity and hierarchical relations between the GO terms. We produce experimental results comparing the GrAPFI-GO method with and without considering common neighbors similarity. We also test the performance of GrAPFI-GO and other annotation tools for GO annotation on a benchmark of proteins with and without the proposed pruning and post-processing procedure.

conclusionOur results show that the proposed semantic hierarchical post-processing potentially improves the performance of GrAPFI-GO and of other annotation tools as well. Thus, GrAPFI-GO exposes an original efficient and reusable procedure, to exploit the semantic relations among the GO terms in order to improve the automatic annotation of protein functions.

Indexed as

Computational BiologySemanticsDatabases, ProteinGene OntologyHumansMolecular Sequence AnnotationProteinsProteinsDomain similarity networkGene ontology annotationGrAPFIK-nearest neighborLabel propagationProtein function annotationSemantic similarity

Identifiers

PMID36510133
PMCPMC9743508
OpenAlexW4311587114

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.