Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint

DOI10.1007/978-3-319-26520-9_25MaRDI QIDQ3304780zbMATH OpenOpenAlexFDO

Authors Antonio Mucherino

Publication date 3 August 2020

Published in Large-Scale Scientific Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-26520-9_25

zbMATH Keywords

discretization assumptiondistance geometry problem (DGP)initial cliquepartial discretization ordersreference vertex

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Optimal partial discretization orders for discretizable distance geometry
• Discretization orders for distance geometry problems
• Discretization vertex orders in distance geometry
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• An integer programming approach for the search of discretization orders in distance geometry problems

Cites work

• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Answer set; programming?
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• Discretization orders for distance geometry problems
• Discretization orders for protein side chains
• Discretization vertex orders in distance geometry
• Euclidean distance geometry and applications
• Molecular distance geometry methods: from continuous to discrete
• On the Identification of Discretization Orders for Distance Geometry with Intervals
• The discretizable distance geometry problem
• The discretizable molecular distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Theory and applications of robust optimization

Cited in

(5)

• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• Optimal partial discretization orders for discretizable distance geometry
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• Discretization vertex orders in distance geometry
• On the Identification of Discretization Orders for Distance Geometry with Intervals

This page was built for publication: Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint

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