On the Discretization of iDMDGP instances regarding Protein Side Chains with Rings
V. Costa, A. Mucherino, L.M. Carvalho, N. Maculan

The interval Discretizable Molecular Distance Geometry (iDMDGP) consists in a subclass of distance geometry problems that can be discretized. Instances of the iDMDGP can be solved by employing an efficient $interval$ Branch & Prune (iBP) algorithm. However, instances can belong to the iDMDGP class only if some particular assumptions are satisfied, that are mainly based on the order on which the atoms of the molecule are considered. In this short paper, we present 5 special orders for the side chains of 5 amino acids, the ones that contain rings in their structure.