We consider whether or not protein chains in the HP model have unique or few optimal foldings. We solve the conjecture proposed by Aichholzer et al. that the open chain L2k-1 = (HP)k(PH)k-1 for k ?? 3 has exactly two optimal foldings on the square lattice. We show that some closed and open chains have unique optimal foldings on the hexagonal and triangular lattices, respectively.
|Title of host publication||Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006)|
|Editors||I. Emiris, M. Karavelas, L. Palios|
|Publication status||Published - 2006|