Protein Design is NP-hard

Biologists working in the area of computational protein design have never doubted the seriousness of the algorithmic challenges that face them in attempting in silico sequence selection. It turns out that in the language of the computer science community, this discrete optimization problem is NP-hard. The purpose of this paper is to explain the context of this observation, to provide a simple illustrative proof and to discuss the implications for future progress on algorithms for computational protein design

Monte Carlo Procedure for Protein Design

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.Comment: 7 pages LaTeX, 4 Postscript figures; minor change

De novo design of a homo-trimeric amantadine-binding protein.

The computational design of a symmetric protein homo-oligomer that binds a symmetry-matched small molecule larger than a metal ion has not yet been achieved. We used de novo protein design to create a homo-trimeric protein that binds the C3 symmetric small molecule drug amantadine with each protein monomer making identical interactions with each face of the small molecule. Solution NMR data show that the protein has regular three-fold symmetry and undergoes localized structural changes upon ligand binding. A high-resolution X-ray structure reveals a close overall match to the design model with the exception of water molecules in the amantadine binding site not included in the Rosetta design calculations, and a neutron structure provides experimental validation of the computationally designed hydrogen-bond networks. Exploration of approaches to generate a small molecule inducible homo-trimerization system based on the design highlight challenges that must be overcome to computationally design such systems

Knowledge-based energy functions for computational studies of proteins

This chapter discusses theoretical framework and methods for developing knowledge-based potential functions essential for protein structure prediction, protein-protein interaction, and protein sequence design. We discuss in some details about the Miyazawa-Jernigan contact statistical potential, distance-dependent statistical potentials, as well as geometric statistical potentials. We also describe a geometric model for developing both linear and non-linear potential functions by optimization. Applications of knowledge-based potential functions in protein-decoy discrimination, in protein-protein interactions, and in protein design are then described. Several issues of knowledge-based potential functions are finally discussed.Comment: 57 pages, 6 figures. To be published in a book by Springe

RosettaBackrub--a web server for flexible backbone protein structure modeling and design.

The RosettaBackrub server (http://kortemmelab.ucsf.edu/backrub) implements the Backrub method, derived from observations of alternative conformations in high-resolution protein crystal structures, for flexible backbone protein modeling. Backrub modeling is applied to three related applications using the Rosetta program for structure prediction and design: (I) modeling of structures of point mutations, (II) generating protein conformational ensembles and designing sequences consistent with these conformations and (III) predicting tolerated sequences at protein-protein interfaces. The three protocols have been validated on experimental data. Starting from a user-provided single input protein structure in PDB format, the server generates near-native conformational ensembles. The predicted conformations and sequences can be used for different applications, such as to guide mutagenesis experiments, for ensemble-docking approaches or to generate sequence libraries for protein design

Folding and Design in Coarse-Grained Protein Models

Recent advances in coarse-grained lattice and off-lattice protein models are reviewed. The sequence dependence of thermodynamical folding properties are investigated and evidence for non-randomness of the binary sequences of good folders are discussed. Similar patterns for non-randomness are found for real proteins. Dynamical parameter MC methods, such as the tempering and multisequence algorithms, are essential in order to obtain these results. Also, a new MC method for design, the inverse of folding, is presented. Here, one maximizes conditional probabilities rather than minimizing energies. By construction, this method ensures that the designed sequences represent good folders thermodynamically.Comment: LATTICE 99 (Spin Models), 3 pages, 1 figure, espcrc2.st

A novel iterative strategy for protein design

We propose and discuss a novel strategy for protein design. The method is based on recent theoretical advancements which showed the importance to treat carefully the conformational free energy of designed sequences. In this work we show how computational cost can be kept to a minimum by encompassing negative design features, i.e. isolating a small number of structures that compete significantly with the target one for being occupied at low temperature. The method is succesfully tested on minimalist protein models and using a variety of amino acid interaction potentials.Comment: 9 pages, 8 figure