Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
From MaRDI portal
Publication:1730533
DOI10.1007/s10479-018-2989-6zbMath1429.51011OpenAlexW2887171800WikidataQ62562102 ScholiaQ62562102MaRDI QIDQ1730533
Simon J. L. Billinge, Antonio Mucherino, Phillip M. Duxbury, Douglas S. Gonçalves, Carlile C. Lavor
Publication date: 6 March 2019
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-018-2989-6
Distance geometry (51K99) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Classical or axiomatic geometry and physics (51P05) Statistical mechanics of nanostructures and nanoparticles (82D80)
Related Items (12)
A note on the Cayley-Menger determinant and the molecular distance geometry problem ⋮ Unassigned distance geometry and molecular conformation problems ⋮ Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem ⋮ Comments on: ``Distance geometry and data science ⋮ Oriented conformal geometric algebra and the molecular distance geometry problem ⋮ NMR protein structure calculation and sphere intersections ⋮ 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 ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances ⋮ Coordinate Difference Matrices ⋮ On the polynomiality of finding \(^K\text{DMDGP}\) re-orders ⋮ A quantum approach to the discretizable molecular distance geometry problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The unassigned distance geometry problem
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for protein side chains
- Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
- New error measures and methods for realizing protein graphs from distance data
- On the computation of protein backbones by using artificial backbones of hydrogens
- Convergence of the majorization method for multidimensional scaling
- The theory and practice of distance geometry
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis
- Clifford algebra and the discretizable molecular distance geometry problem
- Extending the geometric build-up algorithm for the molecular distance geometry problem
- Rigidity of multi-graphs. I: Linking rigid bodies in n-space
- An algorithm for two-dimensional rigidity percolation: The pebble game
- A symmetry-based splitting strategy for discretizable distance geometry problems
- Recent advances on the interval distance geometry problem
- A new algorithm for the small-field astrometric point-pattern matching problem
- Tuning interval branch-and-prune for protein structure determination
- Connected rigidity matroids and unique realizations of graphs
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix
- A least-squares approach for discretizable distance geometry problems with inexact distances
- The \(K\)-discretization and \(K\)-incident graphs for discretizable distance geometry
- Open research areas in distance geometry
- Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem
- 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
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- Generic global rigidity
- A point set puzzle revisited
- On graphs and rigidity of plane skeletal structures
- Six mathematical gems from the history of distance geometry
- Optimal partial discretization orders for discretizable distance geometry
- Distance Geometry Methods for Protein Structure Determination
- Distance Geometry in Structural Biology: New Perspectives
- An Overview on Protein Structure Determination by NMR: Historical and Future Perspectives of the use of Distance Geometry Methods
- Distance Geometry
- Molecular distance geometry methods: from continuous to discrete
- Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint
- WHICH POINT CONFIGURATIONS ARE DETERMINED BY THE DISTRIBUTION OF THEIR PAIRWISE DISTANCES?
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Characterizing generic global rigidity
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Cayley-Menger coordinates.
- Two-Point Step Size Gradient Methods
- Conditions for Unique Graph Realizations
- An efficient algorithm for testing the generic rigidity of graphs in the plane
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Clifford algebra and discretizable distance geometry
- An Introduction to Distance Geometry applied to Molecular Geometry
- A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
- On the Exact Solution of the Distance Geometry with Interval Distances in Dimension 1
- Sampling Sparse Signals on the Sphere: Algorithms and Applications
- A Geometric Algebra Invitation to Space-Time Physics, Robotics and Molecular Geometry
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- The Molecule Problem: Exploiting Structure in Global Optimization
- On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
- Euclidean Distance Geometry
- Fundamental Limits on Synchronizing Clocks Over Networks
- Feasibility check for the distance geometry problem: an application to molecular conformations
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Preface
This page was built for publication: Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
