On the Identification of Discretization Orders for Distance Geometry with Intervals

DOI10.1007/978-3-642-40020-9_24zbMath1405.51008OpenAlexW1857928572WikidataQ56387397 ScholiaQ56387397MaRDI QIDQ5410538

Antonio Mucherino

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-40020-9_24

Mathematics Subject Classification ID

General theory of distance geometry (51K05) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Related Items (14)

Unassigned distance geometry and molecular conformation problems ⋮ The referenced vertex ordering problem: theory, applications, and solution methods ⋮ Recent advances on the interval distance geometry problem ⋮ Oriented conformal geometric algebra and the molecular distance geometry problem ⋮ Discretization orders and efficient computation of Cartesian coordinates for distance geometry ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint ⋮ Discretization vertex orders in distance geometry ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ On the optimality of finding DMDGP symmetries ⋮ New error measures and methods for realizing protein graphs from distance data ⋮ Preface: Special issue dedicated to distance geometry ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances ⋮ Optimal partial discretization orders for discretizable distance geometry

This page was built for publication: On the Identification of Discretization Orders for Distance Geometry with Intervals