Protein Function Annotation Research Articles

A homology-guided, genome-based proteome for improved proteomics in the alloploid Nicotiana benthamiana

BackgroundNicotiana benthamiana is an important model organism of the Solanaceae (Nightshade) family. Several draft assemblies of the N. benthamiana genome have been generated, but many of the gene-models in these draft assemblies appear incorrect.ResultsHere we present an improved proteome based on the Niben1.0.1 draft genome assembly guided by gene models from other Nicotiana species. Due to the fragmented nature of the Niben1.0.1 draft genome, many protein-encoding genes are missing or partial. We complement these missing proteins by similarly annotating other draft genome assemblies. This approach overcomes problems caused by mis-annotated exon-intron boundaries and mis-assigned short read transcripts to homeologs in polyploid genomes. With an estimated 98.1% completeness; only 53,411 protein-encoding genes; and improved protein lengths and functional annotations, this new predicted proteome is better in assigning spectra than the preceding proteome annotations. This dataset is more sensitive and accurate in proteomics applications, clarifying the detection by activity-based proteomics of proteins that were previously predicted to be inactive. Phylogenetic analysis of the subtilase family of hydrolases reveal inactivation of likely homeologs, associated with a contraction of the functional genome in this alloploid plant species. Finally, we use this new proteome annotation to characterize the extracellular proteome as compared to a total leaf proteome, which highlights the enrichment of hydrolases in the apoplast.ConclusionsThis proteome annotation provides the community working with Nicotiana benthamiana with an important new resource for functional proteomics.

SwiftOrtho: A fast, memory-efficient, multiple genome orthology classifier.

BackgroundGene homology type classification is required for many types of genome analyses, including comparative genomics, phylogenetics, and protein function annotation. Consequently, a large variety of tools have been developed to perform homology classification across genomes of different species. However, when applied to large genomic data sets, these tools require high memory and CPU usage, typically available only in computational clusters.FindingsHere we present a new graph-based orthology analysis tool, SwiftOrtho, which is optimized for speed and memory usage when applied to large-scale data. SwiftOrtho uses long k-mers to speed up homology search, while using a reduced amino acid alphabet and spaced seeds to compensate for the loss of sensitivity due to long k-mers. In addition, it uses an affinity propagation algorithm to reduce the memory usage when clustering large-scale orthology relationships into orthologous groups. In our tests, SwiftOrtho was the only tool that completed orthology analysis of proteins from 1,760 bacterial genomes on a computer with only 4 GB RAM. Using various standard orthology data sets, we also show that SwiftOrtho has a high accuracy.ConclusionsSwiftOrtho enables the accurate comparative genomic analyses of thousands of genomes using low-memory computers. SwiftOrtho is available at https://github.com/Rinoahu/SwiftOrtho

In Vivo Methods to Study Protein-Protein Interactions as Key Players in Mycobacterium Tuberculosis Virulence.

Studies on protein–protein interactions (PPI) can be helpful for the annotation of unknown protein functions and for the understanding of cellular processes, such as specific virulence mechanisms developed by bacterial pathogens. In that context, several methods have been extensively used in recent years for the characterization of Mycobacterium tuberculosis PPI to further decipher tuberculosis (TB) pathogenesis. This review aims at compiling the most striking results based on in vivo methods (yeast and bacterial two-hybrid systems, protein complementation assays) for the specific study of PPI in mycobacteria. Moreover, newly developed methods, such as in-cell native mass resonance and proximity-dependent biotinylation identification, will have a deep impact on future mycobacterial research, as they are able to perform dynamic (transient interactions) and integrative (multiprotein complexes) analyses.

Cross-Species Protein Function Prediction with Asynchronous-Random Walk

Protein function prediction is a fundamental task in the post-genomic era. Available functional annotations of proteins are incomplete and the annotations of two homologous species are complementary to each other. However, how to effectively leverage mutually complementary annotations of different species to further boost the prediction performance is still not well studied. In this paper, we propose a cross-species protein function prediction approach by performing Asynchronous Random Walk on a heterogeneous network (AsyRW). AsyRW first constructs a heterogeneous network to integrate multiple functional association networks derived from different biological data, established homology-relationships between proteins from different species, known annotations of proteins and Gene Ontology (GO). To account for the intrinsic structures of intra- and inter-species of proteins and that of GO, AsyRW quantifies the individual walk lengths of each network node using the gravity-like theory, and then performs asynchronous-random walk with the individual length to predict associations between proteins and GO terms. Experiments on annotations archived in different years show that individual walk length and asynchronous-random walk can effectively leverage the complementary annotations of different species, AsyRW has a significantly improved performance to other related and competitive methods. The codes of AsyRW are available at: http://mlda.swu.edu.cn/codes.php?name=AsyRW.

