Clifford algebra and the discretizable molecular distance geometry problem
From MaRDI portal
Publication:888986
DOI10.1007/s00006-015-0532-2zbMath1327.15052OpenAlexW2093446335WikidataQ62562137 ScholiaQ62562137MaRDI QIDQ888986
Carlile C. Lavor, Rafael Alves, Antonio Petraglia, Weber Figueiredo, Nelson F. Maculan
Publication date: 5 November 2015
Published in: Advances in Applied Clifford Algebras (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00006-015-0532-2
Related Items
Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem ⋮ Unassigned distance geometry and molecular conformation problems ⋮ A constrained interval approach to the generalized distance geometry problem ⋮ Recent advances on the interval distance geometry problem ⋮ A study on the covalent geometry of proteins and its impact on distance geometry ⋮ A generalised methodology using conformal geometric algebra for mathematical chemistry ⋮ Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb ⋮ A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN ⋮ On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1 ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ Oriented conformal geometric algebra and the molecular distance geometry problem ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ NMR protein structure calculation and sphere intersections ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Tuning interval branch-and-prune for protein structure determination ⋮ Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension ⋮ A Euclidean distance matrix model for protein molecular conformation ⋮ Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis ⋮ A quantum approach to the discretizable molecular distance geometry problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Collective additive tree spanners for circle graphs and polygonal graphs
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for protein side chains
- Discretization vertex orders in distance geometry
- A function to test methods applied to global minimization of potential energy of molecules
- Clifford algebra applied to Grover's algorithm
- The discretizable molecular distance geometry problem
- Analytic evaluation of the gradient and Hessian of molecular potential energy functions
- New foundations for classical mechanics.
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- A Clifford algebra of signature \((n,3n)\) and the density operators of quantum information theory
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Distance Geometry
- Molecular distance geometry methods: from continuous to discrete
- Reconstructing a three-dimensional model with arbitrary errors
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- Euclidean Distance Geometry and Applications
- Computational Experience with the Molecular Distance Geometry Problem
