Solving a generalized distance geometry problem for protein structure determination

DOI10.1007/s11538-011-9644-6zbMath1402.92333WikidataQ30400999 ScholiaQ30400999MaRDI QIDQ417280

Atilla Sit, Zhi-jun Wu

Publication date: 14 May 2012

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

Full work available at URL: https://doi.org/10.1007/s11538-011-9644-6

zbMATH Keywords

biomolecular modeling; constrained and unconstrained optimization; linear and nonlinear systems of equations; molecular distance geometry; protein structure determination

Mathematics Subject Classification ID

92D20: Protein sequences, DNA sequences

51K05: General theory of distance geometry

Related Items

Recent advances on the interval distance geometry problem, Geometric buildup algorithms for sensor network localization, A constrained interval approach to the generalized distance geometry problem, Optimal partial discretization orders for discretizable distance geometry

Uses Software

• CNS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• Rigid versus unique determination of protein structures with geometric buildup
• 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
• 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
• Numerical Optimization