Adding Probabilistic Dependencies to the Search of Protein Side Chain Configurations Using EDAs

  • Authors:
  • Roberto Santana;Pedro Larrañaga;Jose A. Lozano

  • Affiliations:
  • Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, San Sebastian, Spain 20018;Department of Artificial Intelligence, Technical University of Madrid, Boadilla del Monte, Spain 28660;Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, San Sebastian, Spain 20018

  • Venue:
  • Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of finding an optimal positioning for the side chain residues of a protein is called the side chain placement or side chain prediction problem. It can be posed as an optimization problem in the discrete domain. In this paper we use an estimation of distribution algorithm to address this optimization problem. Using a set of 50 difficult protein instances, it is shown that the addition of dependencies between the variables in the probabilistic model can improve the quality of the solutions achieved for most of the instances considered. However, we also show that only when information about the known interactions between the residues is considered in the creation of the probabilistic model, the addition of the dependencies contributes to improve the quality of the solutions obtained.