Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension

DOI10.1007/s00006-019-0995-7zbMath1430.68361OpenAlexW2964763273MaRDI QIDQ2274754

Leandro A. F. Fernandes, Valter S. Camargo, Felipe Fidalgo, Emerson Vitor Castelani

Publication date: 1 October 2019

Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00006-019-0995-7

zbMATH Keywords

symmetryMinkowski spaceouter productbranch-and-pruneconformal algebradistance geometry problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General theory of distance geometry (51K05)

Related Items

TbGAL: a tensor-based library for geometric algebra ⋮ Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances

Uses Software

• OpenCLLink
• Julia
• GitHub
• iBP
• LIGA
• GATL

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance-based position analysis of the three seven-link Assur kinematic chains
• The discretizable molecular distance geometry problem
• Geometric algebra enhanced precompiler for C++, OpenCL and Mathematica's OpenCLLink
• Clifford algebra and the discretizable molecular distance geometry problem
• Geometric algebra with applications in engineering
• A symmetry-based splitting strategy for discretizable distance geometry problems
• Oriented conformal geometric algebra and the molecular distance geometry problem
• Tuning interval branch-and-prune for protein structure determination
• The discretizable distance geometry problem
• Distance geometry optimization for protein structures
• Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
• Boolean combination of circular arcs using orthogonal spheres
• On the number of realizations of certain Henneberg graphs arising in protein conformation
• Julia: A Fresh Approach to Numerical Computing
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Global Continuation for Distance Geometry Problems
• Clifford algebra and discretizable distance geometry
• A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
• Euclidean Distance Geometry
• Euclidean Distance Geometry and Applications

This page was built for publication: Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension