Effective optimization algorithms for fragment-assembly based protein structure prediction.
Despite recent developments in protein structure prediction, an accurate new fold prediction algorithm remains elusive. One of the challenges facing current techniques is the size and complexity of the space containing possible structures for a query sequence. Traditionally, to explore this space fragment assembly approaches to new fold prediction have used stochastic optimization techniques. Here we examine deterministic algorithms for optimizing scoring functions in protein structure prediction. Two previously unused techniques are applied to the problem, called the Greedy algorithm and the Hill-climbing algorithm. The main difference between the two is that the latter implements a technique to overcome local minima. Experiments on a diverse set of 276 proteins show that the Hill-climbing algorithms consistently outperform existing approaches based on Simulated Annealing optimization (a traditional stochastic technique) in optimizing the root mean squared deviation (RMSD) between native and working structures.
DeRonne
Kevin W
KW
Department of Computer Science & Engineering, Digital Technology Center, Army HPC Research Center, University of Minnesota, Minneapolis, MN 55455, USA. deronne@cs.umn.edu
Karypis
George
G
D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D030562:Databases, Protein; D015233:Models, Statistical; D010363:Pattern Recognition, Automated; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry*; D040901:Proteomics / Q000379:methods*; D012984:Software; D013997:Time Factors
D011506:Proteins