In order to discretize Molecular Distance Geometry Problems (MDGPs), some particular assumptions need to be satisfied, that are mainly related to the order with which the atoms of the molecule are considered. The discretization allows for employing an efficient branch-and-prune algorithm for the solution of MDGPs. This presentation is focused on methods and algorithms for the identification of suitable orders that can allow for the discretization.