New error measures and methods for realizing protein graphs from distance data
From MaRDI portal
Publication:517453
DOI10.1007/s00454-016-9846-7zbMath1358.05085arXiv1607.00868OpenAlexW2963780538WikidataQ62562115 ScholiaQ62562115MaRDI QIDQ517453
Claudia D'Ambrosio, Leo Liberti, K. H. Vu, Carlile C. Lavor, Nelson F. Maculan
Publication date: 23 March 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1607.00868
Applications of graph theory (05C90) Semidefinite programming (90C22) Quadratic programming (90C20) Planar graphs; geometric and topological aspects of graph theory (05C10) Protein sequences, DNA sequences (92D20) Distance in graphs (05C12)
Related Items
A note on the Cayley-Menger determinant and the molecular distance geometry problem, Maximum feasible subsystems of distance geometry constraints, Unassigned distance geometry and molecular conformation problems, A multiplicative weights update algorithm for MINLP, Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem, Cycle-based formulations in distance geometry, A linear program for points of interest relocation in adaptive maps, Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures, 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, Barvinok's naive algorithm in distance geometry, A cycle-based formulation for the distance geometry problem, 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
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- A recipe for finding good solutions to MINLPs
- Discretization vertex orders in distance geometry
- Angular synchronization by eigenvectors and semidefinite programming
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Clifford algebra and the discretizable molecular distance geometry problem
- Solving Euclidean distance matrix completion problems via semidefinite progrmming
- Congruence, similarity, and symmetries of geometric objects
- Distance geometry optimization for protein structures
- The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances
- A multiplicative weights update algorithm for MINLP
- On the number of realizations of certain Henneberg graphs arising in protein conformation
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- PhaseLift: Exact and Stable Signal Recovery from Magnitude Measurements via Convex Programming
- The Discretizable Molecular Distance Geometry Problem seems Easier on Proteins
- Distance Geometry in Structural Biology: New Perspectives
- Molecular distance geometry methods: from continuous to discrete
- Branching and bounds tighteningtechniques for non-convex MINLP
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Reformulations in Mathematical Programming: Definitions and Systematics
- An optimal algorithm for geometrical congruence
- Fast Approximation Algorithms for Fractional Packing and Covering Problems
- Euclidean Distance Geometry and Applications
- Counting the Number of Solutions of KDMDGP Instances
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Algorithms in real algebraic geometry
- Positive semidefinite relaxations for distance geometry problems.
