Protein Engineering vol. 16 no. 6 pp. 407-414, 2003
© 2003 Oxford University Press
Original Paper |
Have we seen all structures corresponding to short protein fragments in the Protein Data Bank? An update
Department of Chemistry and Chemical Biology and BioMaPS Institute, Rutgers, the State University of New Jersey, 610 Taylor Road, Piscataway, NJ 08854-8087, USA
1 To whom correspondence should be addressed. e-mail: ronlevy{at}lutece.rutgers.edu
Abstract
Assembling short fragments from known structures has been a widely used approach to construct novel protein structures. To what extent there exist structurally similar fragments in the database of known structures for short fragments of a novel protein is a question that is fundamental to this approach. This work addresses that question for seven-, nine- and 15-residue fragments. For each fragment size, two databases, a query database and a template database of fragments from high-quality protein structures in SCOP20 and SCOP90, respectively, were constructed. For each fragment in the query database, the template database was scanned to find the lowest r.m.s.d. fragment among non-homologous structures. For seven-residue fragments, there is a 99% probability that there exists such a fragment within 0.7 Å r.m.s.d. for each loop fragment. For nine-residue fragments there is a 96% probability of a fragment within 1 Å r.m.s.d., while for 15-residue fragments there is a 91% probability of a fragment within 2 Å r.m.s.d.. These results, which update previous studies, show that there exists sufficient coverage to model even a novel fold using fragments from the Protein Data Bank, as the current database of known structures has increased enormously in the last few years. We have also explored the use of a grid search method for loop homology modeling and make some observations about the use of a grid search compared with a database search for the loop modeling problem.
Received October 23, 2002; revised March 3, 2003; accepted March 30, 2003.
CiteULike 
Connotea 
Del.icio.us What's this?
This article has been cited by other articles:
|
|
 |
|
  J. Moult Rigorous performance evaluation in protein structure modelling and implications for computational biology Phil Trans R Soc B, March 29, 2006; 361(1467): 453 - 458. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 N. Fernandez-Fuentes, B. Oliva, and A. Fiser A supersecondary structure library and search algorithm for modeling loops in protein structures. Nucleic Acids Res., January 1, 2006; 34(7): 2085 - 2097. [Abstract] [Full Text] [PDF]
|
|
|
|
 |
|
 R. Kolodny, L. Guibas, M. Levitt, and P. Koehl Inverse Kinematics in Biology: The Protein Loop Closure Problem The International Journal of Robotics Research, February 1, 2005; 24(2-3): 151 - 163. [Abstract] [PDF]
|
|