The Role of a Priori Information in the Minimization of Contact Potentials by Means of Estimation of Distribution Algorithms

Directed search methods and probabilistic approaches have been used as two alternative ways for computational protein design. This paper presents a hybrid methodology that combines features from both approaches. Three estimation of distribution algorithms are applied to the solution of a protein design problem by minimization of contact potentials. The combination of probabilistic models able to represent probabilistic dependencies with the use of information about residues interactions in the protein contact graph is shown to improve the efficiency of search for the problems evaluated.

[1]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[2]  Victor Maojo,et al.  Biological and Medical Data Analysis, 6th International Symposium, ISBMDA 2005, Aveiro, Portugal, November 10-11, 2005, Proceedings , 2005, ISBMDA.

[3]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[4]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[5]  R. Elber,et al.  Distance‐dependent, pair potential for protein folding: Results from linear optimization , 2000, Proteins.

[6]  Max Henrion,et al.  Propagating uncertainty in bayesian networks by probabilistic logic sampling , 1986, UAI.

[7]  Pedro Larrañaga,et al.  Protein Folding in 2-Dimensional Lattices with Estimation of Distribution Algorithms , 2004, ISBMDA.

[8]  Jinming Zou,et al.  Using self-consistent fields to bias Monte Carlo methods with applications to designing and sampling protein sequences , 2003 .

[9]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[10]  Wei Wang,et al.  Progress in the development and application of computational methods for probabilistic protein design , 2005, Comput. Chem. Eng..

[11]  Rajkumar Roy,et al.  Advances in Soft Computing: Engineering Design and Manufacturing , 1998 .

[12]  Xavier Llorà,et al.  ENPDA: an evolutionary structure-based de novo peptide design algorithm , 2005, J. Comput. Aided Mol. Des..

[13]  Jon M. Kleinberg,et al.  The evolutionary capacity of protein structures , 2004, RECOMB '04.

[14]  J. Hsu Multiple Comparisons: Theory and Methods , 1996 .

[15]  S. Baluja,et al.  Using Optimal Dependency-Trees for Combinatorial Optimization: Learning the Structure of the Search Space , 1997 .

[16]  C. N. Liu,et al.  Approximating discrete probability distributions with dependence trees , 1968, IEEE Trans. Inf. Theory.

[17]  Roland L. Dunbrack Rotamer libraries in the 21st century. , 2002, Current opinion in structural biology.

[18]  Pedro Larrañaga,et al.  Side chain placement using estimation of distribution algorithms , 2007, Artif. Intell. Medicine.

[19]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[20]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[21]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[22]  Qianqian Zhu,et al.  How well can we predict native contacts in proteins based on decoy structures and their energies? , 2003, Proteins.

[23]  Shumeet Baluja,et al.  Using Optimal Dependency-Trees for Combinational Optimization , 1997, ICML.

[24]  M. Lehmann,et al.  From DNA sequence to improved functionality: using protein sequence comparisons to rapidly design a thermostable consensus phytase. , 2000, Protein engineering.

[25]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[26]  Ron Elber,et al.  Computational analysis of sequence selection mechanisms. , 2004, Structure.