Skip to main content

Table 4 Comparing four algorithms in eleven sequences with 27 amino acids

From: Hybrid method to solve HP model on 3D lattice and to probe protein stability upon amino acid mutations

Sequence ID EN hELP TPPSO1 TPPSO2
A 1 -9 -9(18009) -9(1983) -9(177)
A 2 -10 -10(9447) -10(1304) -10(439)
A 3 -8 -8(1420) -8(1249) -8(44)
A 4 -15 -15(2125) -15(795) -15(19)
A 5 -8 -8(2877) -8(104) -8(61)
A 6 -11 -12(2610) -11(940) -12(812)
A 7 -13 -13(3967) -12(721) -13(805)
A 8 -4 -4(1070) -4(6) -4(3)
A 9 -7 -7(363) -7(389) -7(14)
A 10 -11 -11(416) -11(2784) -11(83)
A 11 -14 -16(285) -14(957) -16(2672)
  1. The number in parentheses is the iteration number before the lowest free energy values are found. TPPSO2 can find the optimal results of all sequences. TPPSO1 can’t obtain the minimal free energies for sequence A 6, A 7, and A 11 (highlighted in bold)