Few optimal foldings of HP protein chains on various letters

S.H. Poon, S. Thite

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

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 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
Pages63-66
Publication statusPublished - 2006

Fingerprint

Folding
Protein
Hexagonal Lattice
Triangular Lattice
Square Lattice
Closed

Cite this

Poon, S. H., & Thite, S. (2006). Few optimal foldings of HP protein chains on various letters. In I. Emiris, M. Karavelas, & L. Palios (Eds.), Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006) (pp. 63-66)
Poon, S.H. ; Thite, S. / Few optimal foldings of HP protein chains on various letters. Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006). editor / I. Emiris ; M. Karavelas ; L. Palios. 2006. pp. 63-66
@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)",

}

Poon, SH & Thite, S 2006, Few optimal foldings of HP protein chains on various letters. in I Emiris, M Karavelas & L Palios (eds), Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006). pp. 63-66.

Few optimal foldings of HP protein chains on various letters. / Poon, S.H.; Thite, S.

Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006). ed. / I. Emiris; M. Karavelas; L. Palios. 2006. p. 63-66.

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

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 -

Poon SH, Thite S. Few optimal foldings of HP protein chains on various letters. In Emiris I, Karavelas M, Palios L, editors, Abstracts 22nd European Workshop on Computational Geometry (EWCG 2006, Delphi, Greece, March 27-29, 2006). 2006. p. 63-66