Recent Advances on the Discretizable Molecular Distance Geometry Problem

Abstract : The Molecular Distance Geometry Problem (MDGP) consists in finding an embedding in R^3 of a nonnegatively weighted simple undirected graph with the property that the Euclidean distances between embedded adjacent vertices must be the same as the corresponding edge weights. The Discretizable Molecular Distance Geometry Problem (DMDGP) is a particular subset of the MDGP which can be solved using a discrete search occurring in continuous space; its main application is to find three-dimensional arrangements of proteins using Nuclear Magnetic Resonance (NMR) data. The model provided by the DMDGP, however, is too abstract to be directly applicable in proteomics. In the last five years our efforts have been directed towards adapting the DMDGP to be an ever closer model of the actual difficulties posed by the problem of determining protein structures from NMR data. This survey lists recent developments on DMDGP related research.
Type de document :
Article dans une revue
European Journal of Operational Research, Elsevier, 2012, 219, pp.698-706
Liste complète des métadonnées

https://hal.inria.fr/hal-00756942
Contributeur : Antonio Mucherino <>
Soumis le : samedi 24 novembre 2012 - 13:33:15
Dernière modification le : mercredi 16 mai 2018 - 11:23:35

Identifiants

  • HAL Id : hal-00756942, version 1

Citation

Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. Recent Advances on the Discretizable Molecular Distance Geometry Problem. European Journal of Operational Research, Elsevier, 2012, 219, pp.698-706. 〈hal-00756942〉

Partager

Métriques

Consultations de la notice

619