Solving molecular distance geometry problems by global optimization algorithms
From MaRDI portal
Publication:842778
DOI10.1007/s10589-007-9127-8zbMath1176.90567OpenAlexW2068773600MaRDI QIDQ842778
Andrea Grosso, Fabio Schoen, Marco Locatelli
Publication date: 25 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9127-8
Related Items
A nested heuristic for parameter tuning in support vector machines, A mesh adaptive basin hopping method for the design of circular antenna arrays, Least-squares approximations in geometric buildup for solving distance geometry problems, Discretization orders and efficient computation of Cartesian coordinates for distance geometry, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens, A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling, Molecular distance geometry methods: from continuous to discrete, A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
Cites Work
- Unnamed Item
- A population-based approach for hard global optimization problems based on dissimilarity measures
- Global optima of Lennard-Jones clusters
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- On the multilevel structure of global optimization problems
- Distance geometry optimization for protein structures
- An experimental analysis of a population based approach for global optimization
- Global Optimization of Morse Clusters by Potential Energy Transformations
- Global Continuation for Distance Geometry Problems
- Global optimization on funneling landscapes
