Protein folding: optimized sequences obtained by simulated breeding in a minimalist model

Area of Science:

• Computational Biology
• Biophysics
• Protein Folding

Background:

• Investigating minimalist models is crucial for understanding complex biological processes like protein folding.
• Previous methods for obtaining protein folding sequences in simplified models have shown limitations.
• Random sequences often fail to reach their ground states in simulations.

Purpose of the Study:

• To explore various methods for obtaining protein folding sequences within a recently introduced minimalist model.
• To assess the effectiveness of straightforward sequence construction techniques.
• To develop and detail an optimization algorithm for generating folding sequences.

Main Methods:

• Detailed study of random sequences to evaluate their folding behavior.
• Testing of direct construction techniques based solely on target structures.
• Development and application of a genetic algorithm-based optimization for 'simulated breeding' of folding sequences.

Main Results:

• Random sequences typically do not fold to their ground states in this model.
• Simple, structure-based sequence construction methods are insufficient.
• The genetic algorithm successfully identified folding sequences for target structures.
• A 'patch' of sequences, not a single one, can fold to a specific target structure.
• Nonhomologous sequences were shown to fold to the same target structure, mirroring real proteins.

Conclusions:

• A genetic algorithm-based 'simulated breeding' approach is effective for generating protein folding sequences in minimalist models.
• Sequence space contains multiple solutions for achieving a specific protein fold.
• The study highlights convergent evolution of sequence-structure relationships, similar to natural proteins.