Fluctuation of the solvent-accessible surface area of tuna ferrocytochrome c

Thermal unfolding simulations of bacterial flagellin: insight into its refolding before assembly

Flagellin is the subunit of the bacterial filament, the micrometer-long propeller of a bacterial flagellum. The protein is believed to undergo unfolding for transport through the channel of the filament and to refold in a chamber at the end of the channel before being assembled into the growing filament. We report a thermal unfolding simulation study of S. typhimurium flagellin in aqueous solution as an attempt to gain atomic-level insight into the refolding process. Each molecule comprises two filament-core domains {D0, D1} and two hypervariable-region domains {D2, D3}. D2 can be separated into subdomains D2a and D2b. We observed a similar unfolding order of the domains as reported in experimental thermal denaturation. D2a and D3 exhibited high thermal stability and contained persistent three-stranded beta-sheets in the denatured state which could serve as folding cores to guide refolding. A recent mutagenesis study on flagellin stability seems to suggest the importance of the folding cores. Using crude size estimates, our data suggests that the chamber might be large enough for either denatured hypervariable-region domains or filament-core domains, but not whole flagellin; this implicates a two-staged refolding process.

Reduced surface: an efficient way to compute molecular surfaces

Because of their wide use in molecular modeling, methods to compute molecular surfaces have received a lot of interest in recent years. However, most of the proposed algorithms compute the analytical representation of only the solvent-accessible surface. There are a few programs that compute the analytical representation of the solvent-excluded surface, but they often have problems handling singular cases of self-intersecting surfaces and tend to fail on large molecules (more than 10,000 atoms). We describe here a program called MSMS, which is shown to be fast and reliable in computing molecular surfaces. It relies on the use of the reduced surface that is briefly defined here and from which the solvent-accessible and solvent-excluded surfaces are computed. The four algorithms composing MSMS are described and their complexity is analyzed. Special attention is given to the handling of self-intersecting parts of the solvent-excluded surface called singularities. The program has been compared with Connolly's program PQMS [M.L. Connolly (1993) Journal of Molecular Graphics, Vol. 11, pp. 139-141] on a set of 709 molecules taken from the Brookhaven Data Base. MSMS was able to compute topologically correct surfaces for each molecule in the set. Moreover, the actual time spent to compute surfaces is in agreement with the theoretical complexity of the program, which is shown to be O[n log(n)] for n atoms. On a Hewlett-Packard 9000/735 workstation, MSMS takes 0.73 s to produce a triangulated solvent-excluded surface for crambin (1 crn, 46 residues, 327 atoms, 4772 triangles), 4.6 s for thermolysin (3tln, 316 residues, 2437 atoms, 26462 triangles), and 104.53 s for glutamine synthetase (2gls, 5676 residues, 43632 atoms, 476665 triangles).