The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances

DOI10.1007/s10898-011-9799-6zbMath1272.90074OpenAlexW1987458603WikidataQ62562157 ScholiaQ62562157MaRDI QIDQ2392117

Leo Liberti, Carlile C. Lavor, Antonio Mucherino

Publication date: 1 August 2013

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-011-9799-6

zbMATH Keywords

combinatorial optimizationdistance geometryprotein conformationsNMR datainterval branch and prune

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

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, Maximum feasible subsystems of distance geometry constraints, Unassigned distance geometry and molecular conformation problems, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, 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, 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, An application-based characterization of dynamical distance geometry problems, The discretizable 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, Boolean combination of circular arcs using orthogonal spheres, Distance geometry and data science, On a Relationship Between Graph Realizability and Distance Matrix Completion, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, Pseudo-dihedral angles in proteins providing a new description of the Ramachandran map, Exploration of conformations for an intrinsically disordered protein, Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb, A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, 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, 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, Discretization orders for protein side chains, Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint, NMR protein structure calculation and sphere intersections, Discretization vertex orders in distance geometry, Fisher information distance: a geometrical reading, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, New error measures and methods for realizing protein graphs from distance data, Preface: Special issue dedicated to distance geometry, Tuning interval branch-and-prune for protein structure determination, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, Solving Distance Geometry Problem with Inexact Distances in Integer Plane, 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

Cites Work

• Optimization by Simulated Annealing
• On the computation of protein backbones by using artificial backbones of hydrogens
• Discretization orders for distance geometry problems
• The discretizable molecular distance geometry problem
• Molecular modeling and simulation. An interdisciplinary guide
• 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
• The discretizable distance geometry problem
• The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
• Molecular distance geometry methods: from continuous to discrete
• A Branch‐and‐Prune algorithm for 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