Monte Carlo simulation of a statistical mechanical model of multiple protein sequence alignment.
Ontology highlight
ABSTRACT:
SUBMITTER: Kinjo AR
PROVIDER: S-EPMC5551269 | biostudies-literature | 2017
REPOSITORIES: biostudies-literature
Publications
Monte Carlo simulation of a statistical mechanical model of multiple protein sequence alignment.
Biophysics and physicobiology 20170712
A grand canonical Monte Carlo (MC) algorithm is presented for studying the lattice gas model (LGM) of multiple protein sequence alignment, which coherently combines long-range interactions and variable-length insertions. MC simulations are used for both parameter optimization of the model and production runs to explore the sequence subspace around a given protein family. In this Note, I describe the details of the MC algorithm as well as some preliminary results of MC simulations with various te ...[more]
Similar Datasets
Project description:BackgroundThe Monte Carlo simulation of sequence evolution is routinely used to assess the performance of phylogenetic inference methods and sequence alignment algorithms. Progress in the field of molecular evolution fuels the need for more realistic and hence more complex simulations, adapted to particular situations, yet current software makes unreasonable assumptions such as homogeneous substitution dynamics or a uniform distribution of indels across the simulated sequences. This calls for an extensible simulation framework written in a high-level functional language, offering new functionality and making it easy to incorporate further complexity.ResultsPhyloSim is an extensible framework for the Monte Carlo simulation of sequence evolution, written in R, using the Gillespie algorithm to integrate the actions of many concurrent processes such as substitutions, insertions and deletions. Uniquely among sequence simulation tools, PhyloSim can simulate arbitrarily complex patterns of rate variation and multiple indel processes, and allows for the incorporation of selective constraints on indel events. User-defined complex patterns of mutation and selection can be easily integrated into simulations, allowing PhyloSim to be adapted to specific needs.ConclusionsClose integration with R and the wide range of features implemented offer unmatched flexibility, making it possible to simulate sequence evolution under a wide range of realistic settings. We believe that PhyloSim will be useful to future studies involving simulated alignments.
| S-EPMC3102636 | biostudies-literature
Project description:Traditional multiple-group confirmatory factor analysis (multiple-group CFA) is usually criticized for having too restrictive model assumption, namely the scalar measurement invariance. The new multiple-group analysis methodology, alignment, has become an effective alternative. The alignment evaluates measurement invariance and more importantly, permits factor mean comparisons without requiring scalar invariance which is usually required in traditional multiple-group CFA. Some simulation studies and empirical studies have investigated the applicability of alignment under different conditions, but some areas remain unexplored. Based on the simulation studies of Asparouhov and Muthén and of Flake and McCoach, this current simulation study is broken into two sections. The first study investigates the minimal group sizes required for alignment in three-factor models. The second study compares the performance of multiple-group CFA, multiple-group exploratory structural equation model (multiple-group ESEM), and alignment by including different proportions and magnitudes of cross-loadings in the models. Study 1 shows that when the model has no noninvariant parameters, the alignment requires relatively lower group sizes. Explicitly, the minimal group size required for alignment was 250 when the amount of groups was three, the minimal group size was 150 when the amount of groups was nine, and 200 when the amount of groups was 15. When there are noninvariant parameters in the model and the amount of groups is low, a group size of 350 is a safe rule of thumb. When there are noninvariant parameters in the model and the amount of groups is high, a group size of 250 is required for trustworthy results. The magnitude of noninvariance and the noninvariance rate do not affect the minimal group size required for alignment. Study 2 shows that multiple-group CFA provides accurate factor mean estimates when each factor had 20% factor loading (1 factor loading) with small-sized cross-loading. Multiple-group ESEM provides accurate factor mean estimates when the magnitude of cross-loading is small or when each factor had 20% factor loading (1 factor loading) with medium-sized cross-loading. Alignment provides accurate factor mean estimates when there are only small-sized cross-loadings in the model. The parameter estimates, coverage rates and ratios of average standard error to standard deviation for each methodology are not influenced by the amount of groups. Recommendations are concluded for using multiple-group CFA, multiple-group ESEM, traditional alignment and aligned ESEM (AESEM) based on the results. Multiple-group CFA is more suitable for use when scalar invariance is established. Multiple-group ESEM works best when there are small-sized or only a few medium-sized cross-loadings in the model. Traditional alignment allows for small-sized cross-loadings and a few noninvariant parameters in the model. AESEM integrates the advantages of alignment and ESEM, can provide accurate estimates when noninvariant parameters and cross-loadings both exist in the model. Compared to multiple-group CFA, multiple-group ESEM, the alignment methodology performs well in more situations.
| S-EPMC9263979 | biostudies-literature
Project description:The multiple sequence alignment (MSA) of a protein family provides a wealth of information in terms of the conservation pattern of amino acid residues not only at each alignment site but also between distant sites. In order to statistically model the MSA incorporating both short-range and long-range correlations as well as insertions, I have derived a lattice gas model of the MSA based on the principle of maximum entropy. The partition function, obtained by the transfer matrix method with a mean-field approximation, accounts for all possible alignments with all possible sequences. The model parameters for short-range and long-range interactions were determined by a self-consistent condition and by a Gaussian approximation, respectively. Using this model with and without long-range interactions, I analyzed the globin and V-set domains by increasing the "temperature" and by "mutating" a site. The correlations between residue conservation and various measures of the system's stability indicate that the long-range interactions make the conservation pattern more specific to the structure, and increasingly stabilize better conserved residues.
| S-EPMC5042171 | biostudies-literature
Project description:This simulation study assessed the statistical performance of a skew t mixture latent state-trait (LST) model for the analysis of longitudinal data. The model aims to identify interpretable latent classes with class-specific LST model parameters. A skew t-distribution within classes is allowed to account for non-normal outcomes. This flexible function covers heavy tails and may reduce the risk of identifying spurious classes, e.g., in case of outliers. Sample size, number of occasions and skewness of the trait variable were varied. Generally, parameter estimation accuracy increases with increasing numbers of observations and occasions. Larger bias compared to other parameters occurs for parameters referring to the skew t-distribution and variances of the latent trait variables. Standard error estimation accuracy shows diffuse patterns across conditions and parameters. Overall model performance is acceptable for large conditions, even though none of the models is free from bias. The application of the skew t mixture model in case of large numbers of occasions and observations may be possible, but results should be treated with caution. Moreover, the skew t approach may be useful for other mixture models.
| S-EPMC6083219 | biostudies-literature
Project description:Protein-ligand docking is an important approach for virtual screening and protein function annotation. Although many docking methods have been developed, most require a high-resolution crystal structure of the receptor and a user-specified binding site to start. This information is, however, not available for the majority of unknown proteins, including many pharmaceutically important targets. Developing blind docking methods without predefined binding sites and working with low-resolution receptor models from protein structure prediction is thus essential. In this manuscript, we propose a novel Monte Carlo based method, EDock, for blind protein-ligand docking. For a given protein, binding sites are first predicted by sequence-profile and substructure-based comparison searches with initial ligand poses generated by graph matching. Next, replica-exchange Monte Carlo (REMC) simulations are performed for ligand conformation refinement under the guidance of a physical force field coupled with binding-site distance constraints. The method was tested on two large-scale datasets containing 535 protein-ligand pairs. Without specifying binding pockets on the experimental receptor structures, EDock achieves on average a ligand RMSD of 2.03 Å, which compares favorably with state-of-the-art docking methods including DOCK6 (2.68 Å) and AutoDock Vina (3.92 Å). When starting with predicted models from I-TASSER, EDock still generates reasonable docking models, with a success rate 159% and 67% higher than DOCK6 and AutoDock Vina, respectively. Detailed data analyses show that the major advantage of EDock lies in reliable ligand binding site predictions and extensive REMC sampling, which allows for the implementation of multiple van der Waals weightings to accommodate different levels of steric clashes and cavity distortions and therefore enhances the robustness of low-resolution docking with predicted protein structures.
| S-EPMC7251717 | biostudies-literature
Project description:BackgroundMonte Carlo simulation is considered as the most accurate method for dose calculation in radiotherapy. PRIMO is a Monte-Carlo program with a user-friendly graphical interface.Material and methodA VitalBeam with 6MV and 6MV flattening filter free (FFF), equipped with the 120 Millennium multileaf collimator was simulated by PRIMO. We adjusted initial energy, energy full width at half maximum (FWHM), focal spot FWHM, and beam divergence to match the measurements. The water tank and ion-chamber were used in the measurement. Percentage depth dose (PDD) and off axis ratio (OAR) were evaluated with gamma passing rates (GPRs) implemented in PRIMO. PDDs were matched at different widths of standard square fields. OARs were matched at five depths. Transmission factor and dose leaf gap (DLG) were simulated. DLG was measured by electronic portal imaging device using a sweeping gap method.ResultFor the criterion of 2%/2 mm, 1%/2 mm and 1%/1 mm, the GPRs of 6MV PDD were 99.33-100%, 99-100%, and 99-100%, respectively; the GPRs of 6MV FFF PDD were 99.33-100%, 98.99-99.66%, and 97.64-98.99%, respectively; the GPRs of 6MV OAR were 96.4-100%, 90.99-100%, and 85.12-98.62%, respectively; the GPRs of 6MV FFF OAR were 95.15-100%, 89.32-100%, and 87.02-99.74%, respectively. The calculated DLG matched well with the measurement (6MV: 1.36 mm vs. 1.41 mm; 6MV FFF: 1.07 mm vs. 1.03 mm, simulation vs measurement). The transmission factors were similar (6MV: 1.25% vs. 1.32%; 6MV FFF: 0.8% vs. 1.12%, simulation vs measurement).ConclusionThe calculated PDD, OAR, DLG and transmission factor were all in good agreement with measurements. PRIMO is an independent (with respect to analytical dose calculation algorithm) and accurate Monte Carlo tool.
| S-EPMC9667592 | biostudies-literature
Project description:MotivationIn molecular biology, as in many other scientific fields, the scale of analyses is ever increasing. Often, complex Monte Carlo simulation is required, sometimes within a large-scale multiple testing setting. The resulting computational costs may be prohibitively high.ResultsWe here present MCFDR, a simple, novel algorithm for false discovery rate (FDR) modulated sequential Monte Carlo (MC) multiple hypothesis testing. The algorithm iterates between adding MC samples across tests and calculating intermediate FDR values for the collection of tests. MC sampling is stopped either by sequential MC or based on a threshold on FDR. An essential property of the algorithm is that it limits the total number of MC samples whatever the number of true null hypotheses. We show on both real and simulated data that the proposed algorithm provides large gains in computational efficiency.AvailabilityMCFDR is implemented in the Genomic HyperBrowser (http://hyperbrowser.uio.no/mcfdr), a web-based system for genome analysis. All input data and results are available and can be reproduced through a Galaxy Pages document at: http://hyperbrowser.uio.no/mcfdr/u/sandve/p/mcfdr.Contactgeirksa@ifi.uio.no.
| S-EPMC3223366 | biostudies-literature
Project description:The estimation of multiple sequence alignments of protein sequences is a basic step in many bioinformatics pipelines, including protein structure prediction, protein family identification, and phylogeny estimation. Statistical coestimation of alignments and trees under stochastic models of sequence evolution has long been considered the most rigorous technique for estimating alignments and trees, but little is known about the accuracy of such methods on biological benchmarks. We report the results of an extensive study evaluating the most popular protein alignment methods as well as the statistical coestimation method BAli-Phy on 1192 protein data sets from established benchmarks as well as on 120 simulated data sets. Our study (which used more than 230 CPU years for the BAli-Phy analyses alone) shows that BAli-Phy has better precision and recall (with respect to the true alignments) than the other alignment methods on the simulated data sets but has consistently lower recall on the biological benchmarks (with respect to the reference alignments) than many of the other methods. In other words, we find that BAli-Phy systematically underaligns when operating on biological sequence data but shows no sign of this on simulated data. There are several potential causes for this change in performance, including model misspecification, errors in the reference alignments, and conflicts between structural alignment and evolutionary alignments, and future research is needed to determine the most likely explanation. We conclude with a discussion of the potential ramifications for each of these possibilities. [BAli-Phy; homology; multiple sequence alignment; protein sequences; structural alignment.].
| S-EPMC6472439 | biostudies-literature
Project description:BackgroundMultiple sequence alignment is an important task in bioinformatics, and alignments of large datasets containing hundreds or thousands of sequences are increasingly of interest. While many alignment methods exist, the most accurate alignments are likely to be based on stochastic models where sequences evolve down a tree with substitutions, insertions, and deletions. While some methods have been developed to estimate alignments under these stochastic models, only the Bayesian method BAli-Phy has been able to run on even moderately large datasets, containing 100 or so sequences. A technique to extend BAli-Phy to enable alignments of thousands of sequences could potentially improve alignment and phylogenetic tree accuracy on large-scale data beyond the best-known methods today.ResultsWe use simulated data with up to 10,000 sequences representing a variety of model conditions, including some that are significantly divergent from the statistical models used in BAli-Phy and elsewhere. We give a method for incorporating BAli-Phy into PASTA and UPP, two strategies for enabling alignment methods to scale to large datasets, and give alignment and tree accuracy results measured against the ground truth from simulations. Comparable results are also given for other methods capable of aligning this many sequences.ConclusionsExtensions of BAli-Phy using PASTA and UPP produce significantly more accurate alignments and phylogenetic trees than the current leading methods.
| S-EPMC5123300 | biostudies-literature
Project description:Buffered diffusion occurs when ligands enter or leave a restricted space, such as a chemical synapse, containing a high density of binding sites. This study used Monte Carlo simulations to determine the time and spatial dependences of buffered diffusion without a priori assumptions about kinetics. The synapse was modeled as a box with receptors on one inner face. The exterior was clamped to some ligand concentration and ligands diffused through two sides. Onset and recovery simulations were carried out and the effects of receptor density, ligand properties and synapse geometry were investigated. This study determined equilibration times for binding and the spatial gradient of unliganded receptors. Onset was characterized by a high spatial gradient; equilibration was limited by the time needed for sufficient ligands to enter the synapse. Recovery showed a low spatial gradient with receptor equilibration limited by ligand rebinding. Decreasing ligand association rate or increasing ligand diffusion coefficient reduced the role of buffered diffusion and decreased the spatial gradient. Simulations with irreversible ligands showed larger, persistent spatial gradients. These simulations identify characteristics that can be used to test whether a synaptic process is governed by buffered diffusion. They also indicate that fundamental differences in synapse function may occur with irreversible ligands.
| S-EPMC2849082 | biostudies-literature