Figure 16From: On the protein folding problem in 2D-triangular latticesOptimal folding for hexagon with depth 3 for S ̂ 1 . This figure illustrates the optimal filling of S ̂ 1 of Section ‘Steps of the algorithm’ for hexagon having depth 3.Back to article page