Efficient global biopolymer sampling with end-transfer configurational bias Monte Carlo

We develop an "end-transfer configurational bias Monte Carlo" method for efficient thermodynamic sampling of complex biopolymers and assess its performance on a mesoscale model of chromatin (oligonucleosome) at different salt conditions compared to other Monte Carlo moves. Our method extends traditional configurational bias by deleting a repeating motif (monomer) from one end of the biopolymer and regrowing it at the opposite end using the standard Rosenbluth scheme. The method's sampling efficiency compared to local moves, pivot rotations, and standard configurational bias is assessed by parameters relating to translational, rotational, and internal degrees of freedom of the oligonucleosome. Our results show that the end-transfer method is superior in sampling every degree of freedom of the oligonucleosomes over other methods at high salt concentrations (weak electrostatics) but worse than the pivot rotations in terms of sampling internal and rotational sampling at low-to-moderate salt concentrations (strong electrostatics). Under all conditions investigated, however, the end-transfer method is several orders of magnitude more efficient than the standard configurational bias approach. This is because the characteristic sampling time of the innermost oligonucleosome motif scales quadratically with the length of the oligonucleosomes for the end-transfer method while it scales exponentially for the traditional configurational-bias method. Thus, the method we propose can significantly improve performance for global biomolecular applications, especially in condensed systems with weak nonbonded interactions and may be combined with local enhancements to improve local sampling.     

Monte Carlo treatment planning for photon and electron beams

During the last few decades, accuracy in photon and electron radiotherapy has increased substantially. This is partly due to enhanced linear accelerator technology, providing more flexibility in field definition (e.g. the usage of computer-controlled dynamic multileaf collimators), which led to intensity modulated radiotherapy (IMRT). Important improvements have also been made in the treatment planning process, more specifically in the dose calculations. Originally, dose calculations relied heavily on analytic, semi-analytic and empirical algorithms. The more accurate convolution/superposition codes use pre-calculated Monte Carlo dose “kernels” partly accounting for tissue density heterogeneities. It is generally recognized that the Monte Carlo method is able to increase accuracy even further. Since the second half of the 1990s, several Monte Carlo dose engines for radiotherapy treatment planning have been introduced. To enable the use of a Monte Carlo treatment planning (MCTP) dose engine in clinical circumstances, approximations have been introduced to limit the calculation time. In this paper, the literature on MCTP is reviewed, focussing on patient modeling, approximations in linear accelerator modeling and variance reduction techniques. An overview of published comparisons between MC dose engines and conventional dose calculations is provided for phantom studies and clinical examples, evaluating the added value of MCTP in the clinic. An overview of existing Monte Carlo dose engines and commercial MCTP systems is presented and some specific issues concerning the commissioning of a MCTP system are discussed.     

Clinical considerations of Monte Carlo for electron radiotherapy treatment planning

Technical requirements for Monte Carlo based electron radiotherapy treatment planning are outlined. The targeted overall accuracy for estimate of the delivered dose is the least restrictive of 5% in dose, 5 mm in isodose position. A system based on EGS4 and capable of achieving this accuracy is described. Experience gained in system design and commissioning is summarized. The key obstacle to widespread clinical use of Monte Carlo is lack of clinically acceptable measurement based methodology for accurate commissioning.     

An efficient sampling algorithm for variational Monte Carlo

We propose a new algorithm for sampling the N-body density mid R:Psi(R)mid R:(2)R(3N)mid R:Psimid R:(2) in the variational Monte Carlo framework. This algorithm is based upon a modified Ricci-Ciccotti discretization of the Langevin dynamics in the phase space (R,P) improved by a Metropolis-Hastings accept/reject step. We show through some representative numerical examples (lithium, fluorine, and copper atoms and phenol molecule) that this algorithm is superior to the standard sampling algorithm based on the biased random walk (importance sampling).     

A general framework for non-Boltzmann Monte Carlo sampling

Non-Boltzmann sampling (NBS) methods have been extensively employed in recent years, mainly due to their ability to enhance ergodicity in simulations of complex systems. In addition, they make possible reliable computation of equilibrium properties (ensemble averages, free-energy differences, and potentials of mean force) over continuous ranges of thermodynamic conditions. In this work, we put forward a general and systematic framework for NBS methods that allows a single set of equations and procedures to be applied to diverse systems. Moreover, we show how to exploit simulation data most effectively by obtaining continuous profiles of any mechanical properties, including structural quantities not directly related to the ensemble parameters. Finally, we demonstrate the usefulness of the developed formulation by applying it to spin systems, Lennard-Jones fluids, and a model protein molecule (both in isolation and in the proximity of a flat wall).     

Efficient Monte Carlo trial moves for polypeptide simulations

