FUpred: detecting protein domains through deep-learning-based contact map prediction

被引:43
作者
Zheng, Wei [1 ]
Zhou, Xiaogen [1 ]
Wuyun, Qiqige [2 ]
Pearce, Robin [1 ]
Li, Yang [1 ,3 ]
Zhang, Yang [1 ,4 ]
机构
[1] Univ Michigan, Dept Computat Med & Bioinformat, Ann Arbor, MI 48109 USA
[2] Michigan State Univ, Comp Sci & Engn Dept, E Lansing, MI 48824 USA
[3] Nanjing Univ Sci & Technol, Sch Comp Sci & Engn, Nanjing 210094, Peoples R China
[4] Univ Michigan, Dept Biol Chem, Ann Arbor, MI 48109 USA
基金
美国国家科学基金会;
关键词
STRUCTURAL CLASSIFICATION;
D O I
10.1093/bioinformatics/btaa217
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Motivation: Protein domains are subunits that can fold and function independently. Correct domain boundary assignment is thus a critical step toward accurate protein structure and function analyses. There is, however, no efficient algorithm available for accurate domain prediction from sequence. The problem is particularly challenging for proteins with discontinuous domains, which consist of domain segments that are separated along the sequence. Results: We developed a new algorithm, FUpred, which predicts protein domain boundaries utilizing contact maps created by deep residual neural networks coupled with coevolutionary precision matrices. The core idea of the algorithm is to retrieve domain boundary locations by maximizing the number of intra-domain contacts, while minimizing the number of inter-domain contacts from the contact maps. FUpred was tested on a large-scale dataset consisting of 2549 proteins and generated correct single- and multi-domain classifications with a Matthew's correlation coefficient of 0.799, which was 19.1% (or 5.3%) higher than the best machine learning (or threading)-based method. For proteins with discontinuous domains, the domain boundary detection and normalized domain overlapping scores of FUpred were 0.788 and 0.521, respectively, which were 17.3% and 23.8% higher than the best control method. The results demonstrate a new avenue to accurately detect domain composition from sequence alone, especially for discontinuous, multi-domain proteins.
引用
收藏
页码:3749 / 3757
页数:9
相关论文
共 28 条
[1]   PDP: protein domain parser [J].
Alexandrov, N ;
Shindyalov, I .
BIOINFORMATICS, 2003, 19 (03) :429-430
[2]   SCOPe: classification of large macromolecular structures in the structural classification of proteinsextended database [J].
Chandonia, John-Marc ;
Fox, Naomi K. ;
Brenner, Steven E. .
NUCLEIC ACIDS RESEARCH, 2019, 47 (D1) :D475-D481
[3]   SCOPe: Manual Curation and Artifact Removal in the Structural Classification of Proteins - extended Database [J].
Chandonia, John-Marc ;
Fox, Naomi K. ;
Brenner, Steven E. .
JOURNAL OF MOLECULAR BIOLOGY, 2017, 429 (03) :348-355
[4]   DOMAC: an accurate, hybrid protein domain prediction server [J].
Cheng, Jianlin .
NUCLEIC ACIDS RESEARCH, 2007, 35 :W354-W356
[5]   DOMpro: Protein domain prediction using profiles, secondary structure, relative solvent accessibility, and recursive neural networks [J].
Cheng, Jianlin ;
Sweredoski, Michael J. ;
Baldi, Pierre .
DATA MINING AND KNOWLEDGE DISCOVERY, 2006, 13 (01) :1-10
[6]   DoBo: Protein domain boundary prediction by integrating evolutionary signals and machine learning [J].
Eickholt, Jesse ;
Deng, Xin ;
Cheng, Jianlin .
BMC BIOINFORMATICS, 2011, 12
[7]   SCOPe: Structural Classification of Proteins-extended, integrating SCOP and ASTRAL data and classification of new structures [J].
Fox, Naomi K. ;
Brenner, Steven E. ;
Chandonia, John-Marc .
NUCLEIC ACIDS RESEARCH, 2014, 42 (D1) :D304-D309
[8]   SnapDRAGON: a method to delineate protein structural domains from sequence data [J].
George, RA ;
Heringa, J .
JOURNAL OF MOLECULAR BIOLOGY, 2002, 316 (03) :839-851
[9]   Improving the performance of DomainParser for structural domain partition using neural network [J].
Guo, JT ;
Xu, D ;
Kim, D ;
Xu, Y .
NUCLEIC ACIDS RESEARCH, 2003, 31 (03) :944-952
[10]   ConDo: protein domain boundary prediction using coevolutionary information [J].
Hong, Seung Hwan ;
Joo, Keehyoung ;
Lee, Jooyoung .
BIOINFORMATICS, 2019, 35 (14) :2411-2417