A Clifford Algebra approach to the Discretizable Molecular Distance Geometry Problem

2013/05/04 by Andrioni, Alessandro
#Computational Geometry (cs.CG) #FOS: Computer and information sciences

paper · doi:10.48550/arxiv.1305.1596

Abstract

The Discretizable Molecular Distance Geometry Problem (DMDGP) consists in a subclass of the Molecular Distance Geometry Problem for which an embedding in ℝ³ can be found using a Branch & Prune (BP) algorithm in a discrete search space. We propose a Clifford Algebra model of the DMDGP with an accompanying version of the BP algorithm.

Related

• The Discretizable Molecular Distance Geometry Problem
• On the number of solutions of the discretizable molecular distance geometry problem
• Polynomial cases of the Discretizable Molecular Distance Geometry Problem
• A Rank-Count Theory for the Combinatorial Discretizable Distance Geometry Problem
• Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems