Extending the geometric build-up algorithm for the molecular distance geometry problem
From MaRDI portal
(Redirected from Publication:975461)
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
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- 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
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Computational Experience with the Molecular Distance Geometry Problem
- Distance geometry optimization for protein structures
- Global Continuation for Distance Geometry Problems
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
- 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\)
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- The Molecule Problem: Exploiting Structure in Global Optimization
Cited in
(28)- Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
- NMR protein structure calculation and sphere intersections
- On generating instances for the modular distance geometry problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A constrained interval approach to the generalized distance geometry problem
- On the computation of protein backbones by using artificial backbones of hydrogens
- Euclidean distance matrices and applications
- 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
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- The discretizable molecular distance geometry problem
- On the polynomiality of finding \(^K\text{DMDGP}\) re-orders
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Discretization orders for distance geometry problems
- 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
- The discretizable distance geometry problem
- Maxent-stress optimization of 3D biomolecular models
- Recent advances on the discretizable molecular distance geometry problem
- Molecular distance geometry methods: from continuous to discrete
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Minimal NMR distance information for rigidity of protein graphs
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- A note on the Cayley-Menger determinant and the molecular distance geometry problem
- On the optimality of finding DMDGP symmetries
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
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)