The discretizable molecular distance geometry problem
From MaRDI portal
Publication:694593
DOI10.1007/s10589-011-9402-6zbMath1259.90153arXivq-bio/0608012OpenAlexW1972865089WikidataQ62562164 ScholiaQ62562164MaRDI QIDQ694593
Leo Liberti, Antonio Mucherino, Carlile C. Lavor, Nelson F. Maculan
Publication date: 13 December 2012
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/q-bio/0608012
Related Items
Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem, A note on the Cayley-Menger determinant and the molecular distance geometry problem, Unassigned distance geometry and molecular conformation problems, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, The referenced vertex ordering problem: theory, applications, and solution methods, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, A symmetry-based splitting strategy for discretizable distance geometry problems, A least-squares approach for discretizable distance geometry problems with inexact distances, An integer programming approach for the search of discretization orders in distance geometry problems, The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry, A constrained interval approach to the generalized distance geometry problem, An application-based characterization of dynamical distance geometry problems, The discretizable distance geometry problem, Recent advances on the discretizable molecular distance geometry problem, Recent advances on the interval distance geometry problem, Clifford algebra and the discretizable molecular distance geometry problem, Constraint programming approaches for the discretizable molecular distance geometry problem, On distance graph coloring problems, Boolean combination of circular arcs using orthogonal spheres, Distance geometry and data science, On a Relationship Between Graph Realizability and Distance Matrix Completion, Cycle-based formulations in distance geometry, Distance Geometry on the Sphere, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, A study on the covalent geometry of proteins and its impact on distance geometry, Solving Partial Differential Equations on Manifolds From Incomplete Interpoint Distance, Efficient development of competitive Mathematica solutions based on geometric algebra with GAALOPWeb, A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN, On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1, On the number of realizations of certain Henneberg graphs arising in protein conformation, Realizing Euclidean distance matrices by sphere intersection, Minimal NMR distance information for rigidity of protein graphs, On the embedding of cone graphs in the line with distinct distances between neighbors, Oriented conformal geometric algebra and the molecular distance geometry problem, Discretization orders and efficient computation of Cartesian coordinates for distance geometry, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, Discretization orders for protein side chains, Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint, NMR protein structure calculation and sphere intersections, Discretization vertex orders in distance geometry, Assigned and unassigned distance geometry: applications to biological molecules and nanostructures, On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data, On the optimality of finding DMDGP symmetries, New error measures and methods for realizing protein graphs from distance data, Discretization orders for distance geometry problems, Geometric algebra to describe the exact discretizable molecular distance geometry problem for an arbitrary dimension, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, Solving Distance Geometry Problem with Inexact Distances in Integer Plane, Optimal partial discretization orders for discretizable distance geometry, Diagonally Dominant Programming in Distance Geometry, On the polynomiality of finding \(^K\text{DMDGP}\) re-orders, Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis, A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
- On the computation of protein backbones by using artificial backbones of hydrogens
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Discretization orders for distance geometry problems
- Molecular modeling and simulation. An interdisciplinary guide
- Solving molecular distance geometry problems by global optimization algorithms
- Theory of semidefinite programming for sensor network localization
- Equality relating Euclidean distance cone to positive semidefinite cone
- Rigid versus unique determination of protein structures with geometric buildup
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Double variable neighbourhood search with smoothing for the molecular distance geometry problem
- The Solution of the Metric STRESS and SSTRESS Problems in Multidimensional Scaling Using Newtons Method
- A stochastic/perturbation global optimization algorithm for distance geometry problems
- An interior-point method for approximate positive semidefinite completions
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems
- Recent advances on the discretizable molecular distance geometry problem
- Distance geometry optimization for protein structures
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- Generic global rigidity
- The lattice of faces of a finite dimensional cone
- Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert
- Molecular distance geometry methods: from continuous to discrete
- Reconstructing a three-dimensional model with arbitrary errors
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- A Distributed SDP Approach for Large-Scale Noisy Anchor-Free Graph Realization with Applications to Molecular Conformation
- Rigid and Flexible Frameworks
- Global Continuation for Distance Geometry Problems
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- The Molecule Problem: Exploiting Structure in Global Optimization
- On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
- Computational Experience with the Molecular Distance Geometry Problem
- MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
