An effective hybrid of hill climbing and genetic algorithm for 2D triangular protein structure prediction

Determination of the throat size distribution of a porous medium as an inverse optimization problem combining pore network modeling and genetic and hill climbing algorithms

The pore size distribution of a porous medium is often estimated from the retention curve or the invading fluid flow rate curve using simple relationships more or less explicitly based on the consideration that the porous medium is made of a bundle of cylindrical parallel tubes. This type of determination is tested using pore network simulations. Starting from two- or three-dimensional networks, the characteristics of which are known a priori, the estimation of the throat size distribution (TSD) is performed using the standard methods in the case of drainage. Results show a significant discrepancy with the input data. The disagreement is more pronounced when the fluid flow rate curve is employed together with the parallel tubes assumption. The physical origins of these shortcomings are identified. A method, based on pore network simulations combined with a genetic algorithm and the hill climbing algorithm, is then designed, which makes simultaneous use of the nonwetting fluid flow rate curve and the retention curve of the medium. Very significant improvement is achieved in the estimation of the TSD using this procedure.

Selective Hydrolysis of Transferrin Promoted by Zr-Substituted Polyoxometalates

The hydrolysis of the iron-binding blood plasma glycoprotein transferrin (Tf) has been examined at pH = 7.4 in the presence of a series of Zr-substituted polyoxometalates (Zr-POMs) including Keggin (Et2NH2)10[Zr(PW11O39)2]∙7H2O (Zr-K 1:2), (Et2NH2)8[{α-PW11O39Zr-(μ-OH) (H2O)}2]∙7H2O (Zr-K 2:2), Wells-Dawson K15H[Zr(α2-P2W17O61)2]·25H2O (Zr-WD 1:2), Na14[Zr4(α-P2W16O59)2(μ3-O)2(μ-OH)2(H2O)4]·57H2O (Zr-WD 4:2) and Lindqvist (Me4N)2[ZrW5O18(H2O)3] (Zr-L 1:1), (nBu4N)6[(ZrW5O18(μ-OH))2]∙2H2O (Zr-L 2:2)) type POMs. Incubation of transferrin with Zr-POMs resulted in formation of 13 polypeptide fragments that were observed on sodium dodecyl sulfate poly(acrylamide) gel electrophoresis (SDS-PAGE), but the hydrolysis efficiency varied depending on the nature of Zr-POMs. Molecular interactions between Zr-POMs and transferrin were investigated by using a range of complementary techniques such as tryptophan fluorescence, circular dichroism (CD), 31P-NMR spectroscopy, in order to gain better understanding of different efficiency of investigated Zr-POMs. A tryptophan fluorescence quenching study revealed that the most reactive Zr-WD species show the strongest interaction toward transferrin. The CD results demonstrated that interaction of Zr-POMs and transferrin in buffer solution result in significant secondary structure changes. The speciation of Zr-POMs has been followed by 31P-NMR spectroscopy in the presence and absence of transferrin, providing insight into stability of the catalysts under reaction condition.

Computational advances of tumor marker selection and sample classification in cancer proteomics

Cancer proteomics has become a powerful technique for characterizing the protein markers driving transformation of malignancy, tracing proteome variation triggered by therapeutics, and discovering the novel targets and drugs for the treatment of oncologic diseases. To facilitate cancer diagnosis/prognosis and accelerate drug target discovery, a variety of methods for tumor marker identification and sample classification have been developed and successfully applied to cancer proteomic studies. This review article describes the most recent advances in those various approaches together with their current applications in cancer-related studies. Firstly, a number of popular feature selection methods are overviewed with objective evaluation on their advantages and disadvantages. Secondly, these methods are grouped into three major classes based on their underlying algorithms. Finally, a variety of sample separation algorithms are discussed. This review provides a comprehensive overview of the advances on tumor maker identification and patients/samples/tissues separations, which could be guidance to the researches in cancer proteomics.

Effective hybrid approach for protein structure prediction in a two-dimensional Hydrophobic-Polar model

Hydrophobic-polar (HP) models are widely used to predict protein folding and hydrophobic interactions. Numerous optimization algorithms have been proposed to predict protein folding using the two-dimensional (2D) HP model. However, to obtain an optimal protein structure from the 2D HP model remains challenging. In this study, an algorithm integrating particle swarm optimization (PSO) and Tabu search (TS), named PSO-TS, was proposed to predict protein structures based on the 2D HP model. TS can help PSO to avoid getting trapped in a local optima and thus to remove the limitation of PSO in predicting protein folding by the 2D HP model. In this study, a total of 28 protein sequences were used to evaluate the accuracy of PSO-TS in protein folding prediction. The proposed PSO-TS method was compared with 15 other approaches for predicting short and long protein sequences. Experimental results demonstrated that PSO-TS provides a highly accurate, reproducible, and stabile prediction ability for the protein folding by the 2D HP model.

Protein folding prediction in the HP model using ions motion optimization with a greedy algorithm

Background

The function of a protein is determined by its native protein structure. Among many protein prediction methods, the Hydrophobic-Polar (HP) model, an ab initio method, simplifies the protein folding prediction process in order to reduce the prediction complexity.

