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

Abstract : 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
Type de document :
Communication dans un congrès
Procedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid (CCGRID'06), May 2006, Singapore, Singapore. 2006, 〈10.1109/CCGRID.2006.1630936〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00684823
Contributeur : Ist Rennes <>
Soumis le : mardi 3 avril 2012 - 11:45:27
Dernière modification le : jeudi 11 janvier 2018 - 06:20:12

Identifiants

Collections

Citation

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. 2006, 〈10.1109/CCGRID.2006.1630936〉. 〈hal-00684823〉

Partager

Métriques

Consultations de la notice

234