A new move set for the Monte Carlo simulations of polypeptide chains is introduced. It consists of a rigid rotation along the (C(alpha)) ends of an arbitrary long segment of the backbone in such a way that the atoms outside this segment remain fixed. This fixed end move, or FEM, alters only the backbone dihedral angles phi and psi and the C(alpha) bond angles of the segment ends. Rotations are restricted to those who keep the alpha bond angles within their maximum natural range of approximately +/-10 degrees. The equations for the angular intervals (tau) of the allowed rigid rotations and the equations required for satisfying the detailed balance condition are presented in detail. One appealing property of the FEM is that the required number of calculations is minimal, as it is evident from the simplicity of the equations. In addition, the moving backbone atoms undergo considerable but limited displacements of up to 3 A. These properties, combined with the small number of backbone angles changed, lead to high acceptance rates for the new conformations and make the algorithm very efficient for sampling the conformational space. The FEMs, combined with pivot moves, are used in a test to fold a group of coarse-grained proteins with lengths of up to 200 residues.     

Efficient multiparticle sampling in Monte Carlo simulations on fluids: application to polarizable models

A novel Monte Carlo simulation scheme based on biased simultaneous displacements of all particles of the system has been developed. The method is particularly suited for systems with nonadditive interactions and its efficiency is demonstrated by its implementation for the polarizable Stockmayer fluid. Performance of the method is compared with both the standard one-particle move method and an unbiased multiparticle scheme by computing the mean squared displacements, rotation relaxation, and the speed of equilibration (translational order parameter). It is shown that the proposed biased method is about a factor of 10 faster, for the system considered, when compared with the other schemes.     

Optimum and efficient sampling for variational quantum Monte Carlo

Quantum mechanics for many-body systems may be reduced to the evaluation of integrals in 3N dimensions using Monte Carlo, providing the Quantum Monte Carlo ab initio methods. Here we limit ourselves to expectation values for trial wave functions, that is to variational quantum Monte Carlo. Almost all previous implementations employ samples distributed as the physical probability density of the trial wave function, and assume the central limit theorem to be valid. In this paper we provide an analysis of random error in estimation and optimization that leads naturally to new sampling strategies with improved computational and statistical properties. A rigorous lower limit to the random error is derived, and an efficient sampling strategy presented that significantly increases computational efficiency. In addition the infinite variance heavy tailed random errors of optimum parameters in conventional methods are replaced with a Normal random error, strengthening the theoretical basis of optimization. The method is applied to a number of first row systems and compared with previously published results.     

Wavelet-accelerated Monte Carlo sampling of polymer chains

We introduce a new method for coarse-graining polymer chains, based on the wavelet transform, a multiresolution data analysis technique. This method, which assigns a cluster of particles to a coarse-grained bead located at the center of mass of the cluster, reduces the complexity of the problem significantly by dividing the simulation into several stages, each with a small fraction of the number of beads in the overall chain. At each stage, we compute the distributions of coarse-grained internal coordinates as well as potential functions required for subsequent simulation stages. We show that, with this wavelet-accelerated Monte Carlo method, coarse-grained Gaussian and self-avoiding random walks can reproduce results obtained from atomistic simulations to a high degree of accuracy in orders of magnitude less time. © 2005 Wiley Periodicals, Inc. J Polym Sci Part B: Polym Phys 43: 897–910, 2005     

Optimized Monte Carlo sampling in forward-backward semiclassical dynamics

Forward-backward semiclassical dynamics (FBSD) provides a rigorous and powerful methodology for calculating time correlation functions in condensed phase systems characterized by substantial quantum mechanical effects associated with zero-point motion, quantum dispersion, or identical particle exchange symmetries. The efficiency of these simulations arises from the use of classical trajectories to capture all dynamical information. However, full quantization of the density operator makes these calculations rather expensive compared to fully classical molecular dynamics simulations. This article discusses the convergence properties of various correlation functions and introduces an optimal Monte Carlo sampling scheme that leads to a significant reduction of statistical error. A simple and efficient procedure for normalizing the FBSD results is also discussed. Illustrative examples on model systems are presented.     

Assessing protein loop flexibility by hierarchical Monte Carlo sampling

Loop flexibility is often crucial to protein biological function in solution. We report a new Monte Carlo method for generating conformational ensembles for protein loops and cyclic peptides. The approach incorporates the triaxial loop closure method which addresses the inverse kinematic problem for generating backbone move sets that do not break the loop. Sidechains are sampled together with the backbone in a hierarchical way, making it possible to make large moves that cross energy barriers. As an initial application, we apply the method to the flexible loop in triosephosphate isomerase that caps the active site, and demonstrate that the resulting loop ensembles agree well with key observations from previous structural studies. We also demonstrate, with 3 other test cases, the ability to distinguish relatively flexible and rigid loops within the same protein.     

Monte Carlo sampling algorithm for searching a scale-transformed energy space of polypeptides

A Monte Carlo sampling algorithm for searching a scale-transformed conformational energy space of polypeptides is presented. This algorithm is based on the assumption that energy barriers can be overcome by a uniform sampling of the logarithmically transformed energy space. This algorithm is tested with Met-enkephalin. For comparison, the entropy sampling Monte Carlo (ESMC) simulation is performed. First, the global minimum is easily found by the optimization of a scale-transformed energy space. With a new Monte Carlo sampling, energy barriers of 3000 kcal/mol are frequently overcome, and low-energy conformations are sampled more efficiently than with ESMC simulations. Several thermodynamic quantities are calculated with good accuracy.     