Results

In this study, the ions motion optimization (IMO) algorithm was combined with the greedy algorithm (namely IMOG) and implemented to the HP model for the protein folding prediction based on the 2D-triangular-lattice model. Prediction results showed that the integration method IMOG provided a better prediction efficiency in a HP model. Compared to others, our proposed method turned out as superior in its prediction ability and resilience for most of the test sequences. The efficiency of the proposed method was verified by the prediction results. The global search capability and the ability to escape from the local best solution of IMO combined with a local search (greedy algorithm) to the new algorithm IMOG greatly improve the search for the best solution with reliable protein folding prediction.

Conclusion

Overall, the HP model integrated with IMO and a greedy algorithm as IMOG provides an improved way of protein structure prediction of high stability, high efficiency, and outstanding performance.

A Novel Framework for Ab Initio Coarse Protein Structure Prediction

Hydrophobic-Polar model is a simplified representation of Protein Structure Prediction (PSP) problem. However, even with the HP model, the PSP problem remains NP-complete. This work proposes a systematic and problem specific design for operators of the evolutionary program which hybrids with local search hill climbing, to efficiently explore the search space of PSP and thereby obtain an optimum conformation. The proposed algorithm achieves this by incorporating the following novel features: (i) new initialization method which generates only valid individuals with (rather than random) better fitness values; (ii) use of probability-based selection operators that limit the local convergence; (iii) use of secondary structure based mutation operator that makes the structure more closely to the laboratory determined structure; and (iv) incorporating all the above-mentioned features developed a complete two-tier framework. The developed framework builds the protein conformation on the square and triangular lattice. The test has been performed using benchmark sequences, and a comparative evaluation is done with various state-of-the-art algorithms. Moreover, in addition to hypothetical test sequences, we have tested protein sequences deposited in protein database repository. It has been observed that the proposed framework has shown superior performance regarding accuracy (fitness value) and speed (number of generations needed to attain the final conformation). The concepts used to enhance the performance are generic and can be used with any other population-based search algorithm such as genetic algorithm, ant colony optimization, and immune algorithm.

A Particle Swarm Optimization-Based Approach with Local Search for Predicting Protein Folding

The hydrophobic-polar (HP) model is commonly used for predicting protein folding structures and hydrophobic interactions. This study developed a particle swarm optimization (PSO)-based algorithm combined with local search algorithms; specifically, the high exploration PSO (HEPSO) algorithm (which can execute global search processes) was combined with three local search algorithms (hill-climbing algorithm, greedy algorithm, and Tabu table), yielding the proposed HE-L-PSO algorithm. By using 20 known protein structures, we evaluated the performance of the HE-L-PSO algorithm in predicting protein folding in the HP model. The proposed HE-L-PSO algorithm exhibited favorable performance in predicting both short and long amino acid sequences with high reproducibility and stability, compared with seven reported algorithms. The HE-L-PSO algorithm yielded optimal solutions for all predicted protein folding structures. All HE-L-PSO-predicted protein folding structures possessed a hydrophobic core that is similar to normal protein folding.

A Multi-Objective Approach for Protein Structure Prediction Based on an Energy Model and Backbone Angle Preferences

Protein structure prediction (PSP) is concerned with the prediction of protein tertiary structure from primary structure and is a challenging calculation problem. After decades of research effort, numerous solutions have been proposed for optimisation methods based on energy models. However, further investigation and improvement is still needed to increase the accuracy and similarity of structures. This study presents a novel backbone angle preference factor, which is one of the factors inducing protein folding. The proposed multiobjective optimisation approach simultaneously considers energy models and backbone angle preferences to solve the ab initio PSP. To prove the effectiveness of the multiobjective optimisation approach based on the energy models and backbone angle preferences, 75 amino acid sequences with lengths ranging from 22 to 88 amino acids were selected from the CB513 data set to be the benchmarks. The data sets were highly dissimilar, therefore indicating that they are meaningful. The experimental results showed that the root-mean-square deviation (RMSD) of the multiobjective optimization approach based on energy model and backbone angle preferences was superior to those of typical energy models, indicating that the proposed approach can facilitate the ab initio PSP.

Niche Genetic Algorithms are better than traditional Genetic Algorithms for de novo Protein Folding

Here we demonstrate that Niche Genetic Algorithms (NGA) are better at computing de novo protein folding than traditional Genetic Algorithms (GA). Previous research has shown that proteins can fold into their active forms in a limited number of ways; however, predicting how a set of amino acids will fold starting from the primary structure is still a mystery.  GAs have a unique ability to solve these types of scientific problems because of their computational efficiency. Unfortunately, GAs are generally quite poor at solving problems with multiple optima.  However, there is a special group of GAs called Niche Genetic Algorithms (NGA) that are quite good at solving problems with multiple optima.  In this study, we use a specific NGA: the Dynamic-radius Species-conserving Genetic Algorithm (DSGA), and show that DSGA is very adept at predicting the folded state of proteins, and that DSGA is better than a traditional GA in deriving the correct folding pattern of a protein.

