Discretization Orders for Distance Geometry Problems

Abstract : Given a weighted, undirected simple graph G = (V,E,d) the Distance Geometry Problem (DGP) consists in determining an embedding x such that for each (i,j) in E ||xi - xj|| = d(i,j) . Although in general the DGP is solved using continuous methods, under certain conditions the search is reduced to a discrete set of points. We give one such condition as a particular order on V. We formalize the decision problem of determining whether such an order exists for a given graph and show that this problem is NP-complete in general and polynomial for fixed K. We exhibit computational experiments on a set of proteins whose natural atomic order does not satisfy the order requirements, and compare our approach with some available continuous space searches.
Type de document :
Article dans une revue
Optimization Letters, Springer Verlag, 2012, 6 (4), pp.783-796
Liste complète des métadonnées

Contributeur : Antonio Mucherino <>
Soumis le : samedi 24 novembre 2012 - 13:29:02
Dernière modification le : jeudi 7 février 2019 - 17:16:38


  • HAL Id : hal-00756941, version 1


Antonio Mucherino, Carlile Lavor, Lee Jon, John Lee S., Leo Liberti, et al.. Discretization Orders for Distance Geometry Problems. Optimization Letters, Springer Verlag, 2012, 6 (4), pp.783-796. 〈hal-00756941〉



Consultations de la notice