We consider the *interval* Discretizable Molecular Distance Geometry Problem (*i*DMDGP).
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 *interval*branch-and-prune (*i*BP) is an algorithm for the *i*DMDGP.
In this short paper, we integrate *i*BP with Clifford algebra, with the aim of improving the branching
phase of the algorithm, by making it adaptive.