Related Experiment Video
Updated: Jul 12, 2026

Assessment of Immunologically Relevant Dynamic Tertiary Structural Features of the HIV-1 V3 Loop Crown R2 Sequence by ab initio Folding
Published on: September 16, 2010
Protein structure and energy landscape dependence on sequence using a continuous energy function
K A Dill1, A T Phillips, J B Rosen
1Department of Pharmaceutical Chemistry, University of California at San Francisco, 94118, USA. dill@maxwell.ucsf.edu
A new convex global underestimator (CGU) method offers a faster approach to protein folding simulations. This computational method avoids kinetic traps, showing promise for analyzing small protein structures efficiently.
Area of Science:
- Computational biology
- Biophysics
- Protein folding
Background:
- Protein folding is crucial for biological function.
- Traditional methods like Monte Carlo and molecular dynamics are hindered by kinetic traps.
- These traps increase computation time based on protein sequence rather than length.
Purpose of the Study:
- To test a new conformational search strategy, the convex global underestimator (CGU) method.
- To evaluate the CGU method's efficiency and scalability for protein folding.
- To assess the CGU method's potential for practical application in simulating small proteins.
Main Methods:
- Utilized a simplified protein chain representation.
- Employed a differentiable form of the Sun/Thomas/Dill energy function.
- Applied the convex global underestimator (CGU) search strategy, exploring the energy landscape from below.
Main Results:
- The CGU method's computation time is largely independent of the monomer sequence.
- Computational time scales as O(n4) with protein chain length (n).
- The method successfully found global minima for tested protein chain folds.
Conclusions:
- The CGU method overcomes limitations of standard search techniques by avoiding kinetic traps.
- The CGU method demonstrates efficient and scalable performance for protein folding simulations.
- The CGU method is potentially practical for determining stable states in small proteins within reasonable computation times.
Related Concept Videos
Protein and Protein Structure
A protein's shape is critical to its function. For example, an enzyme can...
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally analyses the...
Energy Diagrams - I
Take the example of a skater on a parabolic ramp. The potential energy at different points along the ramp will be proportional to the height of the ramp, which varies quadratically with the horizontal position on the ramp. As the skater moves down the ramp from the highest position,...
Energy Diagrams - II
The point in the energy diagram at which the system’s potential energy is the lowest is known as the local minima. The system tends to stay in this position indefinitely unless acted upon by a net force. The slope of the potential energy diagram at the local minima is zero, indicating that zero net force is acting on the system. The slope...

