Recent advances on the interval distance geometry problem
From MaRDI portal
Publication:1683318
DOI10.1007/s10898-016-0493-6zbMath1382.90084OpenAlexW2561820074WikidataQ62562116 ScholiaQ62562116MaRDI QIDQ1683318
Leo Liberti, Antonio Mucherino, Douglas S. Gonçalves, Carlile C. Lavor
Publication date: 7 December 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0493-6
Related Items
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, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, 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, Constraint programming approaches for the discretizable molecular distance geometry problem, Distance geometry and data science, A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1, 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, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, Tuning interval branch-and-prune for protein structure determination, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Unnamed Item
- Optimization by Simulated Annealing
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- Protein structure optimization by side-chain positioning via beta-complex
- Solving a generalized distance geometry problem for protein structure determination
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for protein side chains
- Discretization vertex orders in distance geometry
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- On the computation of protein backbones by using artificial backbones of hydrogens
- Minimal interatomic distance in Morse clusters
- 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
- Theory of semidefinite programming for sensor network localization
- Clifford algebra and the discretizable molecular distance geometry problem
- Rigid versus unique determination of protein structures with geometric buildup
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- The application of the genetic algorithm to the minimization of potential energy functions
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Global minimum potential energy conformations of small molecules
- Conformational searches for the global minimum of protein models
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- The discretizable distance geometry problem
- 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
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- Distance Geometry in Structural Biology: New Perspectives
- An Overview on Protein Structure Determination by NMR: Historical and Future Perspectives of the use of Distance Geometry Methods
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Cayley-Menger coordinates.
- Euclidean Distance Geometry and Applications
- On the Identification of Discretization Orders for Distance Geometry with Intervals
