Side chain placement using estimation of distribution algorithms.
OBJECTIVE
This paper presents an algorithm for the solution of the side chain placement problem.


METHODS
The algorithm combines the application of the Goldstein elimination criterion with the univariate marginal distribution algorithm (UMDA), which stochastically searches the space of possible solutions. The suitability of the algorithm to address the problem is investigated using a set of 425 proteins.


RESULTS
For a number of difficult instances where inference algorithms do not converge, it has been shown that UMDA is able to find better structures.


CONCLUSIONS
The results obtained show that the algorithm can achieve better structures than those obtained with other state-of-the-art methods like inference-based techniques. Additionally, a theoretical and empirical analysis of the computational cost of the algorithm introduced has been presented.
Santana
Roberto
R
Department of Computer Science and Artificial Intelligence, University of the Basque Country, CP-20080, Donostia-San Sebastián, Spain. rsantana@si.ehu.es
Larrañaga
Pedro
P
Lozano
Jose A
JA
D000465:Algorithms; D036262:Empirical Research; D008958:Models, Molecular; D011487:Protein Conformation; D011506:Proteins / Q000737:chemistry
D011506:Proteins