On the Identification of Discretization Orders for Distance Geometry with Intervals

DOI10.1007/978-3-642-40020-9_24MaRDI QIDQ5410538zbMATH OpenOpenAlexDBLPWikidataFDO

Authors 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)

Recommendations

• Discretization orders for distance geometry problems
• Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
• Optimal partial discretization orders for discretizable distance geometry
• An integer programming approach for the search of discretization orders in distance geometry problems
• Discretization vertex orders in distance geometry
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• The discretizable distance geometry problem
• The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
• Recent advances on the interval distance geometry problem

Cited in

(16)

• Recent advances on the interval distance geometry problem
• 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
• Preface: Special issue dedicated to distance geometry
• A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
• Unassigned distance geometry and molecular conformation problems
• The referenced vertex ordering problem: theory, applications, and solution methods
• An integer programming approach for the search of discretization orders in distance geometry problems
• On the optimality of finding DMDGP symmetries
• Optimal partial discretization orders for discretizable distance geometry
• Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• Discretization orders for protein side chains
• Discretization vertex orders in distance geometry
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• New error measures and methods for realizing protein graphs from distance data

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

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