Solving molecular distance geometry problems by global optimization algorithms
From MaRDI portal
Recommendations
- Computational Experience with the Molecular Distance Geometry Problem
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- The discretizable molecular distance geometry problem
- Global Continuation for Distance Geometry Problems
- Global optimization for atomic cluster distance geometry problems
Cites work
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A population-based approach for hard global optimization problems based on dissimilarity measures
- An experimental analysis of a population based approach for global optimization
- Distance geometry optimization for protein structures
- Efficient algorithms for large scale global optimization: Lennard-Jones clusters
- Global Continuation for Distance Geometry Problems
- Global optima of Lennard-Jones clusters
- Global optimization of Morse clusters by potential energy transformations
- Global optimization on funneling landscapes
- On the multilevel structure of global optimization problems
Cited in
(17)- Global optimization for atomic cluster distance geometry problems
- 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
- Global optimization for molecular conformation problems
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- The discretizable molecular distance geometry problem
- Solving a generalized distance geometry problem for protein structure determination
- A mesh adaptive basin hopping method for the design of circular antenna arrays
- Dissimilarity measures for population-based global optimization algorithms
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Efficient Global Geometry Optimization of Atomic and Molecular Clusters
- Molecular distance geometry methods: from continuous to discrete
- A nested heuristic for parameter tuning in support vector machines
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- Computational Experience with the Molecular Distance Geometry Problem
This page was built for publication: Solving molecular distance geometry problems by global optimization algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q842778)
