Rigid versus unique determination of protein structures with geometric buildup
From MaRDI portal
Publication:941022
Recommendations
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Distance geometry methods for protein structure determination
- Solving a generalized distance geometry problem for protein structure determination
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
Cites work
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Cayley-Menger coordinates.
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- scientific article; zbMATH DE number 3080144 (Why is no real title available?)
- Molecular modeling and simulation. An interdisciplinary guide.
- Solution of the embedding problem and decomposition of symmetric matrices.
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- The Molecule Problem: Exploiting Structure in Global Optimization
Cited in
(22)- Retro-leapfrog and structure elucidation
- Recent advances on the interval distance geometry problem
- Intrinsic protein geometry with application to non-proline \textit{cis} peptide planes
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- Geometric buildup algorithms for sensor network localization
- A constrained interval approach to the generalized distance geometry problem
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Geometric restrictions on producible polygonal protein chains
- The unassigned distance geometry problem
- Euclidean distance matrices and applications
- Distance geometry methods for protein structure determination
- Molecular distance geometry methods: from continuous to discrete
- 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
- Uniqueness and degeneracy in the localization of rigid structural elements in paramagnetic proteins
- On the computation of protein backbones by using artificial backbones of hydrogens
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Algorithm engineering for optimal alignment of protein structure distance matrices
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
This page was built for publication: Rigid versus unique determination of protein structures with geometric buildup
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q941022)
