Adaptive Branching in iBP with Clifford Algebra
R. Alves, A. Cassioli, A. Mucherino, C. Lavor, L. Liberti

We consider the interval Discretizable Molecular Distance Geometry Problem (iDMDGP). This is a subclass of instances of the Distance Geometry that can be discretized; they are related to biological molecules and can contain imprecise measurements of the available distances. The intervalbranch-and-prune (iBP) is an algorithm for the iDMDGP. In this short paper, we integrate iBP with Clifford algebra, with the aim of improving the branching phase of the algorithm, by making it adaptive.