Abstract

We consider the Discretizable Molecular Distance Geometry Problem (DMDGP), which is a subclass of the Distance Geometry Problem (DGP), where the search space can be discretized. The DMDGP consists in finding a 3D protein structure for which some of the atomic distances are provided by Nuclear Magnetic Resonance (NMR) experiments. Due to the uncertainties in NMR data, some distances may not be precise, being represented by intervals of real numbers. We present recent results related to the use of Conformal Geometric Algebra to model the DMDGP with imprecise data.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call