![]() |
http://www.cs.ucdavis.edu/~koehl/ |
|
Homology Modeling1. Comparative Protein Structure Modelling1.1 Why Do We Need Comparative Protein Structure Modelling ?It has been hypothesized that the total number of different protein folds is finite, and roughly of the order of 1000. The fact that the protein structure space is finite, and much smaller than the protein sequence space has given rise to the hope that it is possible to have representative structure models for all protein sequences, without going into the expensive procedures of systematic experimental structure determination. Structural genomics is currently focusing on the construction of an extensive library of folds, and a figure of 10,000 to 100,000 representative proteins has been proposed. With such a library, it is expected that models for all proteins can be constructed.
The success of this approach is, however,
strongly correlated to our ability to identify a proper structural template
for a protein of interest, and to build an accurate motel for this protein,
based on the template. Techniques to solve the identification step, or
"fold recognition" problem rely on the assumption that similarities between
the sequences of two proteins imply similarities between the structures
of these proteins. The building step is usually referred to "homology modelling",
or "comparative protein structure modelling". ProModel was designed as
a method for solving this problem, and is described in details below.
1.2 What is Comparative Protein Structure Modelling?Comparative protein structure modeling usually proceeds in 4 steps:
1.3 Useful linksIn collaboration with Michael Levitt from Stanford and Marc Delarue from Institut Pasteur, Paris, I have developed a suite of program, ProModel, for homology modelling. Information on ProModel can be found here . ProModel is one among many programs written for solving
the comparative protein structure moedlling program. We provide links to
other available programs and/or web services. This list is by no means
exhaustive.
|