The Discretizable Molecular Distance Geometry Problem

Abstract : Given a simple weighted undirected graph G=(V,E,d), the Molecular Distance Geometry Problem (MDGP) consists in finding an embedding x such that ||x_u - x_v|| = d(u,v) for each (u,v) in E. We show that under a few assumptions usually satisfied in proteins, the MDGP can be formulated as a search in a discrete space. We call this MDGP subclass the Discretizable MDGP (DMDGP). We show that the DMDGP is NP-hard and we propose a solution algorithm called Branch-and-Prune (BP). The BP algorithm performs remarkably well in practice in terms of speed and solution accuracy, and can be easily modified to find all incongruent solutions to a given DMDGP instance. We show computational results on several artificial and real-life instances.
Type de document :
Article dans une revue
Computational Optimization and Applications, Springer Verlag, 2012, 52, pp.115-146
Liste complète des métadonnées

https://hal.inria.fr/hal-00756940
Contributeur : Antonio Mucherino <>
Soumis le : samedi 24 novembre 2012 - 13:24:59
Dernière modification le : mardi 16 janvier 2018 - 15:54:20

Identifiants

  • HAL Id : hal-00756940, version 1

Citation

Antonio Mucherino, Carlile Lavor, Leo Liberti, Nelson Maculan. The Discretizable Molecular Distance Geometry Problem. Computational Optimization and Applications, Springer Verlag, 2012, 52, pp.115-146. 〈hal-00756940〉

Partager

Métriques

Consultations de la notice

366