Pages that link to "Item:Q842778"
From MaRDI portal
The following pages link to Solving molecular distance geometry problems by global optimization algorithms (Q842778):
Displaying 16 items.
- A nested heuristic for parameter tuning in support vector machines (Q336941) (← links)
- Solving a generalized distance geometry problem for protein structure determination (Q417280) (← links)
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
- On the computation of protein backbones by using artificial backbones of hydrogens (Q540709) (← links)
- Least-squares approximations in geometric buildup for solving distance geometry problems (Q637550) (← links)
- The discretizable molecular distance geometry problem (Q694593) (← links)
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem (Q1029680) (← links)
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (Q1048270) (← links)
- A stochastic/perturbation global optimization algorithm for distance geometry problems (Q1374376) (← links)
- A novel canonical dual computational approach for prion AGAAAAGA amyloid fibril molecular modeling (Q1786044) (← links)
- A mesh adaptive basin hopping method for the design of circular antenna arrays (Q1935264) (← links)
- Global optimization for molecular conformation problems (Q2368095) (← links)
- Dissimilarity measures for population-based global optimization algorithms (Q2379686) (← links)
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach (Q2841709) (← links)
- Molecular distance geometry methods: from continuous to discrete (Q3087839) (← links)
- Efficient Global Geometry Optimization of Atomic and Molecular Clusters (Q5427976) (← links)
