The discretizable distance geometry problem

DOI10.1007/s11590-011-0358-3zbMath1258.90100WikidataQ62562163 ScholiaQ62562163MaRDI QIDQ1926615

Leo Liberti, Antonio Mucherino, Carlile C. Lavor

Publication date: 28 December 2012

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-011-0358-3

zbMATH Keywords

distance geometry; DMDGP; branch and prune; combinatorial reformulations; DDGP\(_3\)

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

Related Items

Discretization orders and efficient computation of Cartesian coordinates for distance geometry, Discretization vertex orders in distance geometry, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, Discretization orders for distance geometry problems, Clifford algebra and the discretizable molecular distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, On the number of realizations of certain Henneberg graphs arising in protein conformation, Optimal partial discretization orders for discretizable distance geometry, Distance Geometry on the Sphere

Uses Software

• LAPACK
• MD-jeep

Cites Work

• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• On the computation of protein backbones by using artificial backbones of hydrogens
• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• Theory of semidefinite programming for sensor network localization
• Rigid versus unique determination of protein structures with geometric buildup
• Extending the geometric build-up algorithm for the molecular distance geometry problem
• Double variable neighbourhood search with smoothing for the molecular distance geometry problem
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
• Recent advances on the discretizable molecular distance geometry problem
• Distance geometry optimization for protein structures
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
• Molecular distance geometry methods: from continuous to discrete
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Global Continuation for Distance Geometry Problems
• Computational Experience with the Molecular Distance Geometry Problem
• MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item