Few optimal foldings of HP protein chains on various letters

S.H. Poon; S. Thite

Few optimal foldings of HP protein chains on various letters

S.H. Poon, S. Thite

Algorithms

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

Abstract

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 language	English
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
Pages	63-66
Publication status	Published - 2006

Cite this

@inproceedings{dcc61f929bec47b68cdbc1bf6eb361c2,

title = "Few optimal foldings of HP protein chains on various letters",

abstract = "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.",

author = "S.H. Poon and S. Thite",

year = "2006",

language = "English",

pages = "63--66",

editor = "I. Emiris and M. Karavelas and L. Palios",

booktitle = "Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006)",

}

TY - GEN

T1 - Few optimal foldings of HP protein chains on various letters

AU - Poon, S.H.

AU - Thite, S.

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 63

EP - 66

BT - Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006)

A2 - Emiris, I.

A2 - Karavelas, M.

A2 - Palios, L.

ER -

Few optimal foldings of HP protein chains on various letters

Abstract

Fingerprint

Cite this