We consider the distance geometry problem in the particular case in which it can be discretized and formulated as a combinatorial optimization problem. A Branch & Prune (BP) algorithmis employed for an efficient solution of this problem when exact values for the known distances are available. We discuss some strategies for extending the BP algorithm to the case in which inexact distances are instead provided.