Monte Carlo Procedure for Protein Design
arXiv:cond-mat/9711092 · doi:10.1103/PhysRevE.58.R5249
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.
arXiv comment7 pages LaTeX, 4 Postscript figures; minor changes
References in corpus (5)
Cited by in corpus (5)
- Exact Sequence Analysis for Three-Dimensional HP Lattice Proteins
- Lattice protein design using Bayesian learning
- Design of amino acid sequences to fold into C_alpha-model proteins
- The cavity method to protein design problem
- Design of Sequences with Good Folding Properties in Coarse-Grained Protein Models