The discretizable distance geometry problem
From MaRDI portal
Publication:1926615
DOI10.1007/s11590-011-0358-3zbMath1258.90100OpenAlexW2049815112WikidataQ62562163 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
Related Items
The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, The referenced vertex ordering problem: theory, applications, and solution methods, A symmetry-based splitting strategy for discretizable distance geometry problems, Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems, A least-squares approach for discretizable distance geometry problems with inexact distances, The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry, A constrained interval approach to the generalized distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Recent advances on the interval distance geometry problem, Clifford algebra and the discretizable molecular distance geometry problem, Constraint programming approaches for the discretizable molecular distance geometry problem, On distance graph coloring problems, Distance geometry and data science, On a Relationship Between Graph Realizability and Distance Matrix Completion, Cycle-based formulations in distance geometry, Distance Geometry on the Sphere, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, A study on the covalent geometry of proteins and its impact on distance geometry, On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1, On the number of realizations of certain Henneberg graphs arising in protein conformation, Realizing Euclidean distance matrices by sphere intersection, Minimal NMR distance information for rigidity of protein graphs, 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, Discretization orders for distance geometry problems, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, Coordinate Difference Matrices, Optimal partial discretization orders for discretizable distance geometry, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis, A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
