Mixed Heuristic Local Search for Protein Structure Prediction

Authors

  • Swakkhar Shatabda Griffith University
  • M. A. Newton Griffith University
  • Abdul Sattar Griffith University

DOI:

https://doi.org/10.1609/aaai.v27i1.8602

Keywords:

Protein Structure Prediction, Simplified Models, Lattice Fit, Cubic Lattice, FCC Lattice, Energy Models, Local Search, Constraints, Constraint Based Local Search

Abstract

Protein structure prediction is an unsolved problem in computational biology. One great difficulty is due to the unknown factors in the actual energy function. Moreover, the energy models available are often not very informative particularly when spatially similar structures are compared during search. We introduce several novel heuristics to augment the energy model and present a new local search algorithm that exploits these heuristics in a mixed fashion. Although the heuristics individually are weaker in performance than the energy function, their combination interestingly produces stronger results. For standard benchmark proteins on the face centered cubic lattice and a realistic 20x20 energy model, we obtain structures with significantly lower energy than those obtained by the state-of-the-art algorithms. We also report results for these proteins using the same energy model on the cubic lattice.

Downloads

Published

2013-06-30

How to Cite

Shatabda, S., Newton, M. A., & Sattar, A. (2013). Mixed Heuristic Local Search for Protein Structure Prediction. Proceedings of the AAAI Conference on Artificial Intelligence, 27(1), 876-882. https://doi.org/10.1609/aaai.v27i1.8602