Extending the geometric build-up algorithm for the molecular distance geometry problem

DOI10.1016/j.ipl.2008.05.009zbMath1191.68772WikidataQ62562210 ScholiaQ62562210MaRDI QIDQ975461

Ricardo dos Santos Carvalho, Fábio Protti, Carlile C. Lavor

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.05.009

zbMATH Keywords

algorithms; computational biology; molecular distance geometry problem; NMR spectroscopy; geometric build-up algorithm

Mathematics Subject Classification ID

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

Related Items

Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, On the computation of protein backbones by using artificial backbones of hydrogens, Discretization orders for distance geometry problems, The discretizable molecular distance geometry problem, Minimal NMR distance information for rigidity of protein graphs, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, A quantum approach to the discretizable molecular distance geometry problem, A note on the Cayley-Menger determinant and the molecular distance geometry problem, A constrained interval approach to the generalized distance geometry problem, NMR protein structure calculation and sphere intersections, On the optimality of finding DMDGP symmetries, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, Euclidean Distance Matrices and Applications, Molecular distance geometry methods: from continuous to discrete

Cites Work

• Unnamed Item
• Unnamed Item
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
• Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
• Distance geometry optimization for protein structures
• Optimization in computational chemistry and molecular biology. Local and global approaches. Conference, Princeton Univ., Princeton, NJ, USA, May 7--9, 1999
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
• Molecular Modeling of Proteins and Mathematical Prediction of Protein Structure
• Global Continuation for Distance Geometry Problems
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• The Molecule Problem: Exploiting Structure in Global Optimization
• Computational Experience with the Molecular Distance Geometry Problem