Few optimal foldings of HP protein chains on various letters

S.H. Poon, S. Thite

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic


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.
Original languageEnglish
Title of host publicationAbstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006)
EditorsI. Emiris, M. Karavelas, L. Palios
Publication statusPublished - 2006


Dive into the research topics of 'Few optimal foldings of HP protein chains on various letters'. Together they form a unique fingerprint.

Cite this