Discretization vertex orders in distance geometry
From MaRDI portal
Publication:499358
DOI10.1016/j.dam.2014.08.035zbMath1321.05029OpenAlexW2017850362WikidataQ62562138 ScholiaQ62562138MaRDI QIDQ499358
Oktay Günlük, Leo Liberti, Andrea Cassioli, Carlile C. Lavor
Publication date: 30 September 2015
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.08.035
Combinatorial aspects of finite geometries (05B25) Graph algorithms (graph-theoretic aspects) (05C85) Signed and weighted graphs (05C22)
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 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, Integer Programming, Constraint Programming, and Hybrid Decomposition Approaches to 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, A constrained interval approach to the generalized 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, Minimal NMR distance information for rigidity of protein graphs, Oriented conformal geometric algebra and the molecular distance geometry problem, Discretization orders and efficient computation of Cartesian coordinates for distance geometry, Optimal Discretization Orders for Distance Geometry: A Theoretical Standpoint, NMR protein structure calculation and sphere intersections, 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, On distance-preserving elimination orderings in graphs: complexity and algorithms, Tuning interval branch-and-prune for protein structure determination, Preface, A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances, 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
- Geometric science of information. First international conference, GSI 2013, Paris, France, August 28--30, 2013. Proceedings
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Molecular modeling and simulation. An interdisciplinary guide
- Combining variable neighborhood search and estimation of distribution algorithms in the protein side chain placement problem
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- The discretizable distance geometry problem
- Recent advances on the discretizable molecular distance geometry problem
- 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
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- Distance Geometry
- Molecular distance geometry methods: from continuous to discrete
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- On the Identification of Discretization Orders for Distance Geometry with Intervals
