Mixed heuristic local search for protein structure prediction

15Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.

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 20 × 20 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. Copyright © 2013, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.

Cite

CITATION STYLE

APA

Shatabda, S., Newton, M. A. H., & Sattar, A. (2013). Mixed heuristic local search for protein structure prediction. In Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013 (pp. 876–882). https://doi.org/10.1609/aaai.v27i1.8602

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free