An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
From MaRDI portal
Publication:2385507
Recommendations
- 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 geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Extending the geometric build-up algorithm for the molecular distance geometry problem
Cites work
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 1101492 (Why is no real title available?)
- scientific article; zbMATH DE number 1552035 (Why is no real title available?)
- scientific article; zbMATH DE number 841190 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (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 Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Distance geometry optimization for protein structures
- Global Continuation for Distance Geometry Problems
- The Molecule Problem: Exploiting Structure in Global Optimization
- The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
Cited in
(21)- Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
- The unassigned distance geometry problem
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- A note on computing the intersection of spheres in \(\mathbb{R}^n\)
- Recent advances on the interval distance geometry problem
- Reconstructing a three-dimensional model with arbitrary errors
- Solving a generalized distance geometry problem for protein structure determination
- Rigid versus unique determination of protein structures with geometric buildup
- The discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- On the computation of protein backbones by using artificial backbones of hydrogens
- Molecular distance geometry methods: from continuous to discrete
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Discretization orders for distance geometry problems
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Geometric buildup algorithms for sensor network localization
- Euclidean distance matrices and applications
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- Recent advances on the discretizable molecular distance geometry problem
- The discretizable distance geometry problem
This page was built for publication: An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2385507)
