Using constraint programming for lattice protein folding

We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of proteins, that has become a major tool for investigating general properties of protein folding. The search techniqueuses constraint programmingfor e ciently pruning the search tree. We state the problem of structure prediction in the HP-lattice model and describe our implementationusing the Oz-system7 .

• Type: Conference
• Year: 1997
• Where: GCB
• Authors: Rolf Backofen
• Keywords: Biometrics, GCB 1997, Global Minimal Conformation, Global Search Technique, HP-lattice Model