A template-finding algorithm and a comprehensive benchmark for homology modeling of proteins.
The first step in homology modeling is to identify a template protein for the target sequence. The template structure is used in later phases of the calculation to construct an atomically detailed model for the target. We have built from the Protein Data Bank (PDB) a large-scale learning set that includes tens of millions of pair matches that can be either a true template or a false one. Discriminatory learning (learning from positive and negative examples) is used to train a decision tree. Each branch of the tree is a mathematical programming model. The decision tree is tested on an independent set from PDB entries and on the sequences of CASP7. It provides significant enrichment of true templates (between 50 and 100%) when compared to PSI-BLAST. The model is further verified by building atomically detailed structures for each of the tentative true templates with modeller. The probability that a true match does not yield an acceptable structural model (within 6 A RMSD from the native structure) decays linearly as a function of the TM structural-alignment score.
Vallat
Brinda Kizhakke
BK
Department of Computer Science, Cornell University, Upson Hall 4130, Ithaca, New York 14853, USA.
Pillardy
Jaroslaw
J
Elber
Ron
R
D000465:Algorithms; D000595:Amino Acid Sequence; D000818:Animals; D030562:Databases, Protein; D006801:Humans; D008958:Models, Molecular; D008969:Molecular Sequence Data; D009113:Muramidase / Q000737:chemistry; D017433:Protein Structure, Secondary; D040681:Structural Homology, Protein
D009113:Muramidase