Machine learning for discovering missing or wrong protein function annotations

BackgroundA massive amount of proteomic data is generated on a daily basis, nonetheless annotating all sequences is costly and often unfeasible. As a countermeasure, machine learning methods have been used to automatically annotate new protein functions. More specifically, many studies have investigated hierarchical multi-label classification (HMC) methods to predict annotations, using the Functional Catalogue (FunCat) or Gene Ontology (GO) label hierarchies. Most of these studies employed benchmark datasets created more than a decade ago, and thus train their models on outdated information. In this work, we provide an updated version of these datasets. By querying recent versions of FunCat and GO yeast annotations, we provide 24 new datasets in total. We compare four HMC methods, providing baseline results for the new datasets. Furthermore, we also evaluate whether the predictive models are able to discover new or wrong annotations, by training them on the old data and evaluating their results against the most recent information.ResultsThe results demonstrated that the method based on predictive clustering trees, Clus-Ensemble, proposed in 2008, achieved superior results compared to more recent methods on the standard evaluation task. For the discovery of new knowledge, Clus-Ensemble performed better when discovering new annotations in the FunCat taxonomy, whereas hierarchical multi-label classification with genetic algorithm (HMC-GA), a method based on genetic algorithms, was overall superior when detecting annotations that were removed. In the GO datasets, Clus-Ensemble once again had the upper hand when discovering new annotations, HMC-GA performed better for detecting removed annotations. However, in this evaluation, there were less significant differences among the methods.ConclusionsThe experiments have showed that protein function prediction is a very challenging task which should be further investigated. We believe that the baseline results associated with the updated datasets provided in this work should be considered as guidelines for future studies, nonetheless the old versions of the datasets should not be disregarded since other tasks in machine learning could benefit from them.

Characteristics of Changes in Inflammatory Cytokines as a Function of Hepatic Ischemia-Reperfusion Injury Stage in Mice.

Liver ischemia-reperfusion injury (IRI) can severely compromise the prognosis of patients receiving liver surgery. While inflammation contributes to the damage resulting from IRI, only a limited number of inflammation biomarkers have been identified as being associated with the different stages of hepatic IRI. As an approach to identify some of these inflammatory cytokines and the molecular mechanisms involved within different stages of hepatic IRI, we used an advanced antibody array assay to detect multiple proteins. With this technology, we observed specific differences in the content of inflammatory cytokines between ischemic and sham controls, as well as a function of the different reperfusion stages in a hepatic IRI mouse model. For example, while liver tissue content of IL-12p40/p70 was significantly increased in the ischemic stage, it was significantly decreased in the reperfusion stage as compared with that of the sham group. For other inflammatory cytokines, no changes were obtained between the ischemic and reperfusion stages with levels of IL-17, Eotaxin-2, Eotaxin, and sTNF RII all being consistently increased, while those of TIMP-1, TIMP-2, BLC, and MCSF consistently decreased as compared with that of the sham group at all reperfusion stages examined. Results from protein function annotation Gene Ontology and the KEGG pathway revealed that inflammatory cytokines are enriched in a network associated with activation of inflammatory response signaling pathways such as TLR, TNF, and IL-17 when comparing responses of the IR versus sham groups. The identification of cytokines along with their roles at specific stages of IRI may reveal important new biological markers for the diagnosis and prognosis of hepatic IRI.

Protein function prediction based on zero-one matrix factorization

Accurately annotating the functions of proteins is one of the key tasks of functional genomics. A large portion of functional annotations of proteins is missing, and the functional label space is expansive. Moreover, label compression methods have been proposed and applied to predict protein function; however, such methods lack the interpretability of compressed labels and suffer from the inherent problem of thresholding labels in multi-label learning. To solve these problems, this paper proposes a protein function prediction method based on zero-one matrix factorization (ZOMF). ZOMF first factorizes the protein-function association matrix into two low-rank zero-one matrices and explores the inner latent relationship between proteins and labels. Subsequently, it defines two smoothness terms on these two low-rank matrices with respect to protein–protein interactions and the structural relationships between labels to guide the optimization of low-rank matrices. Finally, to predict protein function, it reconstructs the association matrix using the optimized two low-rank matrices. Experimental results on four model species (yeast, Arabidopsis, mouse, and human) show that ZOMF can predict protein functions more accurately than existing algorithms. However, it does not need to threshold the reconstructed matrix, and the compressed zero-one labels have more than one intuitive explanation.

