Recent advances on the interval distance geometry problem
From MaRDI portal
Recommendations
- Recent advances on the discretizable molecular distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- An introduction to distance geometry applied to molecular geometry
- The discretizable molecular distance geometry problem
- On the Identification of Discretization Orders for Distance Geometry with Intervals
Cites work
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- An overview on protein structure determination by NMR: historical and future perspectives of the use of distance geometry methods
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Cayley-Menger coordinates.
- Clifford algebra and the discretizable molecular distance geometry problem
- Conformational searches for the global minimum of protein models
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for distance geometry problems
- Discretization orders for protein side chains
- Discretization vertex orders in distance geometry
- Distance geometry in structural biology: new perspectives
- Distance geometry optimization for protein structures
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Euclidean distance geometry and applications
- Experimental algorithms. 10th international symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5--7, 2011. Proceedings
- Explicit sensor network localization using semidefinite representations and facial reductions
- Global minimum potential energy conformations of small molecules
- Minimal interatomic distance in Morse clusters
- Molecular distance geometry methods: from continuous to discrete
- Molecular modeling and simulation. An interdisciplinary guide
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- On the computation of protein backbones by using artificial backbones of hydrogens
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Optimization by simulated annealing
- Protein structure optimization by side-chain positioning via beta-complex
- Recent advances on the discretizable molecular distance geometry problem
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Rigid versus unique determination of protein structures with geometric buildup
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Solving a generalized distance geometry problem for protein structure determination
- 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 application of the genetic algorithm to the minimization of potential energy functions
- The discretizable distance geometry problem
- The discretizable molecular distance geometry problem
- The discretizable molecular distance geometry problem seems easier on proteins
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Theory of semidefinite programming for sensor network localization
Cited in
(27)- On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data
- 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
- A note on computing the intersection of spheres in \(\mathbb{R}^n\)
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- On the exact solution of the distance geometry with interval distances in dimension 1
- Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to Discretizable Distance Geometry Problems
- Constraint programming approaches for the discretizable molecular distance geometry problem
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
- NMR protein structure calculation and sphere intersections
- A least-squares approach for discretizable distance geometry problems with inexact distances
- Minimal NMR distance information for rigidity of protein graphs
- Maximum feasible subsystems of distance geometry constraints
- A constrained interval approach to the generalized distance geometry problem
- Using a distributed SDP approach to solve simulated protein molecular conformation problems
- Distance geometry and data science
- A study on the covalent geometry of proteins and its impact on distance geometry
- A quantum approach to the discretizable molecular distance geometry problem
- Unassigned distance geometry and molecular conformation problems
- Distance geometry optimization for protein structures
- A note on the Cayley-Menger determinant and the molecular distance geometry problem
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- New methods for the distance geometry problem
- New error measures and methods for realizing protein graphs from distance data
- Tuning interval branch-and-prune for protein structure determination
This page was built for publication: Recent advances on the interval distance geometry problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1683318)
