A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data

DOI10.1023/A:1023221624213zbMath1032.92036OpenAlexW4240501996MaRDI QIDQ1422891

Qunfeng Dong, Zhi-jun Wu

Publication date: 12 February 2004

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

Full work available at URL: https://doi.org/10.1023/a:1023221624213

zbMATH Keywords

Molecular distance geometryNumerical linear algebra and optimizationProtein structure determination

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Numerical linear algebra (65F99)

Related Items (23)

Solving molecular distance geometry problems by global optimization algorithms ⋮ An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data ⋮ A least-squares approach for discretizable distance geometry problems with inexact distances ⋮ Recent advances on the discretizable molecular distance geometry problem ⋮ Recent advances on the interval distance geometry problem ⋮ Distance Geometry on the Sphere ⋮ Solving a generalized distance geometry problem for protein structure determination ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN ⋮ Geometric buildup algorithms for sensor network localization ⋮ On the number of realizations of certain Henneberg graphs arising in protein conformation ⋮ Rigid versus unique determination of protein structures with geometric buildup ⋮ Discretization vertex orders in distance geometry ⋮ Discretization orders for distance geometry problems ⋮ The discretizable molecular distance geometry problem ⋮ Molecular conformation search by distance matrix perturbations ⋮ Extending the geometric build-up algorithm for the molecular distance geometry problem ⋮ Euclidean Distance Matrices and Applications ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances ⋮ Solving Distance Geometry Problem with Inexact Distances in Integer Plane ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation ⋮ SOLVING SPATIAL CONSTRAINTS WITH GLOBAL DISTANCE COORDINATE SYSTEM

This page was built for publication: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data