Functional Site Discovery From Incomplete Training Data: A Case Study With Nucleic Acid-Binding Proteins.

Function annotation efforts provide a foundation to our understanding of cellular processes and the functioning of the living cell. This motivates high-throughput computational methods to characterize new protein members of a particular function. Research work has focused on discriminative machine-learning methods, which promise to make efficient, de novo predictions of protein function. Furthermore, available function annotation exists predominantly for individual proteins rather than residues of which only a subset is necessary for the conveyance of a particular function. This limits discriminative approaches to predicting functions for which there is sufficient residue-level annotation, e.g., identification of DNA-binding proteins or where an excellent global representation can be divined. Complete understanding of the various functions of proteins requires discovery and functional annotation at the residue level. Herein, we cast this problem into the setting of multiple-instance learning, which only requires knowledge of the protein’s function yet identifies functionally relevant residues and need not rely on homology. We developed a new multiple-instance leaning algorithm derived from AdaBoost and benchmarked this algorithm against two well-studied protein function prediction tasks: annotating proteins that bind DNA and RNA. This algorithm outperforms certain previous approaches in annotating protein function while identifying functionally relevant residues involved in binding both DNA and RNA, and on one protein-DNA benchmark, it achieves near perfect classification.

Differential Proteomics Based on TMT and PRM Reveal the Resistance Response of Bambusa pervariabilis × Dendrocalamopisis grandis Induced by AP-Toxin.

Bambusa pervariabilis McClure × Dendrocalamopsis grandis (Q.H.Dai & X.l.Tao ex Keng f.) Ohrnb. blight is a widespread and dangerous forest fungus disease, and has been listed as a supplementary object of forest phytosanitary measures. In order to study the control of B. pervariabilis × D. grandis blight, this experiment was carried out. In this work, a toxin purified from the pathogen Arthrinium phaeospermum (Corda) Elli, which causes blight in B. pervariabilis × D. grandis, with homologous heterogeneity, was used as an inducer to increase resistance to B. pervariabilis × D. grandis. A functional analysis of the differentially expressed proteins after induction using a tandem mass tag labeling technique was combined with mass spectrometry and liquid chromatography mass spectrometry in order to effectively screen for the proteins related to the resistance of B. pervariabilis × D. grandis to blight. After peptide labeling, a total of 3320 unique peptides and 1791 quantitative proteins were obtained by liquid chromatography mass spectrometry analysis. Annotation and enrichment analysis of these peptides and proteins using the Gene ontology and Kyoto Encyclopedia of Genes and Genomes databases with bioinformatics software show that the differentially expressed protein functional annotation items are mainly concentrated on biological processes and cell components. Several pathways that are prominent in the Kyoto Encyclopedia of Genes and Genomes annotation and enrichment include metabolic pathways, the citrate cycle, and phenylpropanoid biosynthesis. In the Protein-protein interaction networks four differentially expressed proteins-sucrose synthase, adenosine triphosphate-citrate synthase beta chain protein 1, peroxidase, and phenylalanine ammonia-lyase significantly interact with multiple proteins and significantly enrich metabolic pathways. To verify the results of tandem mass tag, the candidate proteins were further verified by parallel reaction monitoring, and the results were consistent with the tandem mass tag data analysis results. It is confirmed that the data obtained by tandem mass tag technology are reliable. Therefore, the differentially expressed proteins and signaling pathways discovered here is the primary concern for subsequent disease resistance studies.

Protein functional annotation of simultaneously improved stability, accuracy and false discovery rate achieved by a sequence-based deep learning.

