A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)
From MaRDI portal
Publication:876713
DOI10.1016/S1570-8667(03)00076-5zbMath1114.92025MaRDI QIDQ876713
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Dynamic programming (90C39) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)
Related Items (2)
A constraint-based approach to fast and exact structure prediction in three-dimensional protein models ⋮ Stochastic protein folding simulation in the three-dimensional HP-model
Cites Work
This page was built for publication: A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)