A rare event sampling method for diffusion Monte Carlo using smart darting

We identify a set of multidimensional potential energy surfaces sufficiently complex to cause both the classical parallel tempering and the guided or unguided diffusion Monte Carlo methods to converge too inefficiently for practical applications. The mathematical model is constructed as a linear combination of decoupled Double Wells [(DDW)(n)]. We show that the set (DDW)(n) provides a serious test for new methods aimed at addressing rare event sampling in stochastic simulations. Unlike the typical numerical tests used in these cases, the thermodynamics and the quantum dynamics for (DDW)(n) can be solved deterministically. We use the potential energy set (DDW)(n) to explore and identify methods that can enhance the diffusion Monte Carlo algorithm. We demonstrate that the smart darting method succeeds at reducing quasiergodicity for n ? 100 using just 1 × 10(6) moves in classical simulations (DDW)(n). Finally, we prove that smart darting, when incorporated into the regular or the guided diffusion Monte Carlo algorithm, drastically improves its convergence. The new method promises to significantly extend the range of systems computationally tractable by the diffusion Monte Carlo algorithm.     

Projector Monte Carlo method based on Slater determinants: a new sampling method for singlet state calculations

A new sampling method is proposed for projector Monte Carlo (PMC) calculations based on Slater determinants (SD) in singlet states. Using the symmetry of the ?? and ?? electron determinants, the number of configurations to be considered can be about one-half of the original sampling. We applied the new sampling to the PMC-SD calculations of the H₂O molecule in the ground state. The results were always improved by the new sampling method both for the equilibrium and for bond-stretched structures.     

Adaptive importance sampling Monte Carlo simulation of rare transition events

We develop a general theoretical framework for the recently proposed importance sampling method for enhancing the efficiency of rare-event simulations [W. Cai, M. H. Kalos, M. de Koning, and V. V. Bulatov, Phys. Rev. E 66, 046703 (2002)], and discuss practical aspects of its application. We define the success/fail ensemble of all possible successful and failed transition paths of any duration and demonstrate that in this formulation the rare-event problem can be interpreted as a "hit-or-miss" Monte Carlo quadrature calculation of a path integral. The fact that the integrand contributes significantly only for a very tiny fraction of all possible paths then naturally leads to a "standard" importance sampling approach to Monte Carlo (MC) quadrature and the existence of an optimal importance function. In addition to showing that the approach is general and expected to be applicable beyond the realm of Markovian path simulations, for which the method was originally proposed, the formulation reveals a conceptual analogy with the variational MC (VMC) method. The search for the optimal importance function in the former is analogous to finding the ground-state wave function in the latter. In two model problems we discuss practical aspects of finding a suitable approximation for the optimal importance function. For this purpose we follow the strategy that is typically adopted in VMC calculations: the selection of a trial functional form for the optimal importance function, followed by the optimization of its adjustable parameters. The latter is accomplished by means of an adaptive optimization procedure based on a combination of steepest-descent and genetic algorithms.     

Rapid sampling of reactive Langevin trajectories via noise-space Monte Carlo

A noise-space Monte Carlo approach to sampling reactive Langevin trajectories is introduced and compared to a configuration based approach. The noise sampling is shown to overcome the slow relaxation of the configuration based method. Furthermore, the noise sampling is shown to sample multiple pathways with the correct probabilities without any additional work being required formally or algorithmically. The path sampling proceeds without any introduction of fictitious interactions and includes only the parameters appearing in Langevin's equation.     

Monte Carlo simulation of polarizable systems: Early rejection scheme for improving the performance of adiabatic nuclear and electronic sampling Monte Carlo simulations

An early rejection scheme for trial moves in adiabatic nuclear and electronic sampling Monte Carlo simulation (ANES-MC) of polarizable intermolecular potential models is presented. The proposed algorithm is based on Swendsen–Wang filter functions for prediction of success or failure of trial moves in Monte Carlo simulations. The goal was to reduce the amount of calculations involved in ANES-MC electronic moves, by foreseeing the success of an attempt before making those moves. The new method was employed in Gibbs ensemble Monte Carlo (GEMC) simulations of the polarizable simple point charge-fluctuating charge (SPC-FQ) model of water. The overall improvement in GEMC depends on the number of swap attempts (transfer molecules between phases) in one Monte Carlo cycle. The proposed method allows this number to increase, enhancing the chemical potential equalization. For a system with 300 SPC-FQ water molecules, for example, the fractions of early rejected transfers were about 0.9998 and 0.9994 at 373 and 423 K, respectively. This means that the transfer moves consume only a very small part of the overall computing effort, making GEMC almost equivalent to a simulation in the canonical ensemble.