A balance-evolution artificial bee colony algorithm for protein structure optimization based on a three-dimensional AB off-lattice model

Protein structure prediction is a fundamental issue in the field of computational molecular biology. In this paper, the AB off-lattice model is adopted to transform the original protein structure prediction scheme into a numerical optimization problem. We present a balance-evolution artificial bee colony (BE-ABC) algorithm to address the problem, with the aim of finding the structure for a given protein sequence with the minimal free-energy value. This is achieved through the use of convergence information during the optimization process to adaptively manipulate the search intensity. Besides that, an overall degradation procedure is introduced as part of the BE-ABC algorithm to prevent premature convergence. Comprehensive simulation experiments based on the well-known artificial Fibonacci sequence set and several real sequences from the database of Protein Data Bank have been carried out to compare the performance of BE-ABC against other algorithms. Our numerical results show that the BE-ABC algorithm is able to outperform many state-of-the-art approaches and can be effectively employed for protein structure optimization.     

A parallel tabu search for conformational energy optimization of oligopeptides

We have developed and implemented a tabu search heuristic (TS) to determine the best energy minimum for oligopeptides. Our test molecule was Met‐enkephalin, a pentapetide that over the years has been used as a validation model for many global optimizers. The test potential energy function was ECEPP/3. Our tabu search implementation is based on assigning integer values to the variables to be optimized, and in facilitating the diversification and intensification of the search. The final output from the TS is treated with a local optimizer, and our best result competes both in quality and CPU time with those reported in the literature. The results indicate that TS is an efficient algorithm for conformational searches. We present a parallel TS version along with experimental results that show that this algorithm allows significant increases in speed. © 2000 John Wiley & Sons, Inc. J Comput Chem 21: 147–156, 2000     

Protein structure optimization using improved simulated annealing algorithm on a three-dimensional AB off-lattice model

This paper proposed an improved simulated annealing (ISA) algorithm for protein structure optimization based on a three-dimensional AB off-lattice model. In the algorithm, we provided a general formula used for producing initial solution, and designed a multivariable disturbance term, relating to the parameters of simulated annealing and a tuned constant, to generate neighborhood solution. To avoid missing optimal solution, storage operation was performed in searching process. We applied the algorithm to test artificial protein sequences from literature and constructed a benchmark dataset consisting of 10 real protein sequences from the Protein Data Bank (PDB). Otherwise, we generated C_α space-filling model to represent protein folding conformation. The results indicate our algorithm outperforms the five methods before in searching lower energies of artificial protein sequences. In the testing on real proteins, our method can achieve the energy conformations with C_α-RMSD less than 3.0 Å from the PDB structures. Moreover, C_α space-filling model may simulate dynamic change of protein folding conformation at atomic level.     

Development and optimisation of a novel genetic algorithm for studying model protein folding

Determination of the native state of a protein from its amino acid sequence is the goal of protein folding simulations, with potential applications in gene therapy and drug design. Location of the global minimum structure for a given sequence, however, is a difficult optimisation problem. In this paper, we describe the development and application of a genetic algorithm (GA) to find the lowest-energy conformations for the 2D HP lattice bead protein model. Optimisation of the parameters of our standard GA program reveals that the GA is most successful (at finding the lowest-energy conformations) for high rates of mating and mutation and relatively high elitism. We have also introduced a number of new genetic operators: a duplicate predator—which maintains population diversity by eliminating duplicate structures; brood selection—where two parent structures undergo crossover and give rise to a brood of (not just two) offspring; and a Monte Carlo based local search algorithm—to explore the neighbourhood of all members of the population. It is shown that these operators lead to significant improvements in the success and efficiency of the GA, both compared with our standard GA and with previously published GA studies for benchmark HP sequences with up to 50 beads.     

Population-based local search for protein folding simulation in the MJ energy model and cubic lattices

We present experimental results on benchmark problems in 3D cubic lattice structures with the Miyazawa–Jernigan energy function for two local search procedures that utilise the pull-move set: (i) population-based local search (PLS) that traverses the energy landscape with greedy steps towards (potential) local minima followed by upward steps up to a certain level of the objective function; (ii) simulated annealing with a logarithmic cooling schedule (LSA). The parameter settings for PLS are derived from short LSA-runs executed in pre-processing and the procedure utilises tabu lists generated for each member of the population. In terms of the total number of energy function evaluations both methods perform equally well, however, PLS has the potential of being parallelised with an expected speed-up in the region of the population size. Furthermore, both methods require a significant smaller number of function evaluations when compared to Monte Carlo simulations with kink-jump moves.     

Variable predictive model based classification algorithm for effective separation of protein structural classes

Variable predictive model based class discrimination (VPMCD) algorithm is proposed as an effective protein secondary structure classification tool. The algorithm mathematically represents the characteristics amino acid interactions specific to each protein structure and exploits them further to distinguish different structures. The new concept and the VPMCD classifier are established using well-studied datasets containing four protein classes as benchmark. The protein samples selected from SCOP and PDB databases with varying homology (25-100%) and non-uniform distribution of class samples provide challenging classification problem. The performance of the new method is compared with advanced classification algorithms like component coupled, SVM and neural networks. VPMCD provides superior performance for high homology datasets. 100% classification is achieved for self-consistency test and an improvement of 5% prediction accuracy is obtained during Jackknife test. The sensitivity of the new algorithm is investigated by varying model structures/types and sequence homology. Simpler to implement VPMCD algorithm is observed to be a robust classification technique and shows potential for effective extensions to other clinical diagnosis and data mining applications in biological systems.     

High-sensitivity staining of proteins for one- and two-dimensional gel electrophoresis using post migration covalent staining with a ruthenium fluorophore

This paper describes the use of a ruthenium complex ((bis(2,2'-bipyridine)-4'-methyl-4-carboxybipyridine-ruthenium-N-succidimyl ester-bis(hexafluorophosphate), abbreviated below as ASCQ_Ru) commercially available and chemically pure. This new ruthenium complex ASCQ_Ru brings an activated ester, allowing the selective acylation of amino acid side chain amines for the post migration staining of proteins separated in 1-DE and 2-DE. The protocol used is a simple three-step protocol fixing the proteins in the gel, staining and then washing, as no lengthy destaining step is required. First the critical staining step was optimized. Although in solution the best described pH for acylating proteins with this reagent is phosphate buffer at pH 7.0, we found that best medium for in-gel staining is unbuffered ACN/water solution (20/80 v/v). The two other steps are less critical and classical conditions are satisfactory: fixing with 7% acetic acid/10% ethanol solution and washing four times for 10 min with water. Sensitivity tests were performed using 1-DE on protein molecular weight markers. We obtained a higher sensitivity than SYPRO Ruby with a detection limit of 80 pg of protein per well. However, contrary to SYPRO Ruby, ASCQ_Ru exhibits a logarithmic dependency on the amount of protein. The dynamic range is similar to SYPRO Ruby and is estimated between three and four orders of magnitude. Finally, the efficiency of the post migration ASCQ_Ru staining for 2-D gel separation is demonstrated on the whole protein extract from human colon carcinoma cells lines HCT 116. ASCQ_Ru gave the highest number of spot detected compared to other common stains Colloidal CBB, SYPRO Ruby and Deep Purple.