Recent advances on the discretizable molecular distance geometry problem

DOI10.1016/j.ejor.2011.11.007zbMath1253.05132OpenAlexW2154228232WikidataQ62562161 ScholiaQ62562161MaRDI QIDQ1926689

Leo Liberti, Nelson F. Maculan, Carlile C. Lavor, Antonio Mucherino

Publication date: 29 December 2012

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2011.11.007

zbMATH Keywords

graph theorybioinformaticsbranch-and-pruneprotein conformation

Mathematics Subject Classification ID

Applications of graph theory (05C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items

Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem, A note on the Cayley-Menger determinant and the molecular distance geometry problem, Unassigned distance geometry and molecular conformation problems, Phase retrieval of complex and vector-valued functions, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, A symmetry-based splitting strategy for discretizable distance geometry problems, A constrained interval approach to the generalized distance geometry problem, The discretizable distance geometry problem, A look at the past and present of optimization - an editorial, Recent advances on the interval distance geometry problem, Clifford algebra and the discretizable molecular distance geometry problem, On distance graph coloring problems, Distance Geometry on the Sphere, Evolutionary decision rules for predicting protein contact maps, A dual basis approach to multidimensional scaling, A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, Computing the nearest Euclidean distance matrix with low embedding dimensions, Minimal NMR distance information for rigidity of protein graphs, 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, NMR protein structure calculation and sphere intersections, Discretization vertex orders in distance geometry, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, On the optimality of finding DMDGP symmetries, Preface: Special issue dedicated to distance geometry, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, Preface, A cycle-based formulation for the distance geometry problem, 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, Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares, Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach, A quantum approach to the discretizable molecular distance geometry problem

Uses Software

• MD-jeep

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computation of protein backbones by using artificial backbones of hydrogens
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• Molecular modeling and simulation. An interdisciplinary guide
• 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
• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• The discretizable distance geometry problem
• 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
• Molecular distance geometry methods: from continuous to discrete
• DECOMPOSITION OF GEOMETRIC CONSTRAINT SYSTEMS: A SURVEY
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• Rigid and Flexible Frameworks
• Global Continuation for Distance Geometry Problems
• On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
• Computational Experience with the Molecular Distance Geometry Problem
• MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems