Realizing Euclidean distance matrices by sphere intersection

DOI10.1016/j.dam.2018.06.003zbMath1420.51009OpenAlexW2883359381WikidataQ62562099 ScholiaQ62562099MaRDI QIDQ1728090

Leo Liberti, Jorge Alencar, Carlile C. Lavor

Publication date: 21 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.06.003

zbMATH Keywords

distance geometryEuclidean distance matrixembedding dimensionsphere intersection

Mathematics Subject Classification ID

General theory of distance geometry (51K05)

Related Items

NMR protein structure calculation and sphere intersections, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for realizing Euclidean distance matrices
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• The discretizable molecular distance geometry problem
• The discretizable distance geometry problem
• Open research areas in distance geometry
• On the number of realizations of certain Henneberg graphs arising in protein conformation
• Fast linear algebra is stable
• Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
• Solution of the embedding problem and decomposition of symmetric matrices.
• A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
• Euclidean Distance Geometry and Applications