July 31-August 4, 2017
Many biologically motivated problems naturally call for the investigation and comparison of molecular variants, such as determining the mechanisms of specificity in biomolecular interactions or the mechanisms of molecular evolution. We consider a generalized ensemble algorithm for coarse-grained simulations of biomolecules which allows the thermodynamic behavior of two or more sequences to be determined in a single multisequence run. By carrying out a random walk in sequence space, the method also enhances conformational sampling. Escape from local energy minima is accelerated by visiting sequences for which the minima are shallower or absent. We test the method on an intermediate-resolution coarse-grained model for protein folding with 3 amino acid types and explore the potential for large-scale coverage of sequence space by applying it to sets of more than 1,000 sequences each. The resulting thermodynamic data is used to analyze the structures and stability properties of sequences covering the space between folds with different secondary structures. Besides demonstrating that the method can be applied to large number of sequences, the results allow us to carry out a more systematic analysis of the biophysical properties of sequences along mutational pathways connecting pairs of different folds than has been previously possible.
Please click Additional Files below to see the full abstract.
Adekunle Aina and Stefan Wallin, "Multisequence algorithm for coarse-grained biomolecular simulations: Exploring the sequence-structure relationship of proteins" in "Association in Solution IV", Ulf Olsson, Lund University, Sweden Norman Wagner, University of Delaware, USA Anand Yethiraj, Memorial University of Newfoundland, Canada Eds, ECI Symposium Series, (2017). http://dc.engconfintl.org/assoc_solution_iv/2