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 条
  • [21] How Difficult Is It to Fold a Knotted Protein? In Silico Insights from Surface-Tethered Folding Experiments
    Soler, Miguel A.
    Faisca, Patricia F. N.
    PLOS ONE, 2012, 7 (12):
  • [22] An analysis of protein language model embeddings for fold prediction
    Villegas-Morcillo, Amelia
    Gomez, Angel M.
    Sanchez, Victoria
    BRIEFINGS IN BIOINFORMATICS, 2022, 23 (03)
  • [23] Protein Fold Prediction Problem Using Ensemble of Classifiers
    Dehzangi, Abdollah
    Amnuaisuk, Somnuk Phon
    Ng, Keng Hoong
    Mohandesi, Ehsan
    NEURAL INFORMATION PROCESSING, PT 2, PROCEEDINGS, 2009, 5864 : 503 - 511
  • [24] Support vector machines for protein fold class prediction
    Markowetz, F
    Edler, L
    Vingron, M
    BIOMETRICAL JOURNAL, 2003, 45 (03) : 377 - 389
  • [25] Prediction of the protein folding core: Application to the immunoglobulin fold
    Prudhomme, Nicolas
    Chomilier, Jacques
    BIOCHIMIE, 2009, 91 (11-12) : 1465 - 1474
  • [26] High-Performance Computing for Protein Fold Prediction
    Chuang, Li-Yeh
    Lin, Yu-Da
    Yang, Cheng-Hong
    2017 IEEE SMARTWORLD, UBIQUITOUS INTELLIGENCE & COMPUTING, ADVANCED & TRUSTED COMPUTED, SCALABLE COMPUTING & COMMUNICATIONS, CLOUD & BIG DATA COMPUTING, INTERNET OF PEOPLE AND SMART CITY INNOVATION (SMARTWORLD/SCALCOM/UIC/ATC/CBDCOM/IOP/SCI), 2017,
  • [27] Protein fold recognition by prediction-based threading
    Rost, B
    Schneider, R
    Sander, C
    JOURNAL OF MOLECULAR BIOLOGY, 1997, 270 (03) : 471 - 480
  • [28] The interface of protein-protein complexes: Analysis of contacts and prediction of interactions
    Bahadur, R. P.
    Zacharias, M.
    CELLULAR AND MOLECULAR LIFE SCIENCES, 2008, 65 (7-8) : 1059 - 1072
  • [29] PREDICTION OF A BASIS SET OF OPTIMAL-SOLUTIONS OF LINEAR PREDICTION PROBLEMS
    GAMZE, MS
    YEFIMOV, AN
    SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 1986, 24 (05): : 76 - 80
  • [30] The prediction of protein contacts from multiple sequence alignments
    Thomas, DJ
    Casari, G
    Sander, C
    PROTEIN ENGINEERING, 1996, 9 (11): : 941 - 948