A new protein folding algorithm based on hydrophobic compactness: Rigid Unconnected Secondary Structure Iterative Assembly (RUSSIA). II: Applications.

Abstract

The RUSSIA procedure (Rigid Unconnected Secondary Structure Iterative Assembly) produces structural models of cores of small- and medium-sized proteins. Loops are omitted from this treatment and regular secondary structures are reduced to points, the centers of their hydrophobic faces. This methodology relies on the maximum compactness of the hydrophobic residues, as described in detail in Part I. Starting data are the sequence and the predicted limits and natures of regular secondary structures (alpha or beta). Helices are treated as rigid cylinders, whereas beta-strands are collectively taken into account within beta-sheets modeled by helicoid surfaces. Strands are allowed to shift along their mean axis to allow some flexibility and the alpha-helices can be placed on either side of beta-sheets. Numerous initial conformations are produced by discrete rotations of the helices and sheets around the direction going from the center of their hydrophobic face to the global center of the protein. Selection of proposed models is based upon a criterion lying on the minimization of distances separating hydrophobic residues belonging to different regular secondary structures. The procedure is rapid and appears to be robust relative to the quality of starting data (nature and length of regular secondary structures). This dependence of the quality of the model on secondary structure prediction and in particular the beta-sheet topology, is one of the limits of the present algorithm. We present here some results for a set of 12 proteins (alpha, beta and alpha/beta classes) of lengths 40-166 amino acids. The r.m.s. deviations for core models with respect to the native proteins are in the range 1.4-3.7 A.