DEEPGONET:基于级联卷积和递归网络的蛋白质序列GO注释多标签预测

S. M. S. Islam, M. Hasan
{"title":"DEEPGONET:基于级联卷积和递归网络的蛋白质序列GO注释多标签预测","authors":"S. M. S. Islam, M. Hasan","doi":"10.1109/ICCITECHN.2018.8631921","DOIUrl":null,"url":null,"abstract":"The present gap between the amount of available protein sequence due to the development of next generation sequencing technology (NGS) and slow and expensive experimental extraction of useful information, like annotation of protein sequence in different functional aspects, is ever widening. The gap can be reduced by employing automatic function prediction (AFP) approaches. Gene Ontology (GO), comprising of more than 40, 000 classes, defines three aspects of protein function named Biological Process (BP), Cellular Component (CC), and Molecular Function (MF). The availability of multiple functions of a single protein has rendered the automatic function prediction a large-scale, multi-class, and a multi-label task. In this paper, we present DEEPGONET, a novel cascaded convolutional and recurrent neural network, to predict the top-level hierarchy of GO ontology. The network takes the primary sequence of protein as input, making it more useful than other prevailing state-of-the-art deep learning based methods with multi-modal input, which are less applicable for proteins where only primary sequence is available. All the predictions of different protein functions of our network are performed by the same architecture, a proof of better generalization as demonstrated by promising performance on a variety of organisms while trained on Homo sapiens only. The task has been made possible by efficient exploration of vast output space by leveraging hierarchical relationship among GO classes. The promising performance of our model makes it a potential avenue for directing experimental protein functions exploration efficiently by vastly eliminating possible routes which is done by the exploring only the suggested routes from our model. Our proposed model is also very simple and efficient in terms of computational time and space compared to other architectures in literature.","PeriodicalId":355984,"journal":{"name":"2018 21st International Conference of Computer and Information Technology (ICCIT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"DEEPGONET: Multi-Label Prediction of GO Annotation for Protein from Sequence Using Cascaded Convolutional and Recurrent Network\",\"authors\":\"S. M. S. Islam, M. Hasan\",\"doi\":\"10.1109/ICCITECHN.2018.8631921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The present gap between the amount of available protein sequence due to the development of next generation sequencing technology (NGS) and slow and expensive experimental extraction of useful information, like annotation of protein sequence in different functional aspects, is ever widening. The gap can be reduced by employing automatic function prediction (AFP) approaches. Gene Ontology (GO), comprising of more than 40, 000 classes, defines three aspects of protein function named Biological Process (BP), Cellular Component (CC), and Molecular Function (MF). The availability of multiple functions of a single protein has rendered the automatic function prediction a large-scale, multi-class, and a multi-label task. In this paper, we present DEEPGONET, a novel cascaded convolutional and recurrent neural network, to predict the top-level hierarchy of GO ontology. The network takes the primary sequence of protein as input, making it more useful than other prevailing state-of-the-art deep learning based methods with multi-modal input, which are less applicable for proteins where only primary sequence is available. All the predictions of different protein functions of our network are performed by the same architecture, a proof of better generalization as demonstrated by promising performance on a variety of organisms while trained on Homo sapiens only. The task has been made possible by efficient exploration of vast output space by leveraging hierarchical relationship among GO classes. The promising performance of our model makes it a potential avenue for directing experimental protein functions exploration efficiently by vastly eliminating possible routes which is done by the exploring only the suggested routes from our model. Our proposed model is also very simple and efficient in terms of computational time and space compared to other architectures in literature.\",\"PeriodicalId\":355984,\"journal\":{\"name\":\"2018 21st International Conference of Computer and Information Technology (ICCIT)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 21st International Conference of Computer and Information Technology (ICCIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCITECHN.2018.8631921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 21st International Conference of Computer and Information Technology (ICCIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCITECHN.2018.8631921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

由于下一代测序技术(NGS)的发展,目前可用的蛋白质序列数量与从不同功能方面对蛋白质序列进行注释等有用信息的实验提取缓慢且昂贵之间的差距越来越大。采用自动功能预测(AFP)方法可以减小这种差距。基因本体(GO)包含4万多个类,定义了蛋白质功能的三个方面,分别是生物过程(BP)、细胞成分(CC)和分子功能(MF)。单个蛋白质多种功能的可用性使得功能自动预测成为一项大规模、多类别和多标签的任务。在本文中,我们提出了一种新的级联卷积递归神经网络DEEPGONET来预测围棋本体的顶层层次。该网络以蛋白质的一级序列作为输入,使其比其他流行的基于多模态输入的最先进的基于深度学习的方法更有用,这些方法不太适用于只有一级序列可用的蛋白质。我们的网络对不同蛋白质功能的所有预测都是由相同的架构执行的,这证明了更好的泛化,因为在各种生物体上有希望的表现,而只在智人身上进行训练。通过利用GO类之间的层次关系,有效地探索巨大的输出空间,使该任务成为可能。该模型的良好性能使其成为有效指导实验蛋白质功能探索的潜在途径,因为它可以大量消除可能的路径,而这些路径仅由我们模型中的建议路径进行探索。与文献中的其他架构相比,我们提出的模型在计算时间和空间方面也非常简单和高效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
DEEPGONET: Multi-Label Prediction of GO Annotation for Protein from Sequence Using Cascaded Convolutional and Recurrent Network
The present gap between the amount of available protein sequence due to the development of next generation sequencing technology (NGS) and slow and expensive experimental extraction of useful information, like annotation of protein sequence in different functional aspects, is ever widening. The gap can be reduced by employing automatic function prediction (AFP) approaches. Gene Ontology (GO), comprising of more than 40, 000 classes, defines three aspects of protein function named Biological Process (BP), Cellular Component (CC), and Molecular Function (MF). The availability of multiple functions of a single protein has rendered the automatic function prediction a large-scale, multi-class, and a multi-label task. In this paper, we present DEEPGONET, a novel cascaded convolutional and recurrent neural network, to predict the top-level hierarchy of GO ontology. The network takes the primary sequence of protein as input, making it more useful than other prevailing state-of-the-art deep learning based methods with multi-modal input, which are less applicable for proteins where only primary sequence is available. All the predictions of different protein functions of our network are performed by the same architecture, a proof of better generalization as demonstrated by promising performance on a variety of organisms while trained on Homo sapiens only. The task has been made possible by efficient exploration of vast output space by leveraging hierarchical relationship among GO classes. The promising performance of our model makes it a potential avenue for directing experimental protein functions exploration efficiently by vastly eliminating possible routes which is done by the exploring only the suggested routes from our model. Our proposed model is also very simple and efficient in terms of computational time and space compared to other architectures in literature.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信