GARN: Sampling RNA 3D Structure Space with Game Theory and Knowledge-Based Scoring Strategies.
Ontology highlight
ABSTRACT:
SUBMITTER: Boudard M
PROVIDER: S-EPMC4551674 | biostudies-literature | 2015
REPOSITORIES: biostudies-literature
Publications
GARN: Sampling RNA 3D Structure Space with Game Theory and Knowledge-Based Scoring Strategies.
Boudard Mélanie M Bernauer Julie J Barth Dominique D Cohen Johanne J Denise Alain A
PloS one 20150827 8
Cellular processes involve large numbers of RNA molecules. The functions of these RNA molecules and their binding to molecular machines are highly dependent on their 3D structures. One of the key challenges in RNA structure prediction and modeling is predicting the spatial arrangement of the various structural elements of RNA. As RNA folding is generally hierarchical, methods involving coarse-grained models hold great promise for this purpose. We present here a novel coarse-grained method for sa ...[more]
Similar Datasets
Project description:In order to accommodate the empirical fact that population structures are rarely simple, modern studies of evolutionary dynamics allow for complicated and highly heterogeneous spatial structures. As a result, one of the most difficult obstacles lies in making analytical deductions, either qualitative or quantitative, about the long-term outcomes of evolution. The "structure-coefficient" theorem is a well-known approach to this problem for mutation-selection processes under weak selection, but a general method of evaluating the terms it comprises is lacking. Here, we provide such a method for populations of fixed (but arbitrary) size and structure, using easily interpretable demographic measures. This method encompasses a large family of evolutionary update mechanisms and extends the theorem to allow for asymmetric contests to provide a better understanding of the mutation-selection balance under more realistic circumstances. We apply the method to study social goods produced and distributed among individuals in spatially heterogeneous populations, where asymmetric interactions emerge naturally and the outcome of selection varies dramatically, depending on the nature of the social good, the spatial topology, and the frequency with which mutations arise.
| S-EPMC9282417 | biostudies-literature
Project description:A novel method is presented for predicting the common secondary structures and alignment of two homologous RNA sequences by sampling the 'structural alignment' space, i.e. the joint space of their alignments and common secondary structures. The structural alignment space is sampled according to a pseudo-Boltzmann distribution based on a pseudo-free energy change that combines base pairing probabilities from a thermodynamic model and alignment probabilities from a hidden Markov model. By virtue of the implicit comparative analysis between the two sequences, the method offers an improvement over single sequence sampling of the Boltzmann ensemble. A cluster analysis shows that the samples obtained from joint sampling of the structural alignment space cluster more closely than samples generated by the single sequence method. On average, the representative (centroid) structure and alignment of the most populated cluster in the sample of structures and alignments generated by joint sampling are more accurate than single sequence sampling and alignment based on sequence alone, respectively. The 'best' centroid structure that is closest to the known structure among all the centroids is, on average, more accurate than structure predictions of other methods. Additionally, cluster analysis identifies, on average, a few clusters, whose centroids can be presented as alternative candidates. The source code for the proposed method can be downloaded at http://rna.urmc.rochester.edu.
| S-EPMC2709569 | biostudies-literature
Project description:RNA 3D structures are critical for understanding their functions. However, only a limited number of RNA structures have been experimentally solved, so computational prediction methods are highly desirable. Nevertheless, accurate prediction of RNA 3D structures, especially those containing multiway junctions, remains a significant challenge, mainly due to the complicated non-canonical base pairing and stacking interactions in the junction loops and the possible long-range interactions between loop structures. Here we present RNAJP ('RNA Junction Prediction'), a nucleotide- and helix-level coarse-grained model for the prediction of RNA 3D structures, particularly junction structures, from a given 2D structure. Through global sampling of the 3D arrangements of the helices in junctions using molecular dynamics simulations and in explicit consideration of non-canonical base pairing and base stacking interactions as well as long-range loop-loop interactions, the model can provide significantly improved predictions for multibranched junction structures than existing methods. Moreover, integrated with additional restraints from experiments, such as junction topology and long-range interactions, the model may serve as a useful structure generator for various applications.
| S-EPMC10123122 | biostudies-literature
Project description:Many origins-of-life scenarios depict a situation in which there are common and potentially scarce resources needed by molecules that compete for survival and reproduction. The dynamics of RNA assembly in a complex mixture of sequences is a frequency-dependent process and mimics such scenarios. By synthesizing Azoarcus ribozyme genotypes that differ in their single-nucleotide interactions with other genotypes, we can create molecules that interact among each other to reproduce. Pairwise interplays between RNAs involve both cooperation and selfishness, quantifiable in a 2 × 2 payoff matrix. We show that a simple model of differential equations based on chemical kinetics accurately predicts the outcomes of these molecular competitions using simple rate inputs into these matrices. In some cases, we find that mixtures of different RNAs reproduce much better than each RNA type alone, reflecting a molecular form of reciprocal cooperation. We also demonstrate that three RNA genotypes can stably coexist in a rock-paper-scissors analog. Our experiments suggest a new type of evolutionary game dynamics, called prelife game dynamics or chemical game dynamics. These operate without template-directed replication, illustrating how small networks of RNAs could have developed and evolved in an RNA world.
| S-EPMC4983821 | biostudies-literature
Project description:Despite the fact that infant gut colonization patterns have been extensively studied, we have limited knowledge about the underlying ecological processes. This particularly relates to the ecological choice of nutrient utilization strategies. The aim of the current study was therefore to compare empirically determined nutrient utilization strategies with that expected from a combinatorial game theory model. Observational analyses for 100 mother-child pairs suggested mother-child transmission of specialists with the potential to use few nutrients. Generalists, on the other hand, with the potential to use many nutrients, peaked at three months of age for the children. The level of generalists was gradually replaced with specialists up to 12 months of age. Game theory simulation revealed a competitive advantage of generalists in an expanding population, while more specialized bacteria were favoured with the maturation of the population. This suggests that the observed increase in generalists in the three-month-old children could be due to an immature, expanding gut microbiota population while the increase of specialists at 12 months could be due to population maturation. The simulated and empirical data also correspond with respect to an increased α diversity and a decreased β diversity with the number of simulations and age, respectively. Taken together, game theory simulation of nutrient utilization strategies can therefore provide novel insight into the maturation of the human gut microbiota during infancy.
| S-EPMC7423673 | biostudies-literature
Project description:Accurately predicting loop structures is important for understanding functions of many proteins. In order to obtain loop models with high accuracy, efficiently sampling the loop conformation space to discover reasonable structures is a critical step. In loop conformation sampling, coarse-grain energy (scoring) functions coupling with reduced protein representations are often used to reduce the number of degrees of freedom as well as sampling computational time. However, due to implicitly considering many factors by reduced representations, the coarse-grain scoring functions may have potential insensitivity and inaccuracy, which can mislead the sampling process and consequently ignore important loop conformations. In this paper, we present a new computational sampling approach to obtain reasonable loop backbone models, so-called the Pareto optimal sampling (POS) method. The rationale of the POS method is to sample the function space of multiple, carefully selected scoring functions to discover an ensemble of diversified structures yielding Pareto optimality to all sampled conformations. The POS method can efficiently tolerate insensitivity and inaccuracy in individual scoring functions and thereby lead to significant accuracy improvement in loop structure prediction. We apply the POS method to a set of 4-12-residue loop targets using a function space composed of backbone-only Rosetta and distance-scale finite ideal-gas reference (DFIRE) and a triplet backbone dihedral potential developed in our lab. Our computational results show that in 501 out of 502 targets, the model sets generated by POS contain structure models are within subangstrom resolution. Moreover, the top-ranked models have a root mean square deviation (rmsd) less than 1 A in 96.8, 84.1, and 72.2% of the short (4-6 residues), medium (7-9 residues), and long (10-12 residues) targets, respectively, when the all-atom models are generated by local optimization from the backbone models and are ranked by our recently developed Pareto optimal consensus (POC) method. Similar sampling effectiveness can also be found in a set of 13-residue loop targets.
| S-EPMC3211142 | biostudies-literature
Project description:Nature only samples a small fraction of the sequence space that can fold into stable proteins. Furthermore, small structural variations in a single fold, sometimes only a few amino acids, can define a protein's molecular function. Hence, to design proteins with novel functionalities, such as molecular recognition, methods to control and sample shape diversity are necessary. To explore this space, we developed and experimentally validated a computational platform that can design a wide variety of small protein folds while sampling shape diversity. We designed and evaluated stability of about 30,000 de novo protein designs of eight different folds. Among these designs, about 6,200 stable proteins were identified, including some predicted to have a first-of-its-kind minimalized thioredoxin fold. Obtained data revealed protein folding rules for structural features such as helix-connecting loops. Beyond serving as a resource for protein engineering, this massive and diverse dataset also provides training data for machine learning. We developed an accurate classifier to predict the stability of our designed proteins. The methods and the wide range of protein shapes provide a basis for designing new protein functions without compromising stability.
| S-EPMC9684540 | biostudies-literature
Project description:This paper introduces a model of 'theory of mind', namely, how we represent the intentions and goals of others to optimise our mutual interactions. We draw on ideas from optimum control and game theory to provide a 'game theory of mind'. First, we consider the representations of goals in terms of value functions that are prescribed by utility or rewards. Critically, the joint value functions and ensuing behaviour are optimised recursively, under the assumption that I represent your value function, your representation of mine, your representation of my representation of yours, and so on ad infinitum. However, if we assume that the degree of recursion is bounded, then players need to estimate the opponent's degree of recursion (i.e., sophistication) to respond optimally. This induces a problem of inferring the opponent's sophistication, given behavioural exchanges. We show it is possible to deduce whether players make inferences about each other and quantify their sophistication on the basis of choices in sequential games. This rests on comparing generative models of choices with, and without, inference. Model comparison is demonstrated using simulated and real data from a 'stag-hunt'. Finally, we note that exactly the same sophisticated behaviour can be achieved by optimising the utility function itself (through prosocial utility), producing unsophisticated but apparently altruistic agents. This may be relevant ethologically in hierarchal game theory and coevolution.
| S-EPMC2596313 | biostudies-literature
Project description:The analysis of variability in sport has shown significant growth in recent years. Also, the study of space management in the game field has not been object of research yet. The present study pretends to describe the variability in the use of strategic space in high performance football. To do this, the spatial management of the Spanish men's soccer team when it is in possession of the ball has been analyzed, during its participation in the UEFA Euro 2012 championship. Specifically, 6861 events have been collected and analyzed. Different zoning of the field have been used, and the location of the ball has been recorded in each offensive action. Using the observational methodology as a methodological filter, two types of analysis have been carried out: first, a General Linear Model was implemented to know the variability of the strategic space. Models with two, three, four and five variables have been tested. In order to estimate the degree of accuracy and generalization of the data obtained, the Generalizability Theory was implemented. Next, and in order to estimate the degree of accuracy and generalization of the data obtained, the Generalizability Theory was implemented. The results showed that the model that produces greater variability and better explanation is the four-variable model (P = 0.019; r 2 = 0.838), with the inclusion of the variables match half, rival, move initiation zone and move conclusion zone. Next, an optimization plan was implemented to know the degree of generalization with the Rival, Start Zone (SZ) and Conclusion Zone (CZ) facets. The available results indicate that it is based on an adequate research design in terms of the number of observations. The results of the present study could have a double practical application. On the one hand, the inclusion of the game's space management in training sessions will potentially conceal the true tactical intention. On the other hand, knowing the variability of the strategic space will allow to exploit areas of the optimal playing field to attack the rival team.
| S-EPMC7109332 | biostudies-literature
Project description:Knowledge transfer is the basis for R&D teams and enterprises to improve innovation performance, win market competition and seek sustainable development. In order to explore the path to promote knowledge transfer within the R&D team, this study considers the bounded rationality and risk preference of individuals, incorporates prospect theory into evolutionary game, constructs a perceived benefits matrix distinct from the traditional benefits matrix, and simulates the evolutionary game process. The results show that, R&D personnel's knowledge transfer decisions depend on the net income difference among strategies; only if perceived cost is less than the sum of perceived synergy benefit, perceived organization reward value, and perceived organization punishment value, can knowledge be fully shared and transferred within the R&D team. Moreover, R&D personnel's knowledge transfer decisions are interfered by the irrational psychological factors, including overconfidence, reflection, loss avoidance, and obsession with small probability events. The findings help R&D teams achieve breakthroughs in improving the efficiency of knowledge transfer, thereby enhancing the capacity of enterprises for collaborative innovation.
| S-EPMC10707606 | biostudies-literature