DeeReCT-PolyA: a robust and generic deep learning method for PAS identification

Author:

Xia Zhihao1,Li Yu2ORCID,Zhang Bin3,Li Zhongxiao2,Hu Yuhui3,Chen Wei3,Gao Xin2

Affiliation:

1. Department of Computer Science and Engineering (CSE), Washington University in St Louis, St Louis, MO, USA

2. Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division, King Abdullah University of Science and Technology (KAUST), Computational Bioscience Research Center (CBRC), Thuwal, Saudi Arabia

3. Department of Biology, Southern University of Science and Technology (SUSTC), Shenzhen, China

Abstract

Abstract Motivation Polyadenylation is a critical step for gene expression regulation during the maturation of mRNA. An accurate and robust method for poly(A) signals (PASs) identification is not only desired for the purpose of better transcripts’ end annotation, but can also help us gain a deeper insight of the underlying regulatory mechanism. Although many methods have been proposed for PAS recognition, most of them are PAS motif- and human-specific, which leads to high risks of overfitting, low generalization power, and inability to reveal the connections between the underlying mechanisms of different mammals. Results In this work, we propose a robust, PAS motif agnostic, and highly interpretable and transferrable deep learning model for accurate PAS recognition, which requires no prior knowledge or human-designed features. We show that our single model trained over all human PAS motifs not only outperforms the state-of-the-art methods trained on specific motifs, but can also be generalized well to two mouse datasets. Moreover, we further increase the prediction accuracy by transferring the deep learning model trained on the data of one species to the data of a different species. Several novel underlying poly(A) patterns are revealed through the visualization of important oligomers and positions in our trained models. Finally, we interpret the deep learning models by converting the convolutional filters into sequence logos and quantitatively compare the sequence logos between human and mouse datasets. Availability and implementation https://github.com/likesum/DeeReCT-PolyA Supplementary information Supplementary data are available at Bioinformatics online.

Funder

King Abdullah University of Science and Technology (KAUST) Office of Sponsored Research

OSR

International Cooperation Research

Science and Technology Innovation Commission of Shenzhen Municipal Government

Publisher

Oxford University Press (OUP)

Subject

Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Molecular Biology,Biochemistry,Statistics and Probability

Reference32 articles.

1. Polyar, a new computer program for prediction of poly (a) sites in human sequences;Akhtar;BMC Genomics,2010

2. Predicting the sequence specificities of DNA-and RNA-binding proteins by deep learning;Alipanahi;Nat. Biotechnol,2015

3. Prediction of mrna polyadenylation sites by support vector machine;Cheng;Bioinformatics,2006

4. Transfer learning for text classification;Do;Advances in Neural Information Processing Systems 18,2006

Cited by 36 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Delineating yeast cleavage and polyadenylation signals using deep learning;Genome Research;2024-06-24

2. Big data and deep learning for RNA biology;Experimental & Molecular Medicine;2024-06-14

3. Gene regulation via RNA isoform variations;Beyond the Blueprint - Decoding the Elegance of Gene Expression [Working Title];2024-05-24

4. Unveiling the Potential;Advances in Bioinformatics and Biomedical Engineering;2024-04-05

5. The deep learning applications in IoT-based bio- and medical informatics: a systematic literature review;Neural Computing and Applications;2024-01-13

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3