Distance geometry optimization for protein structures
From MaRDI portal
Recommendations
- Distance geometry methods for protein structure determination
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- Global Continuation for Distance Geometry Problems
- Solving a generalized distance geometry problem for protein structure determination
- Recent advances on the interval distance geometry problem
Cited in
(41)- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- On the uniqueness of Euclidean distance matrix completions.
- Ab-initio prediction and reliability of protein structural genomics by PROPAINOR algorithm
- A symmetry-based splitting strategy for discretizable distance geometry problems
- Recent advances on the interval distance geometry problem
- An optimization approach to the problem of protein structure prediction
- On the uniqueness of Euclidean distance matrix completions: the case of points in general position
- The discretizable distance geometry problem
- A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
- Maximum feasible subsystems of distance geometry constraints
- Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension
- A Euclidean distance matrix model for protein molecular conformation
- An improved hybrid global optimization method for protein tertiary structure prediction
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- A DC programming approach for sensor network localization with uncertainties in anchor positions
- Molecular conformation search by distance matrix perturbations
- Euclidean distance matrices and applications
- Solving distance geometry problem with inexact distances in integer plane
- Distance geometry methods for protein structure determination
- DC programming approaches for distance geometry problems
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- Solving a generalized distance geometry problem for protein structure determination
- scientific article; zbMATH DE number 6875040 (Why is no real title available?)
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Maxent-stress optimization of 3D biomolecular models
- New error measures and methods for realizing protein graphs from distance data
- Euclidean distance matrix completion problems
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- scientific article; zbMATH DE number 223921 (Why is no real title available?)
- On the computation of protein backbones by using artificial backbones of hydrogens
- Global optimization based on local searches
- Global optimization based on local searches
- Positive semidefinite relaxations for distance geometry problems.
- Least-squares approximations in geometric buildup for solving distance geometry problems
- The discretizable molecular distance geometry problem
- Semidefinite programming for discrete optimization and matrix completion problems
- Solving molecular distance geometry problems by global optimization algorithms
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- An application of a global optimization parametrization method on macromolecular structure problem
This page was built for publication: Distance geometry optimization for protein structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1969508)
