Solving the Protein Folding Problem with a Bicriterion Genetic Algorithm on the Grid - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2006

Solving the Protein Folding Problem with a Bicriterion Genetic Algorithm on the Grid

Résumé

The exploration of potential multidimensional surfaces in protein folding is a non-trivial problem of extreme importance in computational biology. An evolutionary bicriterion grid-enabled protein folding approach is reported, classical molecular mechanics equations being employed for modeling inter-atomic interactions. Afferent computations were distributed on a nation-wide grid - GRID5000. A layered software design composed of dedicated frameworks is adopted due to the highly complex aspects inherent for the underlying volatile and dynamic execution environment. A brief insight on the existing approaches and the mathematical basis describing physical molecular interactions is offered, including derived semi-empirical and purely-empirical models. Introductory multicriterion formalisms enclosing the exposed approach are also presented

Domaines

Autre [cs.OH]
Fichier non déposé

Dates et versions

hal-00684823 , version 1 (03-04-2012)

Identifiants

Citer

Alexandru-Adrian Tantar, Nouredine Melab, El-Ghazali Talbi, Bernard Toursel. Solving the Protein Folding Problem with a Bicriterion Genetic Algorithm on the Grid. Procedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06), May 2006, Singapore, Singapore. ⟨10.1109/CCGRID.2006.1630936⟩. ⟨hal-00684823⟩
280 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More