Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint

DOI10.1007/978-3-319-26520-9_25zbMath1440.68315OpenAlexW2294313817MaRDI QIDQ3304780

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)

Related Items (1)

Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures

Cites Work

• Discretization orders and efficient computation of Cartesian coordinates for distance geometry
• Discretization orders for protein side chains
• Discretization vertex orders in distance geometry
• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• The discretizable distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Answer Set; Programming?
• Molecular distance geometry methods: from continuous to discrete
• Theory and Applications of Robust Optimization
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Euclidean Distance Geometry and Applications
• 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