A note on the Cayley-Menger determinant and the molecular distance geometry problem

DOI10.1016/J.INS.2020.12.072MaRDI QIDQ2127101zbMATH OpenOpenAlexFDO

Authors Luiz Leduíno de Salles Neto, Carlile Lavor, W. A. Lodwick

Publication date 19 April 2022

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2020.12.072

zbMATH Keywords

Cayley-Menger determinantmolecular distance geometry problemnonlinear optimization.

Mathematics Subject Classification ID

Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• An introduction to distance geometry applied to molecular geometry
• The discretizable molecular distance geometry problem
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• The discretizable molecular distance geometry problem seems easier on proteins

Cites work

• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• Boolean combination of circular arcs using orthogonal spheres
• Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
• Cayley-Menger coordinates.
• Clifford algebra and discretizable distance geometry
• Comments on: ``Distance geometry and data science
• Discretization vertex orders in distance geometry
• Distance Geometry
• Distance geometry and data science
• Euclidean distance geometry and applications
• Extending the geometric build-up algorithm for the molecular distance geometry problem
• Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
• Minimal NMR distance information for rigidity of protein graphs
• New error measures and methods for realizing protein graphs from distance data
• On a relationship between graph realizability and distance matrix completion
• On generating instances for the modular distance geometry problem
• On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
• On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
• Oriented conformal geometric algebra and the molecular distance geometry problem
• Recent advances on the discretizable molecular distance geometry problem
• Recent advances on the interval distance geometry problem
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• Six mathematical gems from the history of distance geometry
• The discretizable molecular distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Tuning interval branch-and-prune for protein structure determination

Cited in

(3)

• A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
• MD-jeep: an implementation of a branch and prune algorithm for distance geometry problems

Describes a project that uses

Uses Software

• iBP

This page was built for publication: A note on the Cayley-Menger determinant and the molecular distance geometry problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127101)