Protein fold recognition by prediction-based threading

被引:200
作者
Rost, B [1 ]
Schneider, R [1 ]
Sander, C [1 ]
机构
[1] EBI, CAMBRIDGE CB10 1RQ, ENGLAND
关键词
protein structure prediction; threading; remote homology detection; fold recognition; secondary structure;
D O I
10.1006/jmbi.1997.1101
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
In fold recognition by threading one takes the amino acid sequence of a protein and evaluates how well it fits into one of the known three-dimensional (3D) protein structures. The quality of sequence-structure fit is typically evaluated using inter-residue potentials of mean force or other statistical parameters. Here, we present an alternative approach to evaluating sequence-structure fitness. Starting from the amino acid sequence we first predict secondary structure and solvent accessibility for each residue. We then thread the resulting one-dimensional (1D) profile of predicted structure assignments into each of the known 3D structures. The optimal threading for each sequence-structure pair is obtained using dynamic programming. The overall best sequence-structure pair constitutes the predicted 3D structure for the input sequence. The method is fine-tuned by adding information from direct sequence-sequence comparison and applying a series of empirical filters. Although the method relies on reduction of 3D information into 1D structure profiles, its accuracy is, surprisingly, not clearly inferior to methods based on evaluation of residue interactions in 3D. We therefore hypothesise that existing 1D-3D threading methods essentially do not capture more than the fitness of an amino acid sequence for a particular 1D succession of secondary structure segments and residue solvent accessibility. The prediction-based threading method on average finds any structurally homologous region at first rank in 29% of the cases (including sequence information). For the 22% first hits detected at highest scores, the expected accuracy rose to 75%. However, the task of detecting entire folds rather than homologous fragments was managed much better; 45 to 75% of the first hits correctly recognised the fold. (C) 1997 Academic Press Limited.
引用
收藏
页码:471 / 480
页数:10
相关论文
共 50 条
  • [21] Effective inter-residue contact definitions for accurate protein fold recognition
    Chao Yuan
    Hao Chen
    Daisuke Kihara
    BMC Bioinformatics, 13
  • [22] Improving taxonomy-based protein fold recognition by using global and local features
    Yang, Jian-Yi
    Chen, Xin
    PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 2011, 79 (07) : 2053 - 2064
  • [23] Competitive assessment of protein fold recognition and alignment accuracy
    Levitt, M
    PROTEINS-STRUCTURE FUNCTION AND BIOINFORMATICS, 1997, : 92 - 104
  • [24] Directionality in protein fold prediction
    Jonathan J Ellis
    Fabien PE Huard
    Charlotte M Deane
    Sheenal Srivastava
    Graham R Wood
    BMC Bioinformatics, 11
  • [25] Protein fold recognition by mapping predicted secondary structures
    Russell, RB
    Copley, RR
    Barton, GJ
    JOURNAL OF MOLECULAR BIOLOGY, 1996, 259 (03) : 349 - 365
  • [26] Triage protein fold prediction
    He, HX
    McAllister, G
    Smith, TF
    PROTEINS-STRUCTURE FUNCTION AND GENETICS, 2002, 48 (04): : 654 - 663
  • [27] Protein structure prediction by threading. Why it works and why it does not
    Mirny, LA
    Shakhnovich, EI
    JOURNAL OF MOLECULAR BIOLOGY, 1998, 283 (02) : 507 - 526
  • [28] A new taxonomy-based protein fold recognition approach based on autocross-covariance transformation
    Dong, Qiwen
    Zhou, Shuigeng
    Guan, Jihong
    BIOINFORMATICS, 2009, 25 (20) : 2655 - 2662
  • [29] 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
  • [30] Protein threading by recursive dynamic programming
    Thiele, R
    Zimmer, R
    Lengauer, T
    JOURNAL OF MOLECULAR BIOLOGY, 1999, 290 (03) : 757 - 779