A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)

DOI10.1016/S1570-8667(03)00076-5zbMATH Open1114.92025MaRDI QIDQ876713FDOQ876713

Authors Rolf Backofen 

Publication date 26 April 2007

Published in Journal of Discrete Algorithms (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundprotein foldinglattice proteinsHP-modelface-centered-cubic-lattice (FCC)

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Biochemistry, molecular biology (92C40) Dynamic programming (90C39) Computational methods for problems pertaining to biology (92-08)

Recommendations

• scientific article; zbMATH DE number 1615287
• scientific article; zbMATH DE number 1786464
• Approximate protein folding in the HP side chain model on extended cubic lattices
• A constraint-based approach to fast and exact structure prediction in three-dimensional protein models
• Mathematical Foundations of Computer Science 2004

Cites work

• scientific article; zbMATH DE number 1775449 (Why is no real title available?)
• scientific article; zbMATH DE number 6472614 (Why is no real title available?)
• The antipode construction for sphere packings

Cited in

(5)

• scientific article; zbMATH DE number 1615287 (Why is no real title available?)
• scientific article; zbMATH DE number 2084726 (Why is no real title available?)
• scientific article; zbMATH DE number 1786464 (Why is no real title available?)
• 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

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)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876713)