A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
From MaRDI portal
Publication:1422891
DOI10.1023/A:1023221624213zbMath1032.92036MaRDI QIDQ1422891
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
Molecular distance geometry; Numerical linear algebra and optimization; Protein structure determination
65K10: Numerical optimization and variational techniques
92E10: Molecular structure (graph-theoretic methods, methods of differential topology, etc.)
65F99: Numerical linear algebra
Related Items
A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, Solving a generalized distance geometry problem for protein structure determination, Discretization vertex orders in distance geometry, Least-squares approximations in geometric buildup for solving distance geometry problems, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, Solving molecular distance geometry problems by global optimization algorithms, Rigid versus unique determination of protein structures with geometric buildup, Extending the geometric build-up algorithm for the molecular distance geometry problem, A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation, Recent advances on the interval distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Geometric buildup algorithms for sensor network localization, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, A least-squares approach for discretizable distance geometry problems with inexact distances, An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data, On the number of realizations of certain Henneberg graphs arising in protein conformation, Molecular conformation search by distance matrix perturbations, Euclidean Distance Matrices and Applications, Solving Distance Geometry Problem with Inexact Distances in Integer Plane, Distance Geometry on the Sphere, Molecular distance geometry methods: from continuous to discrete, SOLVING SPATIAL CONSTRAINTS WITH GLOBAL DISTANCE COORDINATE SYSTEM
