A population-based evolutionary search approach to the multiple minima problem in de novo protein structure prediction
© Saleh et al; licensee BioMed Central Ltd. 2013
Published: 8 November 2013
Elucidating the native structure of a protein molecule from its sequence of amino acids, a problem known as de novo structure prediction, is a long standing challenge in computational structural biology. Difficulties in silico arise due to the high dimensionality of the protein conformational space and the ruggedness of the associated energy surface. The issue of multiple minima is a particularly troublesome hallmark of energy surfaces probed with current energy functions. In contrast to the true energy surface, these surfaces are weakly-funneled and rich in comparably deep minima populated by non-native structures. For this reason, many algorithms seek to be inclusive and obtain a broad view of the low-energy regions through an ensemble of low-energy (decoy) conformations. Conformational diversity in this ensemble is key to increasing the likelihood that the native structure has been captured.
We propose an evolutionary search approach to address the multiple-minima problem in decoy sampling for de novo structure prediction. Two population-based evolutionary search algorithms are presented that follow the basic approach of treating conformations as individuals in an evolving population. Coarse graining and molecular fragment replacement are used to efficiently obtain protein-like child conformations from parents. Potential energy is used both to bias parent selection and determine which subset of parents and children will be retained in the evolving population. The effect on the decoy ensemble of sampling minima directly is measured by additionally mapping a conformation to its nearest local minimum before considering it for retainment. The resulting memetic algorithm thus evolves not just a population of conformations but a population of local minima.
Results and conclusions
Results show that both algorithms are effective in terms of sampling conformations in proximity of the known native structure. The additional minimization is shown to be key to enhancing sampling capability and obtaining a diverse ensemble of decoy conformations, circumventing premature convergence to sub-optimal regions in the conformational space, and approaching the native structure with proximity that is comparable to state-of-the-art decoy sampling methods. The results are shown to be robust and valid when using two representative state-of-the-art coarse-grained energy functions.
Obtaining a detailed structural characterization of the biologically-active (native) state of a protein molecule holds great promise for unraveling the relationship between protein structure and function and is key to our understanding and treatment of disease. Elucidating a representative three-dimensional structure of the protein native state, referred to as the native structure, is essential in structure-driven studies on engineering novel proteins, predicting protein stability, modeling interactions upon protein complexation, and designing effective drugs [1–9]. While experimental techniques, such as X-ray crystallography, nuclear magnetic resonance, and cryo-electron microscopy, are able to extract atomic coordinates of the native structure, these techniques are laborious, expensive, and have limitations either in the subset of proteins on which they can be applied or in the resolution and quality of their findings. As a result, they have not kept up with the exponential growth in protein sequences in the genome sequencing era . For instance, currently, only in about half of all well-characterized protein families do we have native structures for all family members . In light of this, computational approaches are necessary to model the protein native state.
When a protein of interest has sequence homologs among other proteins of known native structure, a template for its native structure can be easily obtained with homology-based methods. When this is not the case, the task falls on de novo approaches to compute the native structure mainly from knowledge of the protein's amino-acid sequence . The foundation of de novo approaches is due to Anfinsen's experimental demonstrations that the amino-acid sequence of a protein determines to a great extent the three-dimensional native structure where the sequence is biologically active . However, finding this structure among the various spatial arrangements, or conformations, that can be assumed by the chain of amino acids in a protein, remains a central challenge in computational structural biology [14, 15].
In the early days of de novo protein structure prediction, the operating assumption was to consider the protein native state to be a homogeneous conformational ensemble of negligible structural diversity. This justified disregard of entropy. Instead, the objective of many optimization techniques devised for de novo structure prediction became finding the global minimum of the potential energy surface (coined by Scheraga and colleagues as the Global Minimum Energy Conformation, or GMEC) . Finding the GMEC is an NP-hard problem, mainly because the size of the space of all possible conformations of a protein chain grows exponentially with the length of the chain . This makes deterministic or combinatorial search infeasible and demands instead powerful probabilistic search and optimization algorithms .
To add to the complexity, while the true protein energy surface is funnel-like, as illustrated in Figure 1(a), the actual surface probed with current potential energy functions, even state of the art ones, can be quite different. As Figure 1(b) illustrates, the energy surface available to a search algorithm is often weakly funneled, with many non-native states competing or even characterized by lower conformational energies than the native state . This surface is rich in local minima, many of which are artifacts introduced by inherent inaccuracies in computationally-feasible potential energy functions for protein systems .
The high dimensionality of the protein conformational space notwithstanding, the issue of multiple minima is particularly troublesome. To address this issue, frameworks for de novo structure prediction do not seek the GMEC. Instead, they aim to obtain a broad view of the low-energy regions in the probed energy surface through an ensemble of low-energy (decoy) conformations. Since this ensemble is expected to contain many non-native conformations with lower energies than native or near-native conformations (the term near-native aims to include conformations within the native basin), retaining conformational diversity in this ensemble is key to increasing the likelihood that the native state has been captured.
The predominant framework in de novo modeling is to split the task into two stages. Stage one obtains the decoy ensemble typically by launching multiple Metropolis Monte Carlo (MMC)  trajectories, each mapping some initial conformation (possibly sampled at random) to a local minimum. In order to obtain a diverse ensemble in a feasible amount of time, side chains are typically sacrificed at this stage, and a coarse-grained representation mainly of the backbone is employed instead for the protein chain. Once the decoy ensemble is obtained, the decoys are grouped by structural similarity through clustering-based techniques in order to remove redundancy and reduce the size of this ensemble for the next stage. Long heavy-duty energetic refinement in all-atom structural detailed is conducted in the second stage from each retained decoy. The hope is that if one of these is in the vicinity of the true native basin, heavy-duty refinement in the second stage will yield convergence to the native state [6, 24, 25, 25–29].
In this paper we present a novel stochastic optimization approach for decoy sampling in de novo protein structure prediction. The proposed approach is based on evolutionary computing (EC) to effectively address the high-dimensional protein conformational space and the rugged potential energy surface. Given the challenges, decoy sampling methods often draw inspiration from different fields. Typical stochastic optimization strategies to better navigate the conformational space include many enhancements of the basic MMC approach, such as simulated annealing, parallel tempering, local energy flattening, and more (cf. to Ref. ). Yet others build on evolutionary search approaches, such as Basin Hopping (BH)  and more . Indeed, many decoy sampling methods find their origins in the EC community. On the other hand, the most successful de novo structure prediction protocols nowadays incorporate domain-specific knowledge originating in the computational structural biology community. The most salient developments in this community include the design of both coarse-grained energy functions and protein chain representations and the use of the molecular fragment replacement technique to simplify the conformational space and energy surface.
It is natural to propose an evolutionary search approach for decoy sampling. Evolutionary Algorithms (EA) are powerful stochastic optimization algorithms proposed by the EC community to address difficult search and optimization problems. Some preliminary work has been conducted in this community on de novo protein structure prediction [32–38]. In many of these studies, an EA explores the protein conformational space by evolving a representative set or population of conformations towards lowest potential energy. A Memetic EA (MEA) combines the global EA search with a short minimization phase. In MEA, each move at the global level is accompanied by a projection to a nearby local minimum, effectively allowing the algorithm to explicitly probe local minima in a rugged energy surface. However, the majority of EAs devised for decoy sampling fail to make use of state-of-the-art domain-specific techniques, such as coarse graining and molecular fragment replacement. These techniques have been proven effective in the computational structural biology community, though in the context of MMC-based methods. In addition, in current EAs for de novo structure prediction, the predominant goal is to find the GMEC rather than examine how well the native structure is actually recovered. As a result, studies employing evolutionary strategies and EAs for de novo structure prediction are typically restricted to applications on very small molecules or toy models.
In this paper we propose an evolutionary search approach to address the multiple-minima problem in decoy sampling for de novo structure prediction. Two population-based EAs are presented that follow the basic approach of treating conformations as individuals in an evolving population. The contribution of the work presented here is two-fold. The first contribution is the combination of evolutionary search strategies with state-of-the-art coarse-grained representations, sophisticated energy functions, and the molecular fragment replacement technique. Our results make the case that such combination allows a rather basic EA to generate useful decoys for the first stage of de novo structure prediction and not be limited to toy models. Indeed, the domain of applications is extended to small- to medium-size proteins, and results are shown to be comparable to other popular decoy sampling methods in computational structural biology.
We conduct a detailed analysis and show in realistic case studies that the simple EA is highly exploitative. While it may sample conformations in proximity to the native structure, the greedy nature of the algorithm makes it prone to converge prematurely to sub-optimal minima. This conclusion further makes the case that, while traditional optimization algorithms in the EC community focus on finding the GMEC, this goal is not sufficient in the context of de novo structure prediction. Moreover, it is now well understood that even state of the art energy functions for protein modeling allow reconstructing energy surfaces where near-native conformations are often not associated with the lowest-energy minima [21, 22]. The issue has been well-studied in the computational structural biology community [39, 40] and is the main reason why de novo structure prediction methods aim to obtain a broad view of the energy surface by generating many structurally-diverse low-energy decoys.
Therefore, a second contribution of this paper is to propose an MEA to obtain a diverse ensemble of low-energy decoys that represent low-energy minima in the protein energy surface. Here we show that the MEA is capable of retaining structural diversity in its decoy ensemble. Our analysis shows that the MEA is less prone to convergence than the EA. The results are shown to be robust and valid when guiding the algorithms with two representative coarse-grained energy functions commonly used in state-of-the-art de novo structure prediction protocols.
We note that a preliminary implementation of the algorithms proposed here have been presented in . In this work we present a more general setup for the algorithms and conduct a more detailed analysis, part of which additionally compares guidance by two state-of-the-art energy functions.
The rest of this paper is organized as follows. In the Methods section we describe the proposed EA and MEA. Results presented in the Results section show how the addition of a minimization step in MEA improves the ability to sample conformations near the native state. Analysis also quantifies the diversity of the decoy ensemble obtained through the MEA over that obtained through the EA. The employment of two different coarse-grained energy functions allows drawing interesting observations on current energy functions and their ability to guide an algorithm of enhanced sampling capability to the native basin. Results are finally compared to those obtained by representative MMC-based methods developed by us and others for decoy sampling. Findings and future research directions are summarized in the Conclusions section.
Since the evolutionary search approach proposed here makes use of two important developments in the de novo structure prediction community - the use of coarse graining (and coarse-grained energy functions to operate on coarse-grained conformations) and the molecular fragment replacement technique - these are summarized first. We then discuss the main ingredients of our approach followed by details of the EA and MEA proposed in this paper. We note that a preliminary version of this work has appeared in . While we reserve greatest detail for novel algorithmic components presented in this work, we summarize the entire method for the sake of completeness.
As is commonly done in de novo structure prediction, the representation employed here mainly models the backbone of a protein chain and largely sacrifices structural details of the side chains in interest of efficiency. This approach relies on the availability of accurate and fast side-chain packing techniques [42, 43] that are then able to pack side chains on promising coarse-grained decoys before the longer refinements in the second stage of de novo protocols. Since two different state-of-the-art coarse-grained energy functions are considered and compared here for their ability to guide the search to near-native conformations, two slightly different coarse-grained representations are used in each setting. In both cases, the N, C, C α , and O heavy backbone atoms are modeled explicitly. When using AMW, side-chains are represented only with their C β atom (except for glycine). When using Rosetta, a side chain is represented with a pseudo-atom at its centroid.
Both coarse-grained energy functions operate on cartesian coordinates of modeled atoms to associate a potential energy value or score with a conformation. The internal representation employed by the algorithms proposed here is angular and maintains only three backbone dihedral angles (φ, ψ, ω) per amino acid. This is also known as a kinematic model and is based on the idealized geometry assumption, which fixes bond lengths and angles to idealized (native) values (taken from CHARMM22 ) and limits variations to backbone dihedral angles. The summary of the molecular fragment replacement technique below describes how this representation is used to obtain conformations. After a conformation is obtained in its angular representation, forward kinematics is employed to obtain cartesian coordinates for the modeled atoms from the backbone dihedral angles . This angular representation is commonly used in de novo structure prediction protocols, including Rosetta , and is an efficient representation that reduces the dimensionality of conformational space to 3n dimensions for a chain of n amino acids.
Coarse-grained potential energy function
Our experiments in this paper consider two state-of-the-art coarse-grained energy functions, a modified version of the Associative Memory Hamiltonian with Water (AMW), and the Rosetta energy function, described below.
AMW energy function
AMW has been originally proposed in . It has been used in its original form and in adaptations by us and others in the context of MMC-based decoy sampling methods [24, 48–56]. Our adaptation of AMW sums 5 non-local terms (local interactions are not modeled, as bond lengths and bond angles are kept at ideal values under the idealized geometry assumption): EAMW = ELennard− Jones+ EH− Bond+ Ecompaction + Eburial + Ewater. The ELennard− Jonesenergy term is implemented after the 12-6 Lennard-Jones potential in AMBER9  allowing a soft penetration of van der Waals spheres. The EH− Bondterm allows modeling hydrogen bonds and is implemented as in . The other terms, Ecompaction, Eburial, and Ewater, allow formation of a hydrophobic core and water-mediated interactions (we direct the reader to Ref.  for further details on this potential energy function).
Rosetta energy function
The second coarse-grained energy function we employ here corresponds to the score3 setting in the suite of energy functions used in the Rosetta de novo protocol and package . The different energy functions used in the actual Rosetta de novo protocol are scaled versions of a full energy function. The full function is a linear combination of 10 terms that measure repulsion, amino-acid propensities, residue environment, residue pair interactions, interactions between secondary structure elements, density, and compactness. The different substages used in the Rosetta protocol use subsets of the terms of the full energy function and modify weights in the linear combination to gradually promote certain interactions over others in the course of the protocol. We use here the score3 setting, as this corresponds to the full coarse-grained Rosetta energy function.
Molecular fragment replacement technique
The employment of the molecular fragment replacement technique originates in . In the context of an evolutionary search approach, this technique is used as follows. A residue position i is sampled uniformly at random over the chain of the parent conformation. A fragment [i, i + 2] of 3 consecutive amino acids is then defined over the chain. The 9 φ, ψ, ω backbone dihedral angles corresponding to this fragment in the parent conformation are then replaced with a configuration of 9 angles sampled uniformly at random over configurations recorded for that fragment in a fragment configuration library. The library stores fragment configurations extracted from known protein native structures. Therefore, the modifications are more likely to result in physically-realistic child conformations. More details on the construction of fragment configuration libraries can be found in .
Overview of main ingredients in the proposed evolutionary search approach
The basic EA is shown in pseudo-code in Algorithm 1. In summary, an evolutionary computing model is employed for optimization of a given protein energy function (fitness function). Under this framework, conformations are ever-improving solutions of the fitness function. A given and fixed number PopSize of conformations are stored in a population P, which is initialized to consist of random conformations for a given protein sequence α at generation 0 (line 1 in Algorithm 1). P evolves over a series of iterations or generations to obtain better solutions to the fitness function (lines 2-6). We note that in the typical EA, the goal is to maximize fitness. Since here the fitness function is potential energy, the goal is to minimize fitness. In this work, we maintain a constant capacity PopSize through each generation for the evolving population P. As line 3 shows, the conformations in the current generation serve the role of parents to generate new child conformations C. Parents and children compete for survival (line 4). Comparison of fitness values is used for this purpose. Surviving conformations make up the evolved population in the next generation and are added to the running ensemble Ω α of (decoy) conformations analyzed in the Results section. We now relate details on each of the components of the basic EA and its modification to obtain the MEA that additionally incorporates minimization.
Algo. 1 Algorithm 1: Pseudo code is shown for a canonical EA
Input: Amino acid sequence, population size, and number of offspring as α, PopSize, and NumChild.
Output: the set of sampled of conformations, Ω α
1: P ← INITIAL POPULATION(PopSize)
2: while Eval count < Eval max do
3: C ← SAMPLE CONFORMATIONS(P, NumChild)
4: P new ← SELECT POPULATION(P, C)
5: Ωα ← Ωα ∪ P new
6: P ← P new
A basic EA to sample low-energy protein conformations
In each generation in the basic EA, parent conformations are first selected from the current population P. Fitness-proposal selection is used, whereby a linear weighting of fitness values (energy functions) is used to associate a higher probability of selection to conformations with lower energies. The selected parent conformations are then modified through the molecular fragment technique summarized above to obtain NumChild child conformations. The result of this process over the generations is that lower-energy conformations will be selected more often to spawn children (a parent can be selected more than once).
The basic EA summarized in pseudo-code in Algorithm 1 evolves a fixed-size population P. To select a new population P new , the current population P is combined with the set of newly-sampled children C. Truncation selection is then used to reduce the merged set back to |P| conformations. In truncation selection, conformations are ordered according to their fitness values (energy values here), and the |P| conformations with the lowest energies are selected to constitute the next population. This selection technique is highly exploitative.
The molecular fragment replacement technique summarized above is employed to modify selected parent conformations to obtain child conformations. The technique is also used to provide the EA with a diverse set of low-energy conformations in its initial population at generation 0. Starting from an extended conformation, n − 2 fragment configuration replacements are conducted over the protein chain to obtain a random but realistic conformation. This process is repeated |P| times to effectively obtain |P| conformations that constitute the initial population and thus seed the basic EA.
A memetic EA to sample local minima
As described, the basic EA conducts a highly exploitative search, progressing towards lower-energy conformations in pursuit of the GMEC. As discussed in the Background section, the goal in de novo structure prediction is instead to search for a diverse set of sufficiently low-energy decoy conformations rather than the absolute minimum due to approximations and resulting inaccuracies in calculations of potential energy. Due to this exploitative nature, the population of decoys (all child conformations in growing ensemble) in the basic EA risks premature convergence to narrow low-energy basins that may be far from the native state in conformational space. As a result, further exploration and discovery of useful decoy conformations can be severely limited in further generational propagation in the basic EA.
We investigate an MEA to enhance sampling of near-native decoy conformations. The MEA allows for explicit sampling of local minima in the protein energy surface. An additional minimization step is employed in the MEA to map a child conformation sampled by the basic EA to a nearby local minimum. We employ an efficient greedy local search to implement the minimization step. The greedy search performs a series of fragment replacements only accepting modifications that decrease potential energy. This continues until n consecutive fragment replacements are rejected (n is the length of the target protein), effectively indicating that a local minimum has been reached. The resulting conformation representing the minimum replaces the initial conformation and is added to the set Pnew of child conformations.
Child conformations that survive the truncation selection and therefore become members of the evolved population in the next generation are representatives of local minima in the energy surface. In the next iteration, some of them may be selected to be parents. When that happens, a fragment configuration replacement applied to one of them (that is part of the process to generate new children) is equivalent to a jump out of the current minimum represented by the parent conformation. This resetting is crucial to obtain new nearby minima in the energy surface and so reduce the exploitative nature of the basic EA. The resetting helps enhance conformational diversity in the MEA, as it essentially jumpstarts the exploration with new starting points for the ensuing minimization.
The definition of a local minimum employed here approximates a true local minimum in the energy surface. Previous work in the context of a basin hopping trajectory [54, 60] shows that, at a coarse-grained level of detail, this working definition is sufficient to sample low-energy decoy conformations near the native state.
We further note that the number of generations in either the basic EA or MEA are not fixed a priori. Instead, each algorithm runs for a fixed budget of energy evaluations. In the memetic version, each energy evaluation within the minimization contributes to the overall count of energy evaluations in the fixed budget.
Analysis of structural diversity in conformational ensembles
While the majority of the analysis detailed in the Results section employs energy values and proximity of computed decoys to the known native structure, the ensembles obtained through the EA and MEA are directly compared to each other employing a simple lRMSD-based measure. Essentially, pairwise lRMSDs between any two conformations in a given population are computed, and the median lRMSD measuring the structural diversity in the population is recorded. The median lRMSD is then plotted in the Results section over all populations in the EA versus the MEA algorithm to visualize how structural diversity is retained or lost by any of these algorithms.
The basic EA and MEA are each run on a testbed of 15 protein sequences with known native structures. The results presented below focus on comparing the sampling ability between the two algorithms with respect to obtained lowest energy and proximity to the native structure. Results obtained by MEA are compared to three other state-of-the-art MMC-based methods. Finally, the results obtained by the MEA using the AMW energy function are compared with those obtained using the Rosetta score3 energy function. The results show that the incorporation of domain-specific knowledge in EA makes this simple algorithm competitive. However, the addition of the minimization step in MEA significantly improves the ability to sample near-native conformations and makes MEA competitive to other state-of-the-art decoy sampling methods. Moreover, when using the Rosetta over the AMW energy function, the results improve further for a large subset of proteins.
We set population size |P| to be 1000 conformations. This is large enough to maintain a structurally-diverse population but small enough to ensure competition among members in a population. In MEA, the number of child conformations sampled at each generation, numChild, is set at 250. Note that this is less than population size, which allows limiting competition among children and in turn increasing the percentage of children that survive and are passed on to the next generation. In the basic EA, numChild = 4000. Since EA does not minimize each conformation, the majority of children tend to have high potential energies. Generating a larger number of children in the basic EA increases the chance of obtaining some low-energy children, and in turn allowing for downward exploration of the energy surface with each generation.
We execute each algorithm 3 times, each time using a fixed budget of 10 million energy evaluations. The purpose for fixing this budget rather than number of generations is as follows. The most computationally intensive task that takes up more than 90% of runtime of either EA or MEA is the calculation of potential energy for each conformation.
By fixing the number of such evaluations we maintain a fair comparison between the algorithms and across a broad range of target protein systems. In practice, depending on the length of the target protein, each experiment takes 30− 50 hours of CPU time on a 2.4Ghz Core i7 processor.
The majority of the analysis below that compares which algorithm comes closer to the native structure or how often it does so relies on calculating the least Root Mean Square Deviation (lRMSD) to the known native structure for each conformation in the output ensemble Ω α (Ω α is the union of the populations in each generation). lRMSD stands for least RMSD, because it is preceded by an alignment step that finds a rigid-body transformation minimizing the RMSD between two conformations post alignment. Post-alignment RMSD is measured as a weighted Euclidean distance, summing distances between corresponding C α atoms. While not a Euclidean metric, lRMSD is a dissimilarity metric. A lower lRMSD value between a conformation and the sought native structure means that the conformation is closer to the native structure. A higher lRMSD, however, does not necessarily mean significant structural differences, as lRMSD is not able to recognize when structural differences are limited to a particular segment in the protein chain. We additionally note that lRMSD grows with chain size. However, for the purpose de novo structure prediction, lower-lRMSD conformations are more likely to be near-native than higher-lRMSD ones. When using coarse-grained representations and energy functions, a conformation with lRMSD 4 − 5Å from the native structure is considered to have captured that structure.
Target systems of study
Columns 2 − 4 show the native PDB ID, number of amino acids and fold topology for each of the 15 target protein systems.
Native PDB ID
Effectiveness of minimization in MEA over EA
This analysis compares the sampling capability of EA versus MEA when using the same energy function, AMW. In addition to a comparison in terms of a summary statistic, such as the best proximity (lowest lRMSD) to the native structure, the actual conformational ensembles are compared in terms of distributions of energy and lRMSDs to the native structure. A direct comparison is made between the two algorithms in terms of a measure of conformational diversity.
Comparison of lowest lRMSDs reached
The lowest lRMSD to the known native structure over conformations in the output ensemble Ω α is reported for the 15 target protein systems.
Native PDB ID
Avg(Min) Lowest lRMSD (Å)
EA - AMW
MEA - AMW
MEA - Rosetta
Comparison of distributions of energies and lRMSDs in sampled decoy ensembles
Figure 3 shows that EA is able to reach much lower-energy levels than MEA. This is expected, because EA tends to converge to a few basins in the energy surface and then continues to optimize them through a highly exploitative search. In contrast, MEA tends to capture a broader view of the energy surface due to its restart mechanism described in the Methods section, which prevents it from prematurely converging to a few deep basins. This is advantageous, as many low-lRMSD conformations are associated with low energies but do not necessarily populate the lowest-energy regions in an energy surface. In fact, a growing body of research shows that many deep minima in a protein energy surface are artifacts due to the coarse-grained energy function employed and are populated by non-native conformations [39, 40, 49, 63, 64].
Figure 3 also shows that MEA yields more conformations with low lRMSDs to the native structure. On the majority of proteins, the distribution is shifted to the left, towards lower lRMSDs. A direct comparison of lRMSDs to the native structure is drawn through a histogram analysis.
Figures 4, 5 show the distribution of lRMSDs to the native structure over the entire Ω ensemble (shown left) and the distribution over the reduced Ωp 95ensemble (shown right). MEA and EA are directly compared in each setting. The distributions for EA are drawn using a solid red line, and those for MEA are drawn using a dashed blue line. Comparison of the distribution of lRMSDs over the entire Ω ensemble shows that low-lRMSD conformations can be found at higher-energy regions. However, focusing only on the Ωp 95ensemble consistently shows that MEA not only finds the lowest-lRMSD conformation over EA, but also samples significantly more low-lRMSD conformations than the simple EA. For 2 target proteins (1hz6A and 2ezk), the baseline EA gets lucky in one of the three runs and converges to an energy basin containing low-lRMSD conformations to the native structure. Figure 5(e)-(f) for PDB id 2ezk illustrates the rare case when the simple EA samples more low-lRMSD conformations than MEA. These results confirm that, while the simple EA can occasionally get lucky, MEA is, on average, more effective at enhancing sampling of decoy conformations near the native state. We note that a direct comparison is also drawn in Figures 4.4, 5 between MEA with AMW and MEA with Rosetta. We delay this until the comparative analysis between EA and MEA is completed in the fixed setting of one energy function, AMW.
Comparison of structural diversity in sampled decoy ensembles
Figure 6 shows that the median pairwise lRMSD drops sharply in EA, and converges quickly to very low values. This effectively means that the population of conformations in EA loses structural diversity rather fast and never recovers. The loss of structural diversity further confirms the characterization of the behavior in EA, which greedily converges its exploration to a few energy basins. On the other hand, the median pairwise lRMSD in MEA does not experience such a sharp drop. Moreover, the structural diversity per population remains above 10Å in all subsequent populations. This suggests that MEA, due to its restart mechanism, maintains a broader view of the conformational ensemble. Coupled with the minimization component, this analysis further confirms that MEA is more appropriate at obtaining diverse decoy conformations that represent local minima in the energy surface. Effectively, MEA obtains a broad discrete representation of the energy surface relevant for the native state in terms of local minima.
Rosetta vs. AMW energy function
Incorporating the Rosetta energy function allows drawing a direct comparison between two state-of-the-art coarse-grained energy functions in the context of a probabilistic search algorithm demonstrated by the above analysis to have high sampling capability. We first focus on comparing the lowest lRMSD values reached by MEA under each energy function and then provide more detail by comparing the ensembles in terms of distributions of lRMSDs to the native structure and distributions of lRMSDs versus energies.
Table 2 shows in column 5 the average and minimum value for the lowest lRMSD to the native structure obtained over 3 independent runs of MEA with the Rosetta energy function. Comparison of the results shown in column 4, which correspond to MEA with AMW, to those shown in column 5 for MEA with Rosetta demonstrates that the Rosetta energy function decidedly improves proximity to the native structure over AMW. Even when focusing on the average lowest lRMSDs, MEA with the Rosetta energy function obtains lower values than MEA with AMW on 9 of the 15 protein systems. On some proteins, the improvement is substantial. For instance, on proteins with native PDB ids 1bq9, 1sap, 1hz6a, 2ci2, and 1tig, the improvement is anywhere from 1 to 3Å, depending on whether one focuses on the average or minimum lowest lRMSDs obtained over 3 runs. Dramatic improvements by 3− 4Å over average or minimum lowest lRMSDs are obtained on proteins with PDB ids 1hz6A and 1tig when using the Rosetta energy function in MEA. We note that all the proteins where the Rosetta energy function allows MEA to get closer to the native structure are of α/β native folds.
Closer inspection of the results in Table 2 shows that the only proteins were the AMW energy function seems to have an advantage are those that entirely or almost entirely consist of α-helices, like proteins with native PDB ids 1ail, 1isua, and 1cc5. This observation supports recent studies showing AMW seems well-equipped to capture the basin of all-α proteins but finds other topologies hard [56, 65, 66].
It is interesting to note that, unlike the EA and MEA with AMW, the MEA with Rosetta sometimes results in a run that reaches a lowest lRMSD substantially lower than the other runs. This trend seems to indicate that the Rosetta energy function is more attuned to the true energy landscape, possibly allowing the exploration of more areas. This also suggests that the Rosetta energy surface is more complex than AMW and can benefit from further sampling. Lastly, a large practical advantage of using the Rosetta energy function is that it is much less costly in terms of computational time, thus allowing for more exploration. This is a result of significant fine tuning of this function in the Rosetta package over the years. In the interest of a fair comparison in this paper, however, the number of energy evaluations with AMW and Rosetta were kept equivalent.
The point on the similar inaccuracies on the AMW and Rosetta energy functions is made further through a more detailed comparative histogram-based analysis on the distribution of lRMSDs. Figures 4, 5 compare the distribution of lRMSDs obtained through MEA with the Rosetta energy function (dotted green line) to the distributions obtained with MEA and EA with the AMW energy function (red and blue lines). Taken together, comparison of lRMSDs allows making a few observations. First, employing the Rosetta energy function allows the MEA to enhance the population of low-lRMSD conformations (note, in particular, on proteins with native PDB ids 1isuA, 1dtjA, 1tig, and 2ezk). However, when focusing only on the Ωp 95ensemble, more low-lRMSD conformations are discarded when using Rosetta than the AMW energy function. These results show that the two energy functions are similarly inaccurate. While the Rosetta energy function may improve proximity to the native structure on certain folds, its energy surface, like that of AMW, contains many other deep non-native minima that would be retained if an energy-based selection scheme is used to reduce the decoy ensemble. This observation explains why many de novo protocols, including Rosetta, prefer to reduce decoy ensembles with clustering-based techniques that group decoys by structural similarity, employing the rule that an energy function may be better at preserving the width rather than the depth of the native basin.
Comparison of proposed evolutionary search approach to state of the art
We now place the EA and MEA in context, comparing them to other decoy sampling methods in de novo structure prediction. Since we do not have access to the actual conformational ensembles produced by these methods, and lowest lRMSD to the native structure is routinely used as a measure of performance of these methods, we limit the comparison to lowest lRMSDs. All three methods chosen for comparison are MMC-based. While FeLTr  integrates local MMC searches into a centralized tree search structure, attempting to balance between proximity to the native structure and coverage of conformational space, the other two methods, ItFix  and EDAFold , try to gradually reduce the search space during the execution of the algorithm. All methods use molecular fragment replacement (with a slight variation in ), and both ItFix and EdaFold reduce the fragment configuration libraries based on distributions of fragment configurations observed among sampled conformations. In particular, EdaFold is an adaptive estimation of distribution method, updating probabilities over fragment configurations. FeLTr uses the same AMW energy function employed for our EA and MEA, and EDAFold  uses the Rosetta score3 energy function. ItFix uses the DOPE energy function .
Table 2 shows the lowest lRMSDs reported by FeLTr, ItFix, and EdaFold in columns 6− 8 respectively. While FeLTr is an in-house method which we can apply to all protein systems studied here, we only have access to published results on a subset of these systems by the other two methods. N/A values in columns 7 and 8 indicate the lack of a result on a particular protein system. In addition, the reported values for EA, MEA, and FeLtr are the average and minimum over lowest lRMSDs obtained over 3 independent runs of each method, whereas the values reported for ItFix and EdaFold are only lowest lRMSDs published.
Comparing column 4 to column 6 of Table 2 shows that MEA substantially (≥ 0.5Å) outperforms Feltr on 10 protein systems. We limit our comparison to results obtained by the MEA with AMW rather than Rosetta in the interest of a fair comparison. On 5 proteins (with native PDB ids 1bq9, 1dtjA, 1tig, 2ci2, 2ezk), MEA reaches an lRMSD to the native structure lower than 1.5Å compared to FeLTr, while FeLTr outperforms MEA only on one protein (with native PDB id 1c8cA). This suggests that the minimization step in MEA provides a distinct advantage over FeLTr, particularly in the case of longer α-helix and α/β proteins. We note this comparison was limited to MEA with AMW.
Comparing column 4 to column 7 in Table 2 shows that MEA performs comparably to ItFix. MEA finds lower or comparable lRMSDs for 6 of the 11 proteins where ItFix results are available, while ItFix finds lower lRMSDs for 2 proteins. These results are promising, as they show that employing a short greedy local search for minimization can make even a simple EA algorithm competitive for decoy sampling. Finally, comparison of columns 5 and 8 between MEA with the Rosetta energy function and EdaFold for four available proteins shows that EdaFold has a slight advantage over MEA. On two systems (with native PDB ids 1bq9 and 2ci2), the lowest lRMSD reported by EdaFold is not more than 1Å lower than the lowest lRMSD reported by MEA with Rosetta. For the system with native PDB id 1tig, MEA with Rosetta reaches a lower lRMSD than EdaFold does. Overall, by highlighting in bold the lowest lRMSD obtained by any of the methods in Table 2, one can see that the lowest lRMSD is obtained by the MEA algorithm (whether the AMW or the Rosetta energy functions are used) for 9 of the 15 protein systems. While the settings are different in terms of runtime and conformational ensembles in the methods used for comparison, this comparative analysis suggests that MEA is a powerful decoy sampling method, and further enhancements, such as estimation distribution in EdaFold, are worth pursuing.
This work proposes an evolutionary search approach for decoy sampling in de novo protein structure prediction. Incorporation of state-of-the-art techniques, such as coarse graining and molecular fragment replacement, shows that even a simple EA results in decoy ensembles in good proximity to the known native structure on an extensive list of proteins. The simple EA is shown effective at optimizing a given coarse-grained energy function and reaching deep minima. However, as our analysis shows, the simple EA is highly exploitative, rapidly converging on a few basins in the protein energy surface. Once converged, the EA keeps exploiting, or drilling down in the energy surface, without making any progress towards the native structure. Conformations near the native structure are only achieved if the EA converges to a basin that happens to be near the native state.
The MEA proposed in this work remedies some of the issues of the simple EA for sampling local minima in the protein energy surface. The results show that the addition of the minimization step allows the algorithm to more effectively sample near-native conformations than a canonical simple EA. MEA is shown to be less exploitative than the simple EA. This is largely due to the additional minimization step, implemented as a greedy local search. The analysis presented above shows that the MEA quickly reaches a low-energy floor, but then uses the remaining budget to explore a breadth of conformations around that energy level while gradually reducing potential energy. This behavior is due to the fact that the greedy local search does not probe too deeply before a fragment replacement allows it to escape the current local minimum and jump to a new higher-energy conformation. Additionally, the effective moves in MEA are much larger (in terms of distance between local minima) and tend to result in similar energies. The result is that it is less likely for the entire population to converge as in the simple EA; hence, MEA is able to better maintain structural diversity in the population.
The decoy ensembles obtained through the two algorithms are compared directly in terms of structural diversity. The comparison shows that the MEA ensemble is more structurally diverse. By retaining more diversity, the MEA passes along more information to a de novo structure prediction protocol and increases the likelihood of retaining the native basin for the ensuing refinements.
Analysis of MEA also shows that the additional minimization step along with domain-specific techniques from the computational structural biology community result in evolutionary search strategies that are comparable to other state-of-the-art decoy sampling methods in the context of de novo structure prediction. High sampling capability, as attested by the structural diversity in the decoy ensemble in the MEA, is an important characteristic that makes MEA-based algorithms appealing for de novo structure prediction. Future work will investigate enhancements over the MEA proposed here to encourage greater diversity, both from an energetic and geometric point of view.
It is important to note that the consideration of two state-of-the-art energy functions illustrates the robustness and validity of the results and the conclusions in this work with respect to the comparison between MEA and EA and the comparison of these two algorithms to other ones used for decoy sampling. In particular, the elucidation of many non-native minima, particularly by MEA, shows two things. First, MEA is an algorithm with high sampling capability, a hallmark of which is exposure of non-native minima in coarse-grained energy functions [39, 40, 63]. Secondly, both AMW and Rosetta contain such artifacts. Comparative analysis between the results obtained under each of these energy functions shows that both are similarly inaccurate. Both functions guide MEA towards similar proximities to the known native structure. In agreement with other MMC-based studies, AMW seems to capture all-α native topologies better than other ones, whereas Rosetta seems to provide some improvement over AMW when β sheets are present.
Due to its enhanced sampling, MEA can be employed to further address current deficiencies in de novo structure prediction. For instance, the diverse decoys can be used for further development and fine tuning of coarse-grained energy functions to improve recognition and discrimination of non-native topologies. More-over, exploration capability can be increased by equipping the MEA with crossover operators, as in , or by replacing the energy guidance with multi-objective optimization as in [68, 69].
This work is supported in part by NSF CCF No. 1016995 and NSF IIS CAREER Award No. 1144106. We thank members of the Shehu lab for their valuable comments on this work and the Mason OSCAR program supporting undergraduate research for a fellowship to SS during the initial phases of this project.
The publication costs for this article were funded by the corresponding author AS through NSF Grant Nos. 1016995 and 1144106.
This article has been published as part of BMC Structural Biology Volume 13 Supplement 1, 2013: Selected articles from the Computational Structural Bioinformatics Workshop 2012. The full contents of the supplement are available online at http://www.biomedcentral.com/bmcstructbiol/supplements/13/S1.
- Neidigh JW, Fesinmeyer RM, Andersen NH: Designing a 20-residue protein. Nat Struct Biol 2002, 9(6):408–410. 10.1038/nsb0602-408View ArticleGoogle Scholar
- Mucsi Z, Gaspari Z, Orosz G, Perczel A: Structure-oriented rational design of chymotrypsin inhibitor models. Protein Eng 2003, 16(9):673–681. 10.1093/protein/gzg090View ArticlePubMedGoogle Scholar
- Wong CF, A MJ: Protein simulation and drug design. Adv Protein Chem 2003, 66: 87–121.View ArticlePubMedGoogle Scholar
- Kuhlman B, Dantas G, Ireton GC, Varani G, Stoddard BL, Baker D: Design of a novel globular protein fold with atomic-level accuracy. Science 2003, 302(5649):1364–1368. 10.1126/science.1089427View ArticlePubMedGoogle Scholar
- Smith GR, Sternberng MJE, Bates PA: The relationship between the exibility of proteins and their conformational states on forming protein-protein complexes with an application to protein-protein docking. J Mol Biol 2005, 347(5):1077–1101. 10.1016/j.jmb.2005.01.058View ArticlePubMedGoogle Scholar
- Bradley P, Misura KM, Baker D: Toward high-Resolution de novo structure prediction for small Pro- teins. Science 2005, 309(5742):1868–1871. 10.1126/science.1113801View ArticlePubMedGoogle Scholar
- Yin S, Ding F, Dokholyan NV: Eris: an automated estimator of protein stability. Nat Methods 2007, 4(6):466–467. 10.1038/nmeth0607-466View ArticlePubMedGoogle Scholar
- Kortemme T, Baker D: Computational design of protein-protein interactions. Curr Opin Chem Biol 2004, 8: 91–97. 10.1016/j.cbpa.2003.12.008View ArticlePubMedGoogle Scholar
- Craik DJ, Cemazar M, Daly NL: The cyclotides and related macrocyclic peptides as scaffolds in drug design. Curr Opin Drug Discov Devel 2006, 9(2):251–260.PubMedGoogle Scholar
- Lee D, Redfern O, Orengo C: Predicting protein function from sequence and structure. Nat Rev Mol Cell Biol 2007, 8(12):995–1005. 10.1038/nrm2281View ArticlePubMedGoogle Scholar
- Finn RD, Mistry J, Tate J, Coggill P, Heger A, Pollington JE, Gavin OL, Gunasekaran P, Ceric G, Forslund K, Holm L, Sonnhammer EL, Eddy SR, Bateman A: The Pfam protein families database. Nucleic Acids Res 2010, 38: D211-D222. 10.1093/nar/gkp985PubMed CentralView ArticlePubMedGoogle Scholar
- Moult J, Fidelis K, Kryshtafovych A, Tramontano A: Critical assessment of methods of protein structure prediction (CASP)--round IX. Proteins 2011, 79(Suppl 10):1–5.PubMed CentralView ArticlePubMedGoogle Scholar
- Anfinsen CB: Principles that govern the folding of protein chains. Science 1973, 181(4096):223–230. 10.1126/science.181.4096.223View ArticlePubMedGoogle Scholar
- Dill KA, Ozkan B, Shell MS, Weikl TR: The protein folding problem. Annu Rev Biophys 2008, 37: 289–316. 10.1146/annurev.biophys.37.092707.153558PubMed CentralView ArticlePubMedGoogle Scholar
- Shehu A: Conformational search for the protein native state. In Protein Structure Prediction: Method and Algorithms. Edited by: Rangwala H, Karypis G, Fairfax, VA. Wiley Book Series on Bioinformatics; 2010.Google Scholar
- Dill KA, Chan HS: From Levinthal to pathways to funnels. Nat Struct Biol 1997, 4: 10–19. 10.1038/nsb0197-10View ArticlePubMedGoogle Scholar
- Onuchic JN, Wolynes PG: Theory of protein folding. Curr Opin Struct Biol 2004, 14: 70–75. 10.1016/j.sbi.2004.01.009View ArticlePubMedGoogle Scholar
- Li SHA Z: Monte Carlo-minimization approach to the multiple-minima problem in protein folding. Proc Natl Acad Sci USA 1987, 84(19):6611–6615. 10.1073/pnas.84.19.6611View ArticleGoogle Scholar
- Hart WE, Istrail S: Robust proofs of NP-hardness for protein folding: general lattices and energy potentials. J Comput Biol 1997, 4: 1–22. 10.1089/cmb.1997.4.1View ArticlePubMedGoogle Scholar
- Shehu A: Probabilistic Search and Optimization for Protein Energy Landscapes. In Handbook of Computational Molecular Biology. Edited by: Aluru S, Singh A. Chapman & Hall/CRC Computer & Information Science Series; 2013.Google Scholar
- Verma A, Schug A, Lee KH, Wenzel W: Basin hopping simulations for all-atom protein folding. J Chem Phys 2006, 124(4):044515. 10.1063/1.2138030View ArticlePubMedGoogle Scholar
- Hornak V, Abel R, Okur A, Strockbine B, Roitberg A, Simmerling C: Comparison of multiple Amber force fields and development of improved protein backbone parameters. Proteins 2006, 65(3):712–725. 10.1002/prot.21123View ArticlePubMedGoogle Scholar
- Metropolis N, Rosenbluth AW, Rosenbluth MN, Teller AH, Teller E: Equation of state calculations by fast computing machines. J Chem Phys 1953, 21(6):1087–1092. 10.1063/1.1699114View ArticleGoogle Scholar
- Shehu A, Kavraki LE, Clementi C: Multiscale characterization of protein conformational ensembles. Proteins 2009, 76(4):837–851. 10.1002/prot.22390PubMed CentralView ArticlePubMedGoogle Scholar
- Bonneau R, Baker D: De novo prediction of three-dimensional structures for major protein families. J Mol Biol 2002, 322: 65–78. 10.1016/S0022-2836(02)00698-8View ArticlePubMedGoogle Scholar
- Brunette TJ, Brock O: Guiding conformation space search with an all-atom energy potential. Proteins 2008, 73(4):958–972. 10.1002/prot.22123PubMed CentralView ArticlePubMedGoogle Scholar
- DeBartolo J, Colubri A, Jha AK, Fitzgerald JE, Freed KF, Sosnick TR: Mimicking the folding pathway to improve homology-free protein structure prediction. Proc Natl Acad Sci USA 2009, 106(10):3734–3739. 10.1073/pnas.0811363106PubMed CentralView ArticlePubMedGoogle Scholar
- DeBartolo J, Hocky G, Wilde M, Xu J, Freed KF, Sosnick TR: Protein structure prediction enhanced with evolutionary diversity: SPEED. Protein Sci 2010, 19(3):520–534.PubMed CentralPubMedGoogle Scholar
- Shehu A, Kavraki LE, Clementi C: Unfolding the fold of cyclic cysteine-rich peptides. Protein Sci 2008, 17(3):482–493. 10.1110/ps.073142708PubMed CentralView ArticlePubMedGoogle Scholar
- Wales DJ, Doye JPK: Global optimization by basin-hopping and the lowest energy structures of Lennard-Jones clusters containing up to 110 atoms. J Phys Chem A 1997, 101(28):5111–5116. 10.1021/jp970984nView ArticleGoogle Scholar
- De Jong KA: Evolutionary Computation : A Unified Approach. Boston, MA: MIT Press; 2006.Google Scholar
- Dandekar T, Argos P: Potential of genetic algorithms in protein folding and protein engineering simulations. Protein Engineering 1992, 5(7):637–645. 10.1093/protein/5.7.637View ArticlePubMedGoogle Scholar
- Djurdjevic DP, Biggs MJ: Ab initio protein fold prediction using evolutionary algorithms: Inuence of design and control parameters on performance. J Comput Chem 2006, 27(11):1177–1195. 10.1002/jcc.20440View ArticlePubMedGoogle Scholar
- Bazzoli A, Tettamanzi A: A memetic algorithm for protein structure prediction in a 3D-lattice HP model. Berlin: Springer Lecture notes in computer science; 2004:1–10.Google Scholar
- Islam M, Chetty M: Novel Memetic Algorithm for Protein Structure Prediction, Springer Berlin /Heidelberg, Volume 5866 of Lecture Notes in Computer Science. 2009, 412–421.Google Scholar
- Keum J ES, Kim K, Santos E: Local minima-based exploration for off-lattice protein folding. Bioinformatics Conference, 2003 CSB 2003 Proceedings of the 2003 IEEE 2003, 615–616.Google Scholar
- Krasnogor N, Blackburne B, Burke E, Hirst J: Multimeme algorithms for protein structure prediction. Parallel Problem Solving from Nature PPSN VII, Volume 2439 of Lecture Notes in Computer Science Edited by Guervós J, Adamidis P, Beyer HG, Schwefel HP, Fernández-Villacañas JL, Springer Berlin /Heidelberg 2002, 769–778.Google Scholar
- Mijajlovic M, Biggs MJ, Djurdjevic DP: On potential energy models for EA-based ab initio protein structure prediction. Evol Comput 2010, 18: 255–275. 10.1162/evco.2010.18.2.18204View ArticlePubMedGoogle Scholar
- Shmygelska A, Levitt M: Generalized ensemble methods for de novo structure prediction. Proc Natl Acad Sci USA 2009, 106(5):1415–1420. 10.1073/pnas.0812510106PubMed CentralView ArticlePubMedGoogle Scholar
- Das R: Four small puzzles that Rosetta doesn't solve. PLoS ONE 2011, 6(5):e20044. 10.1371/journal.pone.0020044PubMed CentralView ArticlePubMedGoogle Scholar
- Saleh S, Olson B, Shehu A: A population-based evolutionary algorithm for sampling minima in the protein energy surface. Bioinformatics and Biomedicine Workshops (BIBMW), 2012 IEEE International Conference on: 4–7 October 2012 2012, 64–71. 10.1109/BIBMW.2012.6470207View ArticleGoogle Scholar
- Xu J: Rapid protein side-Chain packing via tree decomposition.In Research in Computational Molecular Biology, Volume 3500 of Lecture Notes in Computer Science Edited by: Miyano S, Mesirov J, Kasif S, Istrail S, Pevzner P, Waterman M. Springer Berlin Heidelberg; 2005, 423–439. [http://dx.doi.org/10.1007/11415770_32]Google Scholar
- Krivov GG, Shapovalov MV, Dunbrack RL Jr.: Improved prediction of protein side-chain conformations with SCWRL4. Proteins 2009, 77(4):778–795. 10.1002/prot.22488PubMed CentralView ArticlePubMedGoogle Scholar
- Brooks BR, Bruccoleri RE, Olafson BD, States DJ, Swaminathan S, Karplus M: CHARMM: a program for macromolecular energy, minimization, and dynamics calculations. J Comput Chem 1983, 4(2):187–217. 10.1002/jcc.540040211View ArticleGoogle Scholar
- Zhang M, Kavraki LE: A new method for fast and accurate derivation of molecular conformations. J Chem Inf Comput Sci 2002, 42: 64–70. 10.1021/ci010327zView ArticlePubMedGoogle Scholar
- Rohl CA, Strauss CE, Misura KM, Baker D: Protein structure prediction using Rosetta. Methods Enzymol 2004, 383: 66–93.View ArticlePubMedGoogle Scholar
- Papoian GA, Ulander J, Eastwood MP, Luthey-Schulten Z, Wolynes PG: Water in protein structure prediction. Proc Natl Acad Sci USA 2004, 101(10):3352–3357. 10.1073/pnas.0307851100PubMed CentralView ArticlePubMedGoogle Scholar
- Shehu A: An ab-initio tree-based exploration to enhance sampling of low-energy protein conformations. In Robot: Sci and Sys. Seattle, WA, USA; 2009:241–248.Google Scholar
- Shehu A, Olson B: Guiding the search for native-like protein conformations with an ab-initio tree-based exploration. Int J Robot Res 2010, 29(8):1106–11227. 10.1177/0278364910371527View ArticleGoogle Scholar
- Olson B, Molloy K, Shehu A: Enhancing Sampling of the Conformational Space Near the Protein Native State. In BIONETICS: Intl Conf on Bio-inspired Models of Network, Information, and Computing Systems. Boston, MA; 2010.Google Scholar
- Olson B, Molloy K, Shehu A: In search of the protein native state with a probabilistic sampling approach. J Bioinform Comput Biol 2011, 9(3):383–398. 10.1142/S0219720011005574View ArticlePubMedGoogle Scholar
- Olson B, Molloy K, Hendi SF, Shehu A: Guiding probabilistic search of the protein conformational space with structural profiles. J Bioinform Comput Biol 2012, 10(3):1242005. 10.1142/S021972001242005XView ArticlePubMedGoogle Scholar
- Olson B, Shehu A: Populating Local Minima in the Protein Conformational Space. IEEE Intl Conf on Bioinf and Biomed (BIBM) 2011, 114–117.Google Scholar
- Olson B, Shehu A: Evolutionary-inspired probabilistic search for enhancing sampling of local minima in the protein energy surface. Proteome Sci 2012, 10(Suppl 1):S5. 10.1186/1477-5956-10-S1-S5PubMed CentralView ArticlePubMedGoogle Scholar
- Olson B, Shehu A: Efficient basin hopping in the protein energy surface. Bioinformatics and Biomedicine (BIBM), 2012 IEEE International Conference on: 4–7 October 2012 2012, 1–6. 10.1109/BIBM.2012.6392655View ArticleGoogle Scholar
- Hegler JA, Laetzer J, Shehu A, Clementi C, Wolynes PG: Restriction vs. guidance: fragment assembly and associative memory hamiltonians for protein structure prediction. Proc Natl Acad Sci USA 2009, 106(36):15302–15307. 10.1073/pnas.0907002106PubMed CentralView ArticlePubMedGoogle Scholar
- Case DA, Darden TA, Cheatham TEI, Simmerling CL, Wang J, Duke RE, Luo R, Merz KM, Pearlman DA, Crowley M, Walker RC, Zhang W, Wang B, Hayik S, Roitberg A, Seabra G, Wong KF, Paesani F, Wu X, Brozell S, Tsui V, Gohlke H, Yang L, Tan C, Mongan J, Hornak V, Cui G, Beroza P, Mathews DH, Schafmeister C, Ross WS, Kollman PA: AMBER 9. University of California, San Francisco; 2006.Google Scholar
- Gong H, Fleming PJ, Rose GD: Building native protein conformations from highly approximate backbone torsion angles. Proc Natl Acad Sci USA 2005, 102(45):16227–16232. 10.1073/pnas.0508415102PubMed CentralView ArticlePubMedGoogle Scholar
- Han KF, Baker D: Global properties of the mapping between local amino acid sequence and local structure in proteins. Proc Natl Acad Sci USA 1996, 93(12):5814–5818. 10.1073/pnas.93.12.5814PubMed CentralView ArticlePubMedGoogle Scholar
- Olson B, Hashmi I, Molloy I, Shehu A: Basin Hopping as a General and Versatile Optimization Framework for the Characterization of Biological Macromolecules. Advances in AI J 2012., 2012(674832):Google Scholar
- Berman HM, Henrick K, Nakamura H: Announcing the worldwide Protein Data Bank. Nat Struct Biol 2003, 10(12):980–980. 10.1038/nsb1203-980View ArticlePubMedGoogle Scholar
- Simoncini D, Berenger F, Shrestha R, Zhang KYJ: A probabilistic fragment-based protein structure prediction algorithm. PLoS ONE 2012, 7(7):e38799. 10.1371/journal.pone.0038799PubMed CentralView ArticlePubMedGoogle Scholar
- Bowman GR, Pande VS: Simulated tempering yields insight into the low-resolution Rosetta scoring functions. Proteins 2009, 74(3):777–788. 10.1002/prot.22210View ArticlePubMedGoogle Scholar
- Molloy K, Shehu A: Biased decoy sampling to identify near-native protein conformations. In ACM Bioinf and Comp Biol (BCB). Edited by: Zhang A, Ranka S, Kahveci T, Singh M, Honavar V. Orlando, FL; 2012:131–138.Google Scholar
- Prentiss MC, Hardin C, Eastwood MP, Zong C, Wolynes PG: Protein structure prediction: the next generation. J Chem Theory Comput 2006, 2(3):705–716. 10.1021/ct0600058View ArticleGoogle Scholar
- Prentiss MC, Wales DJ, Wolynes PG: Protein structure prediction using basin-hopping. The Journal of Chemical Physics 2008, 128(22):225106–225106. 10.1063/1.2929833PubMed CentralView ArticlePubMedGoogle Scholar
- Olson B, Jong KAD, Shehu A: Off-Lattice Protein Structure Prediction with Homologous Crossover. In Conf on Genetic and Evolutionary Computation (GECCO). New York, NY, USA: ACM; 2013.Google Scholar
- Olson B, Shehu A: An Evolutionary-inspired Algorithm to Guide Stochastic Search for Near-native Protein Conformations with Multiobjective Analysis. In Association for Advancement of Artificial Intelligence Workshops (AAAIW). Bellevue, Washington; 2013.Google Scholar
- Olson B, Shehu A: Multi-Objective Stochastic Search for Sampling Local Minima in the Protein Energy Surface. In ACM Conf on Bioinf and Comp Biol (BCB). Washington, D. C; 2013.Google Scholar
- Humphrey W, Dalke A, Schulten K: VMD: visual molecular dynamics. J Mol Graph 1996, 14: 33–38. [http://www.ks.uiuc.edu/Research/vmd/] 10.1016/0263-7855(96)00018-5View ArticlePubMedGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. The Creative Commons Public Domain Dedication waiver (http://creativecommons.org/publicdomain/zero/1.0/) applies to the data made available in this article, unless otherwise stated.