A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
From MaRDI portal
Publication:598608
DOI10.1023/A:1013857218127zbMath1045.90093OpenAlexW2105632699MaRDI QIDQ598608
Publication date: 12 August 2004
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1013857218127
Applications of mathematical programming (90C90) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)
Related Items (29)
The unassigned distance geometry problem ⋮ An algorithm for realizing Euclidean distance matrices ⋮ An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data ⋮ Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem ⋮ A least-squares approach for discretizable distance geometry problems with inexact distances ⋮ A constrained interval approach to the generalized distance geometry problem ⋮ Recent advances on the discretizable molecular distance geometry problem ⋮ Recent advances on the interval distance geometry problem ⋮ A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem ⋮ Hyperbolic smoothing and penalty techniques applied to molecular structure determination ⋮ On a Relationship Between Graph Realizability and Distance Matrix Completion ⋮ Solving a generalized distance geometry problem for protein structure determination ⋮ A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems ⋮ Least-squares approximations in geometric buildup for solving distance geometry problems ⋮ Geometric buildup algorithms for sensor network localization ⋮ Minimal NMR distance information for rigidity of protein graphs ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Rigid versus unique determination of protein structures with geometric buildup ⋮ Assigned and unassigned distance geometry: applications to biological molecules and nanostructures ⋮ The discretizable molecular distance geometry problem ⋮ On the computation of protein backbones by using artificial backbones of hydrogens ⋮ Extending the geometric build-up algorithm for the molecular distance geometry problem ⋮ Euclidean Distance Matrices and Applications ⋮ Unnamed Item ⋮ Solving Distance Geometry Problem with Inexact Distances in Integer Plane ⋮ Molecular distance geometry methods: from continuous to discrete ⋮ Double variable neighbourhood search with smoothing for the molecular distance geometry problem ⋮ Using a CAS/DGS to analyze computationally the configuration of planar bar linkage mechanisms based on partial Latin squares ⋮ A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
This page was built for publication: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
