Molecular conformation search by distance matrix perturbations
From MaRDI portal
Publication:2485885
Recommendations
Cites work
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Computing Most Nearly Rank-Reducing Structured Matrix Perturbations
- Distance geometry optimization for protein structures
- Problems of distance geometry and convex properties of quadratic maps
- Shortest-path problems and molecular conformation
- The Componentwise Distance to the Nearest Singular Matrix
- The Euclidian Distance Matrix Completion Problem
- The best Euclidean fit to a given distance matrix in prescribed dimensions
Cited in
(10)- Algebraic algorithms for structure determination in biological chemistry
- Euclidean distance matrices and applications
- Reconstructing a three-dimensional model with arbitrary errors
- The embedding problem for predistance matrices
- scientific article; zbMATH DE number 3895768 (Why is no real title available?)
- Molecular alignment as a penalized permutation Procrustes problem
- A Euclidean distance matrix model for protein molecular conformation
- Maxent-stress optimization of 3D biomolecular models
- scientific article; zbMATH DE number 1522763 (Why is no real title available?)
- Distance geometry for realistic molecular conformations
This page was built for publication: Molecular conformation search by distance matrix perturbations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485885)