pith. sign in

arxiv: cond-mat/9711092 · v3 · submitted 1997-11-11 · ❄️ cond-mat.soft · cond-mat.dis-nn· hep-lat· physics.chem-ph· q-bio.BM

Monte Carlo Procedure for Protein Design

classification ❄️ cond-mat.soft cond-mat.dis-nnhep-latphysics.chem-phq-bio.BM
keywords carlomethodmonteprocedureproteinsequenceveryalgorithm
0
0 comments X
read the original abstract

A new method for sequence optimization in protein models is presented. The approach, which has inherited its basic philosophy from recent work by Deutsch and Kurosky [Phys. Rev. Lett. 76, 323 (1996)] by maximizing conditional probabilities rather than minimizing energy functions, is based upon a novel and very efficient multisequence Monte Carlo scheme. By construction, the method ensures that the designed sequences represent good folders thermodynamically. A bootstrap procedure for the sequence space search is devised making very large chains feasible. The algorithm is successfully explored on the two-dimensional HP model with chain lengths N=16, 18 and 32.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.