Prediction of the optimal set of contacts to fold the smallest knotted protein

被引:22
|
作者
Dabrowski-Tumanski, P. [1 ,2 ]
Jarmolinska, A. I. [1 ,3 ]
Sulkowska, J. I. [1 ,2 ]
机构
[1] Univ Warsaw, Ctr New Technol, PL-02097 Warsaw, Poland
[2] Univ Warsaw, Fac Chem, PL-02093 Warsaw, Poland
[3] Univ Warsaw, Fac Math Informat & Mech, PL-02097 Warsaw, Poland
关键词
free energy landscape; slipknot; contact map; backtracking; STRUCTURE-BASED MODELS; ENERGY LANDSCAPE; NATIVE CONTACTS; PACKING DENSITY; MINIMAL MODELS; DYNAMICS; POTENTIALS; SIMULATION; COORDINATE; SPACE;
D O I
10.1088/0953-8984/27/35/354109
中图分类号
O469 [凝聚态物理学];
学科分类号
070205 ;
摘要
Knotted protein chains represent a new motif in protein folds. They have been linked to various diseases, and recent extensive analysis of the Protein Data Bank shows that they constitute 1.5% of all deposited protein structures. Despite thorough theoretical and experimental investigations, the role of knots in proteins still remains elusive. Nonetheless, it is believed that knots play an important role in mechanical and thermal stability of proteins. Here, we perform a comprehensive analysis of native, shadow-specific and non-native interactions which describe free energy landscape of the smallest knotted protein (PDB id 2efv). We show that the addition of shadow-specific contacts in the loop region greatly enhances folding kinetics, while the addition of shadow-specific contacts along the C-terminal region (H3 or H4) results in a new folding route with slower kinetics. By means of direct coupling analysis (DCA) we predict non-native contacts which also can accelerate kinetics. Next, we show that the length of the C-terminal knot tail is responsible for the shape of the free energy barrier, while the influence of the elongation of the N-terminus is not significant. Finally, we develop a concept of a minimal contact map sufficient for 2efv protein to fold and analyze properties of this protein using this map.
引用
收藏
页数:13
相关论文
共 50 条
  • [31] The interface of protein-protein complexes: Analysis of contacts and prediction of interactions
    R. P. Bahadur
    M. Zacharias
    Cellular and Molecular Life Sciences, 2008, 65 : 1059 - 1072
  • [32] Probabilistic Prediction of Contacts in Protein-Ligand Complexes
    Hakulinen, Riku
    Puranen, Santeri
    Lehtonen, Jukka V.
    Johnson, Mark S.
    Corander, Jukka
    PLOS ONE, 2012, 7 (11):
  • [34] Improving protein fold recognition by extracting fold-specific features from predicted residue-residue contacts
    Zhu, Jianwei
    Zhang, Haicang
    Li, Shuai Cheng
    Wang, Chao
    Kong, Lupeng
    Sun, Shiwei
    Zheng, Wei-Mou
    Bu, Dongbo
    BIOINFORMATICS, 2017, 33 (23) : 3749 - 3757
  • [35] Optimal Pathological Prediction of Vocal Fold Leukoplakia Based on IPCLs and Morphology
    Fang, Yi
    Li, Changjiang
    Chen, Min
    Chen, Jian
    Cheng, Lei
    Wu, Haitao
    LARYNGOSCOPE, 2024,
  • [36] Kernel based approach for protein fold prediction from sequence
    Langlois, RE
    Diec, A
    Dai, Y
    Lu, H
    PROCEEDINGS OF THE 26TH ANNUAL INTERNATIONAL CONFERENCE OF THE IEEE ENGINEERING IN MEDICINE AND BIOLOGY SOCIETY, VOLS 1-7, 2004, 26 : 2885 - 2888
  • [37] Fold and Sequence Independent Protein Binding Sites Prediction Algorithm
    Janezic, Dusanka
    Konc, Janez
    Konc, Joanna Trykowska
    Penca, Matej
    Janezic, Matej
    INTERNATIONAL CONFERENCE OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING 2009 (ICCMSE 2009), 2012, 1504 : 729 - 732
  • [38] Role and results of statistical methods in protein fold class prediction
    Edler, L
    Grassmann, J
    Suhai, S
    MATHEMATICAL AND COMPUTER MODELLING, 2001, 33 (12-13) : 1401 - 1417
  • [39] Applying experimental data to protein fold prediction with the genetic algorithm
    Dandekar, T
    Argos, P
    PROTEIN ENGINEERING, 1997, 10 (08): : 877 - 893
  • [40] Protein fold prediction in the context of fine-grained classifications
    Dubchak, I
    WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL 4, PROCEEDINGS, 1998, : 262 - 262