Enhanced conformational sampling in Monte Carlo simulations of proteins: application to a constrained peptide.

A Monte Carlo simulation method for globular proteins, called extended-scaled-collective-variable (ESCV) Monte Carlo, is proposed. This method combines two Monte Carlo algorithms known as entropy-sampling and scaled-collective-variable algorithms. Entropy-sampling Monte Carlo is able to sample a large configurational space even in a disordered system that has a large number of potential barriers. In contrast, scaled-collective-variable Monte Carlo provides an efficient sampling for a system whose dynamics is highly cooperative. Because a globular protein is a disordered system whose dynamics is characterized by collective motions, a combination of these two algorithms could provide an optimal Monte Carlo simulation for a globular protein. As a test case, we have carried out an ESCV Monte Carlo simulation for a cell adhesive Arg-Gly-Asp-containing peptide, Lys-Arg-Cys-Arg-Gly-Asp-Cys-Met-Asp, and determined the conformational distribution at 300 K. The peptide contains a disulfide bridge between the two cysteine residues. This bond mimics the strong geometrical constraints that result from a protein's globular nature and give rise to highly cooperative dynamics. Computation results show that the ESCV Monte Carlo was not trapped at any local minimum and that the canonical distribution was correctly determined.

The structure and organization within the membrane of the helices composing the pore-forming domain of Bacillus thuringiensis δ-endotoxin are consistent with an “umbrella-like” structure of the pore

The aim of this study was to elucidate the mechanism of membrane insertion and the structural organization of pores formed by Bacillus thuringiensis δ-endotoxin. We determined the relative affinities for membranes of peptides corresponding to the seven helices that compose the toxin pore-forming domain, their modes of membrane interaction, their structures within membranes, and their orientations relative to the membrane normal. In addition, we used resonance energy transfer measurements of all possible combinatorial pairs of membrane-bound helices to map the network of interactions between helices in their membrane-bound state. The interaction of the helices with the bilayer membrane was also probed by a Monte Carlo simulation protocol to determine lowest-energy orientations. Our results are consistent with a situation in which helices α4 and α5 insert into the membrane as a helical hairpin in an antiparallel manner, while the other helices lie on the membrane surface like the ribs of an umbrella (the “umbrella model”). Our results also support the suggestion that α7 may serve as a binding sensor to initiate the structural rearrangement of the pore-forming domain.

Characteristic temperatures of folding of a small peptide

We perform a generalized-ensemble simulation of a small peptide taking the interactions among all atoms into account. From this simulation we obtain thermodynamic quantities over a wide range of temperatures. In particular, we show that the folding of a small peptide is a multistage process associated with two characteristic temperatures, the collapse temperature Tθ and the folding temperature Tƒ. Our results give supporting evidence for the energy landscape picture and funnel concept. These ideas were previously developed in the context of studies of simplified protein models, and here are checked in an all-atom Monte Carlo simulation.

Cooperative enhancement of specificity in a lattice of T cell receptors

Two of the most important models to account for the specificity and sensitivity of the T cell receptor (TCR) are the kinetic proofreading and serial ligation models. However, although kinetic proofreading provides a means for individual TCRs to measure accurately the length of time they are engaged and signal appropriately, the stochastic nature of ligand dissociation means the kinetic proofreading model implies that at high concentrations the response of the cell will be relatively nonspecific. Recent ligand experiments have revealed the phenomenon of both negative and positive crosstalk among neighboring TCRs. By using a Monte Carlo simulation of a lattice of TCRs, we integrate receptor crosstalk with the kinetic proofreading and serial ligation models and discover that receptor cooperativity can enhance T cell specificity significantly at a very modest cost to the sensitivity of the response.

A maximum likelihood algorithm for genome mapping of cytogenetic loci from meiotic configuration data.

Frequencies of meiotic configurations in cytogenetic stocks are dependent on chiasma frequencies in segments defined by centromeres, breakpoints, and telomeres. The expectation maximization algorithm is proposed as a general method to perform maximum likelihood estimations of the chiasma frequencies in the intervals between such locations. The estimates can be translated via mapping functions into genetic maps of cytogenetic landmarks. One set of observational data was analyzed to exemplify application of these methods, results of which were largely concordant with other comparable data. The method was also tested by Monte Carlo simulation of frequencies of meiotic configurations from a monotelodisomic translocation heterozygote, assuming six different sample sizes. The estimate averages were always close to the values given initially to the parameters. The maximum likelihood estimation procedures can be extended readily to other kinds of cytogenetic stocks and allow the pooling of diverse cytogenetic data to collectively estimate lengths of segments, arms, and chromosomes.

Modeling and optimization of populations subject to time-dependent mutation.

It has become clear that many organisms possess the ability to regulate their mutation rate in response to environmental conditions. So the question of finding an optimal mutation rate must be replaced by that of finding an optimal mutation schedule. We show that this task cannot be accomplished with standard population-dynamic models. We then develop a "hybrid" model for populations experiencing time-dependent mutation that treats population growth as deterministic but the time of first appearance of new variants as stochastic. We show that the hybrid model agrees well with a Monte Carlo simulation. From this model, we derive a deterministic approximation, a "threshold" model, that is similar to standard population dynamic models but differs in the initial rate of generation of new mutants. We use these techniques to model antibody affinity maturation by somatic hypermutation. We had previously shown that the optimal mutation schedule for the deterministic threshold model is phasic, with periods of mutation between intervals of mutation-free growth. To establish the validity of this schedule, we now show that the phasic schedule that optimizes the deterministic threshold model significantly improves upon the best constant-rate schedule for the hybrid and Monte Carlo models.

A stochastic approximation algorithm with Markov chain Monte-Carlo method for incomplete data estimation problems

We propose a general procedure for solving incomplete data estimation problems. The procedure can be used to find the maximum likelihood estimate or to solve estimating equations in difficult cases such as estimation with the censored or truncated regression model, the nonlinear structural measurement error model, and the random effects model. The procedure is based on the general principle of stochastic approximation and the Markov chain Monte-Carlo method. Applying the theory on adaptive algorithms, we derive conditions under which the proposed procedure converges. Simulation studies also indicate that the proposed procedure consistently converges to the maximum likelihood estimate for the structural measurement error logistic regression model.

Dynamic weighting in Monte Carlo and optimization

Dynamic importance weighting is proposed as a Monte Carlo method that has the capability to sample relevant parts of the configuration space even in the presence of many steep energy minima. The method relies on an additional dynamic variable (the importance weight) to help the system overcome steep barriers. A non-Metropolis theory is developed for the construction of such weighted samplers. Algorithms based on this method are designed for simulation and global optimization tasks arising from multimodal sampling, neural network training, and the traveling salesman problem. Numerical tests on these problems confirm the effectiveness of the method.