Neighborhood Selection in Constraint-Based Local Search for Protein Structure Prediction

Loading...
Thumbnail Image
File version
Author(s)
Shatabda, S
Newton, MAH
Sattar, A
Griffith University Author(s)
Primary Supervisor
Other Supervisors
Editor(s)

Stephen Cranefield, Abhaya Nayak

Date
2013
Size

382512 bytes

File type(s)

application/pdf

Location

Dunedin, New Zealand

License
Abstract

Protein structure prediction (PSP) is a very challenging constraint optimization problem. Constraint-based local search approaches have obtained promising results in solving constraint models for PSP. However, the neighborhood exploration policies adopted in these approaches either remain exhaustive or are based on random decisions. In this paper, we propose heuristics to intelligently explore only the promising areas of the search neighborhood. On face centered cubic lattice using a realistic 20ײ0 energy model and standard benchmark proteins, we obtain structures with significantly lower energy and RMSD values than those obtained by the state-of-the-art algorithms.

Journal Title
Conference Title

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Book Title
Edition
Volume

8272 LNAI

Issue
Thesis Type
Degree Program
School
Patent number
Funder(s)
Grant identifier(s)
Rights Statement
Rights Statement

© 2013 Springer Berlin/Heidelberg. This is the author-manuscript version of this paper. Reproduced in accordance with the copyright policy of the publisher.The original publication is available at www.springerlink.com

Item Access Status
Note
Access the data
Related item(s)
Subject

Artificial intelligence not elsewhere classified

Persistent link to this record
Citation