Fast tree search for enumeration of a lattice model of protein folding

Henry Cejtin, Jan Edler, Allan Gottlieb, Robert Helling, Hao Li, James Philbin, Neo Wingreen, Chao Tang

Research output: Contribution to journalArticlepeer-review

28 Scopus citations

Abstract

A fast tree-search algorithm was used to find the ground states of all sequences for a 4X3X3 lattice HP model of proteins. The results confirm the existence of highly designable structures in a three-dimensional solvation model with a surface-to-core ratio of 2- to-1, close to the values for small natural proteins. Highly designable structures were found to differ geometrically from other structures.

Original languageEnglish (US)
Pages (from-to)352-359
Number of pages8
JournalJournal of Chemical Physics
Volume116
Issue number1
DOIs
StatePublished - Jan 1 2002

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)
  • Physical and Theoretical Chemistry

Fingerprint Dive into the research topics of 'Fast tree search for enumeration of a lattice model of protein folding'. Together they form a unique fingerprint.

Cite this