ACGA a Novel Biomimetic Hybrid Optimisation Algorithm Based on a HP Protein Visualizer: An Interpretable Web-Based Tool for 3D Protein Folding Based on the Hydrophobic-Polar Model

. 2025 Nov 12;10(11):763. doi: 10.3390/biomimetics10110763

Algorithm 3 All Conformations Genetic Algorithm (ACGA)

1:
Input: $p o p u l a t i o n_s i z e, g e n e r a t i o n s, H P s e q, l a t t i c e_t y p e$
2:
Output: $C * (R U L D s t r i n g)$
3:
Initialization of the population $P_{i} (i = 1, 2 \dots n)$
4:
Compute fitness of each conformation conf Equation (5)
5:
Adapted tournament selection
6:
$C * \leftarrow$ the best conformation
7:
$t \leftarrow 0$
8:
while $(t < g e n e r a t i o n s)$ do
9:
for (every chosen conformation) do
10:
$C_{t + 1} ⟵ C r o s s o v e r (C_{t}, D_{t}, C *)$
11:
$C_{t + 1} ⟵ M u t a t i o n (C_{t}, C *)$
12:
end for
13:
Compute the fitness of modified chromosome
14:
$A d a p t e d_t o u r n a m e n t_s e l e c t i o n$
15:
$C * ⟵$ the best conformation
16:
$t ⟵ t + 1$
17:
end while
18:
return C*