BACKGROUND: One of the most evident achievements of bioinformatics is the development of methods that transfer biological knowledge from characterised proteins to uncharacterised sequences. This mode of protein function assignment is mostly based on the detection of sequence similarity and the premise that functional properties are conserved during evolution. Most automatic approaches developed to date rely on the identification of clusters of homologous proteins and the mapping of new proteins onto these clusters, which are expected to share functional characteristics. RESULTS: Here, we inverse the logic of this process, by considering the mapping of sequences directly to a functional classification instead of mapping functions to a sequence clustering. In this mode, the starting point is a database of labelled proteins according to a functional classification scheme, and the subsequent use of sequence similarity allows defining the membership of new proteins to these functional classes. In this framework, we define the Correspondence Indicators as measures of relationship between sequence and function and further formulate two Bayesian approaches to estimate the probability for a sequence of unknown function to belong to a functional class. This approach allows the parametrisation of different sequence search strategies and provides a direct measure of annotation error rates. We validate this approach with a database of enzymes labelled by their corresponding four-digit EC numbers and analyse specific cases. CONCLUSION: The performance of this method is significantly higher than the simple strategy consisting in transferring the annotation from the highest scoring BLAST match and is expected to find applications in automated functional annotation pipelines.
英文摘要:
BACKGROUND: One of the most evident achievements of bioinformatics is the development of methods that transfer biological knowledge from characterised proteins to uncharacterised sequences. This mode of protein function assignment is mostly based on the detection of sequence similarity and the premise that functional properties are conserved during evolution. Most automatic approaches developed to date rely on the identification of clusters of homologous proteins and the mapping of new proteins onto these clusters, which are expected to share functional characteristics. RESULTS: Here, we inverse the logic of this process, by considering the mapping of sequences directly to a functional classification instead of mapping functions to a sequence clustering. In this mode, the starting point is a database of labelled proteins according to a functional classification scheme, and the subsequent use of sequence similarity allows defining the membership of new proteins to these functional classes. In this framework, we define the Correspondence Indicators as measures of relationship between sequence and function and further formulate two Bayesian approaches to estimate the probability for a sequence of unknown function to belong to a functional class. This approach allows the parametrisation of different sequence search strategies and provides a direct measure of annotation error rates. We validate this approach with a database of enzymes labelled by their corresponding four-digit EC numbers and analyse specific cases. CONCLUSION: The performance of this method is significantly higher than the simple strategy consisting in transferring the annotation from the highest scoring BLAST match and is expected to find applications in automated functional annotation pipelines.
From Scarce Functional Labels to Label-Aware Generation in Homologous Protein Families
École Normale Supérieure, CNRS, Laboratoire de Physique - LPENS(巴黎高等师范学院,法国国家科学研究中心,物理实验室);Sorbonne Université, CNRS, Dept. of Computational, Quantitative and Synthetic Biology - CQSB(索邦大学,法国国家科学研究中心,计算、定量与合成生物学系);Institut Universitaire de France (IUF)(法兰西学院);Dipartimento di Fisica, Sapienza Università di Roma(罗马智慧大学物理系)
Predicting mutational effects on protein-protein binding via a side-chain diffusion probabilistic model
Institute of Computing Technology, Chinese Academy of Sciences(中国科学院计算技术研究所);University of Chinese Academy of Sciences(中国科学院大学);Central China Research Institute for Artificial Intelligence Technologies(中原人工智能产业技术研究院)
DeepProteomics: Protein family classification using Shallow and Deep Networks
Center for Computational Engineering and Networking (CEN)(计算工程与网络中心(CEN));Amrita School of Engineering(阿姆里塔工程学院);Amrita Vishwa Vidyapeetham(阿姆里塔维什瓦维迪亚佩瑟姆大学)
ProTranslator: zero-shot protein function prediction using textual description
Accurately finding proteins and genes that have a certain function is the prerequisite for a broad range of biomedical applications. Despite the encouraging progress of existing computational approaches in protein function prediction, it remains challenging to annotate proteins to a novel function that is not collected in the Gene Ontology and does not have any annotated proteins. This limitation, a side effect from the widely-used multi-label classification problem setting of protein function prediction, hampers the progress of studying new pathways and biological processes, and further slows…
Subcellular proteome niche discovery using semi-supervised functional clustering
University of California, Santa Cruz(加利福尼亚大学圣克鲁兹分校);Marine Chemistry and Geochemistry Department, Woods Hole Oceanographic Institution(伍兹霍尔海洋研究所);Department of Biology, Mount Allison University(蒙茅斯阿尔金大学)
Department of Electronics and Computer Engineering(电子与计算机工程系);Shenzhen MSU-BIT University(深圳MSU-BIT大学);School of Computer Science and Technology(计算机科学与技术学院)
Deep Recurrent Neural Network for Protein Function Prediction from Sequence
Wyss Institute for Biologically Inspired Engineering(威斯生物启发工程研究所);School of Engineering and Applied Sciences, Harvard University(哈佛大学工程与应用科学学院);Department of Systems Biology, Harvard Medical School(哈佛医学院系统生物学系)