A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
From MaRDI portal
Publication:3502133
DOI10.1111/j.1475-3995.2007.00622.xzbMath1136.92037OpenAlexW1968609670WikidataQ56387396 ScholiaQ56387396MaRDI QIDQ3502133
Leo Liberti, Carlile C. Lavor, Nelson F. Maculan
Publication date: 22 May 2008
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/j.1475-3995.2007.00622.x
Applications of graph theory (05C90) Applications of mathematical programming (90C90) Search theory (90B40) Distance in graphs (05C12) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Software, source code, etc. for problems pertaining to biology (92-04)
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, Globally rigid powers of graphs, Disjunctive Cuts for Nonconvex MINLP, 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, 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 least-squares approach for discretizable distance geometry problems with inexact distances, An integer programming approach for the search of discretization orders in distance geometry problems, The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry, 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, Systematic reviews as a metaknowledge tool: caveats and a review of available options, On distance graph coloring problems, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Distance geometry and data science, On a Relationship Between Graph Realizability and Distance Matrix Completion, 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, Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem, A study on the covalent geometry of proteins and its impact on distance geometry, 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 convex relaxations of quadrilinear terms, 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, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint, NMR protein structure calculation and sphere intersections, Discretization vertex orders in distance geometry, On the optimality of finding DMDGP symmetries, New error measures and methods for realizing protein graphs from distance data, Preface: Special issue dedicated to distance geometry, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs, 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, Molecular distance geometry methods: from continuous to discrete, A cycle-based formulation for the distance geometry problem, A Euclidean distance matrix model for protein molecular conformation, Optimal partial discretization orders for discretizable distance geometry, Diagonally Dominant Programming in 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, Conflict Analysis for MINLP, A quantum approach to the discretizable molecular distance geometry problem
Cites Work
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Molecular modeling and simulation. An interdisciplinary guide
- Rigid versus unique determination of protein structures with geometric buildup
- Distance geometry optimization for protein structures
- Global Continuation for Distance Geometry Problems
- The Molecule Problem: Exploiting Structure in Global Optimization
- Computational Experience with the Molecular Distance Geometry Problem
- Unnamed Item
