Figure 16
From: On the protein folding problem in 2D-triangular lattices

Optimal folding for hexagon with depth 3 for. This figure illustrates the optimal filling of of Section ‘Steps of the algorithm’ for hexagon having depth 3.
From: On the protein folding problem in 2D-triangular lattices
Optimal folding for hexagon with depth 3 for. This figure illustrates the optimal filling of of Section ‘Steps of the algorithm’ for hexagon having depth 3.