Functional annotation of protein sequence with high accuracy has become one of the most important issues in modern biomedical studies, and computational approaches of significantly accelerated analysis process and enhanced accuracy are greatly desired. Although a variety of methods have been developed to elevate protein annotation accuracy, their ability in controlling false annotation rates remains either limited or not systematically evaluated. In this study, a protein encoding strategy, together with a deep learning algorithm, was proposed to control the false discovery rate in protein function annotation, and its performances were systematically compared with that of the traditional similarity-based and de novo approaches. Based on a comprehensive assessment from multiple perspectives, the proposed strategy and algorithm were found to perform better in both prediction stability and annotation accuracy compared with other de novo methods. Moreover, an in-depth assessment revealed that it possessed an improved capacity of controlling the false discovery rate compared with traditional methods. All in all, this study not only provided a comprehensive analysis on the performances of the newly proposed strategy but also provided a tool for the researcher in the fields of protein function annotation.

Protein function prediction from dynamic protein interaction network using gene expression data.

Computational prediction of functional annotation of proteins is an uphill task. There is an ever increasing gap between functional characterization of protein sequences and deluge of protein sequences generated by large-scale sequencing projects. The dynamic nature of protein interactions is frequently observed which is mostly influenced by any new change of state or change in stimuli. Functional characterization of proteins can be inferred from their interactions with each other, which is dynamic in nature. In this work, we have used a dynamic protein-protein interaction network (PPIN), time course gene expression data and protein sequence information for prediction of functional annotation of proteins. During progression of a particular function, it has also been observed that not all the proteins are active at all time points. For unannotated active proteins, our proposed methodology explores the dynamic PPIN consisting of level-1 and level-2 neighboring proteins at different time points, filtered by Damerau-Levenshtein edit distance to estimate the similarity between two protein sequences and coefficient variation methods to assess the strength of an edge in a network. Finally, from the filtered dynamic PPIN, at each time point, functional annotations of the level-2 proteins are assigned to the unknown and unannotated active proteins through the level-1 neighbor, following a bottom-up strategy. Our proposed methodology achieves an average precision, recall and F-Score of 0.59, 0.76 and 0.61 respectively, which is significantly higher than the reported state-of-the-art methods.

Comprehensive map and functional annotation of the mouse white adipose tissue proteome.

White adipose tissue (WAT) plays a significant role in energy metabolism and the obesity epidemic. In this study, we sought to (1) profile the mouse WAT proteome with advanced 2DLC/MS/MS approach, (2) provide insight into WAT function based on protein functional annotation, and (3) predict potentially secreted proteins. A label-free 2DLC/MS/MS proteomic approach was used to identify the WAT proteome from female mouse WAT. A total of 6,039 proteins in WAT were identified, among which 5,160 were quantified (spanning a magnitude of 106) using an intensity-based absolute quantification algorithm, and 3,117 proteins were reported by proteomics technology for the first time in WAT. To comprehensively analyze the function of WAT, the proteins were divided into three quantiles based on abundance and we found that proteins of different abundance performed different functions. High-abundance proteins (the top 90%, 1,219 proteins) were involved in energy metabolism; middle-abundance proteins (90–99%, 2,273 proteins) were involved in the regulation of protein synthesis; and low-abundance proteins (99–100%, 1,668 proteins) were associated with lipid metabolism and WAT beiging. Furthermore, 800 proteins were predicted by SignalP4.0 to have signal peptides, 265 proteins had never been reported, and five have been reported as adipokines. The above results provide a large dataset of the normal mouse WAT proteome, which might be useful for WAT function research.

SCRIBER: accurate and partner type-specific prediction of protein-binding residues from proteins sequences

MotivationAccurate predictions of protein-binding residues (PBRs) enhances understanding of molecular-level rules governing protein–protein interactions, helps protein–protein docking and facilitates annotation of protein functions. Recent studies show that current sequence-based predictors of PBRs severely cross-predict residues that interact with other types of protein partners (e.g. RNA and DNA) as PBRs. Moreover, these methods are relatively slow, prohibiting genome-scale use.ResultsWe propose a novel, accurate and fast sequence-based predictor of PBRs that minimizes the cross-predictions. Our SCRIBER (SeleCtive pRoteIn-Binding rEsidue pRedictor) method takes advantage of three innovations: comprehensive dataset that covers multiple types of binding residues, novel types of inputs that are relevant to the prediction of PBRs, and an architecture that is tailored to reduce the cross-predictions. The dataset includes complete protein chains and offers improved coverage of binding annotations that are transferred from multiple protein–protein complexes. We utilize innovative two-layer architecture where the first layer generates a prediction of protein-binding, RNA-binding, DNA-binding and small ligand-binding residues. The second layer re-predicts PBRs by reducing overlap between PBRs and the other types of binding residues produced in the first layer. Empirical tests on an independent test dataset reveal that SCRIBER significantly outperforms current predictors and that all three innovations contribute to its high predictive performance. SCRIBER reduces cross-predictions by between 41% and 69% and our conservative estimates show that it is at least 3 times faster. We provide putative PBRs produced by SCRIBER for the entire human proteome and use these results to hypothesize that about 14% of currently known human protein domains bind proteins.Availability and implementationSCRIBER webserver is available at http://biomine.cs.vcu.edu/servers/SCRIBER/.Supplementary information Supplementary data are available at Bioinformatics online.

