Department of Informatics, Bioinformatics and Computational Biology, i12, TUM (Technical University of Munich), Boltzmannstr. 3, Garching, 85748, Munich, Germany.
TUM Graduate School, Center of Doctoral Studies in Informatics and its Applications (CeDoSIA), Boltzmannstr. 11, 85748, Garching, Germany.
Sci Rep. 2021 Jan 13;11(1):1160. doi: 10.1038/s41598-020-80786-0.
Knowing protein function is crucial to advance molecular and medical biology, yet experimental function annotations through the Gene Ontology (GO) exist for fewer than 0.5% of all known proteins. Computational methods bridge this sequence-annotation gap typically through homology-based annotation transfer by identifying sequence-similar proteins with known function or through prediction methods using evolutionary information. Here, we propose predicting GO terms through annotation transfer based on proximity of proteins in the SeqVec embedding rather than in sequence space. These embeddings originate from deep learned language models (LMs) for protein sequences (SeqVec) transferring the knowledge gained from predicting the next amino acid in 33 million protein sequences. Replicating the conditions of CAFA3, our method reaches an F of 37 ± 2%, 50 ± 3%, and 57 ± 2% for BPO, MFO, and CCO, respectively. Numerically, this appears close to the top ten CAFA3 methods. When restricting the annotation transfer to proteins with < 20% pairwise sequence identity to the query, performance drops (F BPO 33 ± 2%, MFO 43 ± 3%, CCO 53 ± 2%); this still outperforms naïve sequence-based transfer. Preliminary results from CAFA4 appear to confirm these findings. Overall, this new concept is likely to change the annotation of proteins, in particular for proteins from smaller families or proteins with intrinsically disordered regions.
了解蛋白质的功能对于推进分子和医学生物学至关重要,但通过基因本体论(GO)进行的实验功能注释不到所有已知蛋白质的 0.5%。计算方法通常通过同源性注释转移来填补这一序列-注释差距,方法是识别具有已知功能的序列相似蛋白,或使用进化信息的预测方法。在这里,我们提出通过基于蛋白质在 SeqVec 嵌入中的接近度而不是在序列空间中的注释转移来预测 GO 术语。这些嵌入源自用于蛋白质序列的深度学习语言模型(LMs)(SeqVec),它通过预测 3300 万条蛋白质序列中的下一个氨基酸来转移知识。在复制 CAFA3 条件的情况下,我们的方法分别达到了 BPO、MFO 和 CCO 的 F 值为 37±2%、50±3%和 57±2%。从数值上看,这似乎接近 CAFA3 方法的前十名。当将注释转移限制为与查询的蛋白质具有<20%的成对序列同一性时,性能会下降(BPO 的 F 值为 33±2%,MFO 的 F 值为 43±3%,CCO 的 F 值为 53±2%);这仍然优于基于序列的简单转移。来自 CAFA4 的初步结果似乎证实了这些发现。总体而言,这个新概念很可能改变蛋白质的注释,特别是对于来自较小家族的蛋白质或具有内在无序区域的蛋白质。