Wang-Landau sampling in face-centered-cubic hydrophobic-hydrophilic lattice model proteins

Finding the global minimum-energy structure is one of the main problems of protein structure prediction. The face-centered-cubic (fcc) hydrophobic-hydrophilic (HP) lattice model can reach high approximation ratios of real protein structures, so the fcc lattice model is a good choice to predict the protein structures. The lacking of an effective global optimization method is the key obstacle in solving this problem. The Wang-Landau sampling method is especially useful for complex systems with a rough energy landscape and has been successfully applied to solving many optimization problems. We apply the improved Wang-Landau (IWL) sampling method, which incorporates the generation of an initial conformation based on the greedy strategy and the neighborhood strategy based on pull moves into the Wang-Landau sampling method to predict the protein structures on the fcc HP lattice model. Unlike conventional Monte Carlo simulations that generate a probability distribution at a given temperature, the Wang-Landau sampling method can estimate the density of states accurately via a random walk, which produces a flat histogram in energy space. We test 12 general benchmark instances on both two-dimensional and three-dimensional (3D) fcc HP lattice models. The lowest energies by the IWL sampling method are as good as or better than those of other methods in the literature for all instances. We then test five sets of larger-scale instances, denoted by the S, R, F90, F180, and CASP target instances on the 3D fcc HP lattice model. The numerical results show that our algorithm performs better than the other five methods in the literature on both the lowest energies and the average lowest energies in all runs. The IWL sampling method turns out to be a powerful tool to study the structure prediction of the fcc HP lattice model proteins.

An effective evolutionary algorithm for protein folding on 3D FCC HP model by lattice rotation and generalized move sets

Background

Proteins are essential biological molecules which play vital roles in nearly all biological processes. It is the tertiary structure of a protein that determines its functions. Therefore the prediction of a protein's tertiary structure based on its primary amino acid sequence has long been the most important and challenging subject in biochemistry, molecular biology and biophysics. In the past, the HP lattice model was one of the ab initio methods that many researchers used to forecast the protein structure. Although these kinds of simplified methods could not achieve high resolution, they provided a macrocosm-optimized protein structure. The model has been employed to investigate general principles of protein folding, and plays an important role in the prediction of protein structures.

Methods

In this paper, we present an improved evolutionary algorithm for the protein folding problem. We study the problem on the 3D FCC lattice HP model which has been widely used in previous research. Our focus is to develop evolutionary algorithms (EA) which are robust, easy to implement and can handle various energy functions. We propose to combine three different local search methods, including lattice rotation for crossover, K-site move for mutation, and generalized pull move; these form our key components to improve previous EA-based approaches.

Results

We have carried out experiments over several data sets which were used in previous research. The results of the experiments show that our approach is able to find optimal conformations which were not found by previous EA-based approaches.

Conclusions

We have investigated the geometric properties of the 3D FCC lattice and developed several local search techniques to improve traditional EA-based approaches to the protein folding problem. It is known that EA-based approaches are robust and can handle arbitrary energy functions. Our results further show that by extensive development of local searches, EA can also be very effective for finding optimal conformations on the 3D FCC HP model. Furthermore, the local searches developed in this paper can be integrated with other approaches such as the Monte Carlo and Tabu searches to improve their performance.

Energy-landscape paving for prediction of face-centered-cubic hydrophobic-hydrophilic lattice model proteins

Protein structure prediction (PSP) is a classical NP-hard problem in computational biology. The energy-landscape paving (ELP) method is a class of heuristic global optimization algorithm, and has been successfully applied to solving many optimization problems with complex energy landscapes in the continuous space. By putting forward a new update mechanism of the histogram function in ELP and incorporating the generation of initial conformation based on the greedy strategy and the neighborhood search strategy based on pull moves into ELP, an improved energy-landscape paving (ELP+) method is put forward. Twelve general benchmark instances are first tested on both two-dimensional and three-dimensional (3D) face-centered-cubic (fcc) hydrophobic-hydrophilic (HP) lattice models. The lowest energies by ELP+ are as good as or better than those of other methods in the literature for all instances. Then, five sets of larger-scale instances, denoted by S, R, F90, F180, and CASP target instances on the 3D FCC HP lattice model are tested. The proposed algorithm finds lower energies than those by the five other methods in literature. Not unexpectedly, this is particularly pronounced for the longer sequences considered. Computational results show that ELP+ is an effective method for PSP on the fcc HP lattice model.

Naturally selecting solutions: the use of genetic algorithms in bioinformatics

For decades, computer scientists have looked to nature for biologically inspired solutions to computational problems; ranging from robotic control to scheduling optimization. Paradoxically, as we move deeper into the post-genomics era, the reverse is occurring, as biologists and bioinformaticians look to computational techniques, to solve a variety of biological problems. One of the most common biologically inspired techniques are genetic algorithms (GAs), which take the Darwinian concept of natural selection as the driving force behind systems for solving real world problems, including those in the bioinformatics domain. Herein, we provide an overview of genetic algorithms and survey some of the most recent applications of this approach to bioinformatics based problems.