Disjoint motif discovery in biological network using pattern join method.

The biological network plays a key role in protein function annotation, protein superfamily classification, disease diagnosis, etc. These networks exhibit global properties like small‐world property, power‐law degree distribution, hierarchical modularity, robustness, etc. Along with these, the biological network also possesses some local properties like clustering and network motif. Network motifs are recurrent and statistically over‐represented subgraphs in a target network. Operation of a biological network is controlled by these motifs, and they are responsible for many biological applications. Discovery of network motifs is a computationally hard problem and involves a subgraph isomorphism check which is NP‐complete. In recent years, researchers have developed various tools and algorithms to detect network motifs efficiently. However, it is still a challenging task to discover the network motif within a practical time bound for the large motif. In this study, an efficient pattern‐join based algorithm is proposed to discover network motif in biological networks. The performance of the proposed algorithm is evaluated on the transcription regulatory network of Escherichia coli and the protein interaction network of Saccharomyces cerevisiae. The running time of the proposed algorithm outperforms most of the existing algorithms to discover large motifs.

The Recent Progresses in Chemical Synthesis of Proteins with Site-Specific Lysine Post-translational Modifications

In the past two decades, a plethora of lysine (Lys) posttranslational modifications (PTMs) has been discovered on proteins, major groups are acylation, alkylation, and ubiquitination. Although considered biologically important, functional annotation of proteins with Lys PTMs has largely fallen behind the discovery. One grand challenge of characterizing proteins with PTMs is the procurement of homogenously modified proteins. To resolve this obstacle, sophisticated methods have been developed. These include total synthesis, semisynthesis that is based on native chemical ligation, expressed protein ligation, and enzyme-catalyzed peptide ligation, and the amber-suppression based noncanonical amino acid mutagenesis technique that may need to couple with follow-up bioorthogonal chemistry. This review summarizes currently identified significant PTMs and chemical biology methods for their installation in proteins. We hope that the current review will provide helpful insights and critical perspectives to this important research frontier.

DeepFunc: A Deep Learning Framework for Accurate Prediction of Protein Functions from Protein Sequences and Interactions.

Annotation of protein functions plays an important role in understanding life at the molecular level. High-throughput sequencing produces massive numbers of raw proteins sequences and only about 1% of them have been manually annotated with functions. Experimental annotations of functions are expensive, time-consuming and do not keep up with the rapid growth of the sequence numbers. This motivates the development of computational approaches that predict protein functions. A novel deep learning framework, DeepFunc, is proposed which accurately predicts protein functions from protein sequence- and network-derived information. More precisely, DeepFunc uses a long and sparse binary vector to encode information concerning domains, families, and motifs collected from the InterPro tool that is associated with the input protein sequence. This vector is processed with two neural layers to obtain a low-dimensional vector which is combined with topological information extracted from protein-protein interactions (PPIs) and functional linkages. The combined information is processed by a deep neural network that predicts protein functions. DeepFunc is empirically and comparatively tested on a benchmark testing dataset and the Critical Assessment of protein Function Annotation algorithms (CAFA) 3 dataset. The experimental results demonstrate that DeepFunc outperforms current methods on the testing dataset and that it secures the highest Fmax =0.54 and AUC=0.94 on the CAFA3 dataset.

Application of dynamic expansion tree for finding large network motifs in biological networks.

