An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data

DOI10.1007/S10898-006-9080-6zbMATH Open1119.92032OpenAlexW2110543129MaRDI QIDQ2385507FDOQ2385507

Authors: Di Wu, Zhijun Wu 

Publication date: 12 October 2007

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-006-9080-6

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

zbMATH Keywords

Protein structure determinationDistance geometryRoot-mean-square deviation

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites Work

• Title not available (Why is that?)
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• The Molecule Problem: Exploiting Structure in Global Optimization
• Title not available (Why is that?)
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Global Continuation for Distance Geometry Problems
• The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
• Distance geometry optimization for protein structures
• Title not available (Why is that?)
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (21)

• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• The unassigned distance geometry problem
• A note on computing the intersection of spheres in \(\mathbb{R}^n\)
• Recent advances on the interval distance geometry problem
• Hyperbolic smoothing and penalty techniques applied to molecular structure determination
• 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
• Molecular distance geometry methods: from continuous to discrete
• On the computation of protein backbones by using artificial backbones of hydrogens
• 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
• 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

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)