Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
DOI10.1007/S00006-019-0995-7zbMATH Open1430.68361OpenAlexW2964763273MaRDI QIDQ2274754FDOQ2274754
Authors: Valter S. Camargo, Emerson V. Castelani, Leandro A. F. Fernandes, Felipe Fidalgo 
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
Recommendations
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- The discretizable molecular distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- The discretizable distance geometry problem
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) General theory of distance geometry (51K05)
Cites Work
- Julia: a fresh approach to numerical computing
- Tuning interval branch-and-prune for protein structure determination
- Euclidean distance geometry and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Global Continuation for Distance Geometry Problems
- Geometric algebra enhanced precompiler for C++, OpenCL and Mathematica's OpenCLLink
- Geometric algebra with applications in engineering
- Distance geometry optimization for protein structures
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- The discretizable molecular distance geometry problem
- The discretizable distance geometry problem
- Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Clifford algebra and the discretizable molecular distance geometry problem
- Distance-based position analysis of the three seven-link Assur kinematic chains
- Euclidean distance geometry. An introduction
- A symmetry-based splitting strategy for discretizable distance geometry problems
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- Oriented conformal geometric algebra and the molecular distance geometry problem
- Clifford algebra and discretizable distance geometry
- A note on computing the intersection of spheres in \(\mathbb{R}^n\)
- Boolean combination of circular arcs using orthogonal spheres
Cited In (7)
- TbGAL: a tensor-based library for geometric algebra
- Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb
- The discretizable molecular distance geometry problem
- A quantum approach to the discretizable molecular distance geometry problem
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- Current survey of Clifford geometric algebra applications
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
Uses Software
This page was built for publication: Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274754)