Network motifs play an important role in the structural analysis of biological networks. Identification of such network motifs leads to many important applications such as understanding the modularity and the large-scale structure of biological networks, classification of networks into super-families, and protein function annotation. However, identification of large network motifs is a challenging task as it involves the graph isomorphism problem. Although this problem has been studied extensively in the literature using different computational approaches, still there is a lot of scope for improvement. Motivated by the challenges involved in this field, an efficient and scalable network motif finding algorithm using a dynamic expansion tree is proposed. The novelty of the proposed algorithm is that it avoids computationally expensive graph isomorphism tests and overcomes the space limitation of the static expansion tree (SET) which makes it enable to find large motifs. In this algorithm, the embeddings corresponding to a child node of the expansion tree are obtained from the embeddings of a parent node, either by adding a vertex or by adding an edge. This process does not involve any graph isomorphism check. The time complexity of vertex addition and edge addition are O(n) and O(1), respectively. The growth of a dynamic expansion tree (DET) depends on the availability of patterns in the target network. Pruning of branches in the DET significantly reduces the space requirement of the SET. The proposed algorithm has been tested on a protein–protein interaction network obtained from the MINT database. The proposed algorithm is able to identify large network motifs faster than most of the existing motif finding algorithms.

Analyzing the symmetrical arrangement of structural repeats in proteins with CE-Symm.

Many proteins fold into highly regular and repetitive three dimensional structures. The analysis of structural patterns and repeated elements is fundamental to understand protein function and evolution. We present recent improvements to the CE-Symm tool for systematically detecting and analyzing the internal symmetry and structural repeats in proteins. In addition to the accurate detection of internal symmetry, the tool is now capable of i) reporting the type of symmetry, ii) identifying the smallest repeating unit, iii) describing the arrangement of repeats with transformation operations and symmetry axes, and iv) comparing the similarity of all the internal repeats at the residue level. CE-Symm 2.0 helps the user investigate proteins with a robust and intuitive sequence-to-structure analysis, with many applications in protein classification, functional annotation and evolutionary studies. We describe the algorithmic extensions of the method and demonstrate its applications to the study of interesting cases of protein evolution.

Prediction of Protein Metal Binding Sites Using Deep Neural Networks.

Metals have crucial roles for many physiological, pathological and diagnostic processes. Metal binding proteins or metalloproteins are important for metabolism functions. The proteins that reach the three-dimensional structure by folding show which vital function is fulfilled. The prediction of metal-binding in proteins will be considered as a step-in function assignment for new proteins, which helps to obtain functional proteins in genomic studies, is critical to protein function annotation and drug discovery. Computational predictions made by using machine learning methods from the data obtained from amino acid sequences are widely used in the protein metal-binding and various bioinformatics fields. In this work, we present three different deep learning architectures for prediction of metal-binding of Histidines (HIS) and Cysteines (CYS) amino acids. These architectures are as follows: 2D Convolutional Neural Network, Long-Short Term Memory and Recurrent Neural Network. Their comparison is carried out on the three different sets of attributes derived from a public dataset of protein sequences. These three sets of features extracted from the protein sequence were obtained using the PAM scoring matrix, protein composition server, and binary representation methods. The results show that a better performance for prediction of protein metal- binding sites is obtained through Convolutional Neural Network architecture.

An enhanced workflow for variant interpretation in UniProtKB/Swiss-Prot improves consistency and reuse in ClinVar.

Personalized genomic medicine depends on integrated analyses that combine genetic and phenotypic data from individual patients with reference knowledge of the functional and clinical significance of sequence variants. Sources of this reference knowledge include the ClinVar repository of human genetic variants, a community resource that accepts submissions from external groups, and UniProtKB/Swiss-Prot, an expert-curated resource of protein sequences and functional annotation. UniProtKB/Swiss-Prot provides knowledge on the functional impact and clinical significance of over 30 000 human protein-coding sequence variants, curated from peer-reviewed literature reports. Here we present a pilot study that lays the groundwork for the integration of curated knowledge of protein sequence variation from UniProtKB/Swiss-Prot with ClinVar. We show that existing interpretations of variant pathogenicity in UniProtKB/Swiss-Prot and ClinVar are highly concordant, with 88% of variants that are common to the two resources having interpretations of clinical significance that agree. Re-curation of a subset of UniProtKB/Swiss-Prot variants according to American College of Medical Genetics and Genomics (ACMG) guidelines using ClinGen tools further increases this level of agreement, mainly due to the reclassification of supposedly pathogenic variants as benign, based on newly available population frequency data. We have now incorporated ACMG guidelines and ClinGen tools into the UniProt Knowledgebase (UniProtKB) curation workflow and routinely submit variant data from UniProtKB/Swiss-Prot to ClinVar. These efforts will increase the usability and utilization of UniProtKB variant data and will facilitate the continuing (re-)evaluation of clinical variant interpretations as data sets and knowledge evolve.