Rigid versus unique determination of protein structures with geometric buildup

DOI10.1007/s11590-007-0060-7zbMath1144.92017MaRDI QIDQ941022

Di Wu, Ya-Xiang Yuan, Zhi-jun Wu

Publication date: 4 September 2008

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-007-0060-7

zbMATH Keywords

distance geometry; graph embedding; biomolecular modeling; linear and nonlinear systems of equations; protein structure determination; linear and nonlinear optimization

Mathematics Subject Classification ID

92C40: Biochemistry, molecular biology

92-08: Computational methods for problems pertaining to biology

Related Items

The unassigned distance geometry problem, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Solving a generalized distance geometry problem for protein structure determination, On the computation of protein backbones by using artificial backbones of hydrogens, Algorithm engineering for optimal alignment of protein structure distance matrices, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, Recent advances on the interval distance geometry problem, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Geometric buildup algorithms for sensor network localization, A constrained interval approach to the generalized distance geometry problem, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, Euclidean Distance Matrices and Applications, Molecular distance geometry methods: from continuous to discrete, A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Molecular modeling and simulation. An interdisciplinary guide.
• 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
• Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• Solution of the embedding problem and decomposition of symmetric matrices.
• Cayley-Menger coordinates.
• The Molecule Problem: Exploiting Structure in Global Optimization