Extending the geometric build-up algorithm for the molecular distance geometry problem

Cites Work

Title not available (Why is that?)
An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
The Molecule Problem: Exploiting Structure in Global Optimization
A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
Global Continuation for Distance Geometry Problems
Computational Experience with the Molecular Distance Geometry Problem
Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
Distance geometry optimization for protein structures
A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
Reliable computation of the points of intersection of \(n\) spheres in \({\mathbb{R}}^n\)

Cited In (24)

Euclidean Distance Matrices and Applications
Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Double variable neighbourhood search with smoothing for the molecular distance geometry problem
On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
Hyperbolic smoothing and penalty techniques applied to molecular structure determination
A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
NMR protein structure calculation and sphere intersections
The discretizable molecular distance geometry problem
Molecular distance geometry methods: from continuous to discrete
Minimal NMR distance information for rigidity of protein graphs
On the computation of protein backbones by using artificial backbones of hydrogens
A constrained interval approach to the generalized distance geometry problem
A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
A quantum approach to the discretizable molecular distance geometry problem
A note on the Cayley-Menger determinant and the molecular distance geometry problem
On the optimality of finding DMDGP symmetries
Discretization orders for distance geometry problems
Least-squares approximations in geometric buildup for solving distance geometry problems
Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
Recent advances on the discretizable molecular distance geometry problem
Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
The discretizable distance geometry problem

   Recommendations

A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data 👍 👎
The discretizable molecular distance geometry problem 👍 👎
Recent advances on the discretizable molecular distance geometry problem 👍 👎
An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data 👍 👎
Distance geometry methods for protein structure determination 👍 👎

This page was built for publication: Extending the geometric build-up algorithm for the molecular distance geometry problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q975461)