On the Identification of Discretization Orders for Distance Geometry with Intervals

  • Antonio Mucherino
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8085)


The discretization of instances of the distance geometry problem is possible when some particular assumptions are satisfied. When molecules are concerned, such assumptions strongly depend on the order in which the atoms of the molecule are considered. When the chemical composition of the molecule is known, as it is the case for the proteins, a general order can be identified for an entire class of instances. However, when this information is not available, ad-hoc orders need to be found for every considered instance. In this paper, the problem of finding discretization orders for distance geometry problems with intervals is formalized, and an algorithm for its solution is presented.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Antonio Mucherino
    • 1
  1. 1.IRISAUniversity of Rennes 1RennesFrance

Personalised recommendations