Pages that link to "Item:Q1969508"

The following pages link to Distance geometry optimization for protein structures (Q1969508):

Displaying 35 items.

• Hyperbolic smoothing and penalty techniques applied to molecular structure determination (Q408445) (← links)
• Discretization orders and efficient computation of Cartesian coordinates for distance geometry (Q476278) (← links)
• New error measures and methods for realizing protein graphs from distance data (Q517453) (← 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)
• Semidefinite programming for discrete optimization and matrix completion problems (Q697582) (← links)
• Solving molecular distance geometry problems by global optimization algorithms (Q842778) (← links)
• Extending the geometric build-up algorithm for the molecular distance geometry problem (Q975461) (← links)
• An application of a global optimization parametrization method on macromolecular structure problem (Q990575) (← 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)
• On the uniqueness of Euclidean distance matrix completions. (Q1405021) (← links)
• Ab-initio prediction and reliability of protein structural genomics by PROPAINOR algorithm (Q1414257) (← links)
• A symmetry-based splitting strategy for discretizable distance geometry problems (Q1668793) (← links)
• Recent advances on the interval distance geometry problem (Q1683318) (← links)
• An optimization approach to the problem of protein structure prediction (Q1764247) (← links)
• On the uniqueness of Euclidean distance matrix completions: the case of points in general position (Q1774976) (← links)
• The discretizable distance geometry problem (Q1926615) (← links)
• A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances (Q2041974) (← links)
• Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension (Q2274754) (← links)
• A Euclidean distance matrix model for protein molecular conformation (Q2307747) (← links)
• An improved hybrid global optimization method for protein tertiary structure prediction (Q2379695) (← links)
• An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data (Q2385507) (← links)
• A DC programming approach for sensor network localization with uncertainties in anchor positions (Q2438403) (← links)
• Molecular conformation search by distance matrix perturbations (Q2485885) (← links)
• Euclidean Distance Matrices and Applications (Q2802549) (← links)
• Solving Distance Geometry Problem with Inexact Distances in Integer Plane (Q2815204) (← links)
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem (Q3502133) (← links)
• (Q5111761) (← links)
• Euclidean distance matrix completion problems (Q5200557) (← links)
• Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach (Q5252588) (← links)
• Global optimization based on local searches (Q5920293) (← links)
• Global optimization based on local searches (Q5925165) (← links)
• Positive semidefinite relaxations for distance geometry problems. (Q5960873) (← links)