TY - JOUR
T1 - Effective optimization algorithms for fragment-assembly based protein structure prediction.
AU - DeRonne, Kevin W.
AU - Karypis, George
PY - 2006
Y1 - 2006
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=34250893049&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34250893049&partnerID=8YFLogxK
U2 - 10.1142/18609475730013
DO - 10.1142/18609475730013
M3 - Article
C2 - 17369622
AN - SCOPUS:34250893049
SN - 1752-7791
SP - 19
EP - 29
JO - Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference
JF - Computational systems bioinformatics / Life Sciences Society. Computational Systems Bioinformatics Conference
ER -