ArchPRED: a template based loop structure prediction server

被引:110
作者
Fernandez-Fuentes, Narcis
Zhai, Jun
Fiser, Andras
机构
[1] Yeshiva Univ Albert Einstein Coll Med, Dept Biochem, Bronx, NY 10461 USA
[2] Yeshiva Univ Albert Einstein Coll Med, Seaver Fdn Ctr Bioinformat, Bronx, NY 10461 USA
关键词
D O I
10.1093/nar/gkl113
中图分类号
Q5 [生物化学]; Q7 [分子生物学];
学科分类号
071010 ; 081704 ;
摘要
ArchPRED server (http://www.fiserlab.org/servers/archpred) implements a novel fragment-search based method for predicting loop conformations. The inputs to the server are the atomic coordinates of the query protein and the position of the loop. The algorithm selects candidate loop fragments from a regularly updated loop library ( Search Space) by matching the length, the types of bracing secondary structures of the query and by satisfying the geometrical restraints imposed by the stem residues. Subsequently, candidate loops are inserted in the query protein framework where their side chains are rebuilt and their fit is assessed by the root mean square deviation (r.m.s.d.) of stem regions and by the number of rigid body clashes with the environment. In the final step remaining candidate loops are ranked by a Z-score that combines information on sequence similarity and fit of predicted and observed [phi/psi] main chain dihedral angle propensities. The final loop conformation is built in the protein structure and annealed in the environment using conjugate gradient minimization. The prediction method was benchmarked on artificially prepared search datasets where all trivial sequence similarities on the SCOP superfamily level were removed. Under these conditions it was possible to predict loops of length 4, 8 and 12 with coverage of 98, 78 and 28% with at least of 0.22, 1.38 and 2.47 of r.m.s.d. accuracy, respectively. In a head to head comparison on loops extracted from freshly deposited new protein folds the current method outperformed in a similar to 5:1 ratio an earlier developed database search method.
引用
收藏
页码:W173 / W176
页数:4
相关论文
共 12 条
[1]   The Protein Data Bank [J].
Berman, HM ;
Battistuz, T ;
Bhat, TN ;
Bluhm, WF ;
Bourne, PE ;
Burkhardt, K ;
Iype, L ;
Jain, S ;
Fagan, P ;
Marvin, J ;
Padilla, D ;
Ravichandran, V ;
Schneider, B ;
Thanki, N ;
Weissig, H ;
Westbrook, JD ;
Zardecki, C .
ACTA CRYSTALLOGRAPHICA SECTION D-STRUCTURAL BIOLOGY, 2002, 58 :899-907
[2]   A graph-theory algorithm for rapid protein side-chain prediction [J].
Canutescu, AA ;
Shelenkov, AA ;
Dunbrack, RL .
PROTEIN SCIENCE, 2003, 12 (09) :2001-2014
[3]   CODA: A combined algorithm for predicting the structurally variable regions of protein models [J].
Deane, CM ;
Blundell, TL .
PROTEIN SCIENCE, 2001, 10 (03) :599-612
[4]   Protein structure modeling in the proteomics era [J].
Fiser, A .
EXPERT REVIEW OF PROTEOMICS, 2004, 1 (01) :97-110
[5]   PROTEIN-STRUCTURE COMPARISON BY ALIGNMENT OF DISTANCE MATRICES [J].
HOLM, L ;
SANDER, C .
JOURNAL OF MOLECULAR BIOLOGY, 1993, 233 (01) :123-138
[6]   DICTIONARY OF PROTEIN SECONDARY STRUCTURE - PATTERN-RECOGNITION OF HYDROGEN-BONDED AND GEOMETRICAL FEATURES [J].
KABSCH, W ;
SANDER, C .
BIOPOLYMERS, 1983, 22 (12) :2577-2637
[7]   SEQUENCE ALIGNMENT APPROACH TO PICK UP CONFORMATIONALLY SIMILAR PROTEIN-FRAGMENTS [J].
KOLASKAR, AS ;
KULKARNIKALE, U .
JOURNAL OF MOLECULAR BIOLOGY, 1992, 223 (04) :1053-1061
[8]   An automated classification of the structure of protein loops [J].
Oliva, B ;
Bates, PA ;
Querol, E ;
Aviles, FX ;
Sternberg, MJE .
JOURNAL OF MOLECULAR BIOLOGY, 1997, 266 (04) :814-830
[9]   MODBASE, a database of annotated comparative protein structure models, and associated resources [J].
Pieper, U ;
Eswar, N ;
Braberg, H ;
Madhusudhan, MS ;
Davis, FP ;
Stuart, AC ;
Mirkovic, N ;
Rossi, A ;
Marti-Renom, MA ;
Fiser, A ;
Webb, B ;
Greenblatt, D ;
Huang, CC ;
Ferrin, TE ;
Sali, A .
NUCLEIC ACIDS RESEARCH, 2004, 32 :D217-D222
[10]   COMPARATIVE PROTEIN MODELING BY SATISFACTION OF SPATIAL RESTRAINTS [J].
SALI, A .
MOLECULAR MEDICINE TODAY, 1995, 1 (06) :270-277