A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation

DOI10.1007/s11538-009-9431-9zbMath1180.92029OpenAlexW1971117290WikidataQ44547600 ScholiaQ44547600MaRDI QIDQ1048270

Atilla Sit, Zhi-jun Wu, Ya-Xiang Yuan

Publication date: 11 January 2010

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11538-009-9431-9

zbMATH Keywords

distance geometrybiomolecular modelinglinear and nonlinear systems of equationsprotein structure determinationlinear and nonlinear optimization

Mathematics Subject Classification ID

Probabilistic models, generic numerical methods in probability and statistics (65C20) Applications of mathematical programming (90C90) Biochemistry, molecular biology (92C40) Eigenvalues, singular values, and eigenvectors (15A18) Biophysics (92C05) Computational methods for problems pertaining to biology (92-08)

Related Items (6)

A least-squares approach for discretizable distance geometry problems with inexact distances ⋮ Recent advances on the discretizable molecular distance geometry problem ⋮ Solving a generalized distance geometry problem for protein structure determination ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Geometric buildup algorithms for sensor network localization ⋮ Rigid versus unique determination of protein structures with geometric buildup

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Solving molecular distance geometry problems by global optimization algorithms
• The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
• A stochastic/perturbation global optimization algorithm for distance geometry problems
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
• Distance geometry optimization for protein structures
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
• Solution of the embedding problem and decomposition of symmetric matrices.
• Cayley-Menger coordinates.
• Conditions for Unique Graph Realizations
• Global Continuation for Distance Geometry Problems
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• The Molecule Problem: Exploiting Structure in Global Optimization

This page was built for publication: A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation