scientific article; zbMATH DE number 841190

MaRDI QIDQ4863354zbMATH OpenFDO

Authors

Publication date 26 February 1997

zbMATH Keywords

global minimumapproximationsdiscrete Gauss transformdistance geometry problem

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40) Numerical quadrature and cubature formulas (65D32) Analysis of algorithms and problem complexity (68Q25) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A stochastic/perturbation global optimization algorithm for distance geometry problems
• Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
• 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

Cited in

(8)

• Embedding with a rigid substructure
• Solving a generalized distance geometry problem for protein structure determination
• A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
• Global Continuation for Distance Geometry Problems
• On the reconstruction of three-dimensional protein structures from contact maps
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• Least-squares approximations in geometric buildup for solving distance geometry problems
• Geometric buildup algorithms for sensor network localization

This page was built for publication:

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