Adding probabilistic dependencies to the search of protein side chain configurations using EDAs

Adding probabilistic dependencies to the search of protein side chain configurations using EDAs” by Roberto Santana, P. Larrañaga, and J. A. Lozano. In Parallel Problem Solving from Nature - PPSN X, (G. Rudolph, T. Jansen, S. Lucas, C. Poloni, and N. Beume, eds.), (Dortmund, Germany), 2008, pp. 1120-1129.

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.

BibTeX entry:

@inproceedings{Santana_et_al:2008d,
   author = {Roberto Santana and P. Larra{\~n}aga and J. A. Lozano},
   editor = {G. Rudolph and T. Jansen and S. Lucas and C. Poloni and N. Beume},
   title = {Adding probabilistic dependencies to the search of protein
	side chain configurations using {EDAs}},
   booktitle = {Parallel Problem Solving from Nature - PPSN X},
   series = {Lecture Notes in Computer Science},
   volume = {5199},
   pages = {1120--1129},
   publisher = {Springer},
   address = {Dortmund, Germany},
   year = {2008},
   url = {http://dx.doi.org/10.1007/978-3-540-87700-4_111}
}

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.