Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Analyzing energy landscapes for folding model proteins.

Graham A Cox1, Roy L Johnston

  • 1School of Chemistry, University of Birmingham, Edgbaston, Birmingham B15 2TT, United Kingdom.

The Journal of Chemical Physics
|June 16, 2006
PubMed
Summary

A genetic algorithm (GA) was used to study protein folding. The study found that the GA’s search for global minimum energy structures is influenced by the energy landscape’s topography and the algorithm’s operators.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Effects of Hydration on the Conformational Behavior of Flexible Molecules with Two Charge Centers.

The journal of physical chemistry. A·2020
Same author

Leveraging Hierarchical Self-Assembly Pathways for Realizing Colloidal Photonic Crystals.

ACS nano·2020
Same author

Altering CO binding on gold cluster cations by Pd-doping.

Nanoscale·2019
Same author

Gold doping of tin clusters: exo- vs. endohedral complexes.

Nanoscale·2019
Same author

In situ high-potential-driven surface restructuring of ternary AgPd-Pt<sub>dilute</sub> aerogels with record-high performance improvement for formate oxidation electrocatalysis.

Nanoscale·2019
Same author

GIGA: a versatile genetic algorithm for free and supported clusters and nanoparticles in the presence of ligands.

Nanoscale·2019

Area of Science:

  • Computational biology
  • Protein folding
  • Biophysics

Background:

  • The hydrophobic-polar (HP) model is a simplified lattice model for protein folding.
  • Investigating the energy landscape of protein folding is crucial for understanding protein structure and function.
  • Genetic algorithms (GAs) are powerful tools for exploring complex search spaces.

Purpose of the Study:

  • To analyze the global minimum (GM) energy structures of a 20-bead HP model protein sequence on a square lattice.
  • To determine the relative probabilities of finding specific GM conformations using a GA.
  • To understand how GA operators and energy landscape features influence the search for protein folding ground states.

Main Methods:

  • A 20-bead HP model protein sequence on a square lattice was studied.
  • A genetic algorithm (GA) was employed to search for global minimum (GM) energy structures.
  • Relative probabilities of GM conformations were calculated and compared to theoretical constructor probabilities.
  • Structural and metric relationships (e.g., Hamming distances) between GMs were analyzed.
  • Searches were conducted using both forward and reverse sequences to compare solution finding.

Main Results:

  • The GA identified 17 distinct but degenerate GM energy structures.
  • The probability distribution of GMs found by the GA differed significantly from the theoretical constructor probability, especially in longer runs.
  • The topography of the energy landscape, connectivity, and distances between GMs were found to critically influence the probabilities of finding specific degenerate GMs.
  • The ease of finding mirror-image solutions was compared between forward and reverse sequence searches.

Conclusions:

  • The search strategy and operators within a GA significantly impact the exploration of the protein folding energy landscape.
  • The relative probabilities of finding specific degenerate global minima are highly dependent on the landscape's features and the search algorithm's characteristics.
  • This approach provides insights into rationalizing the difficulty of finding global minima for various HP sequences.

Related Experiment Videos