Optimal partial discretization orders for discretizable distance geometry
From MaRDI portal
Publication:2827765
DOI10.1111/itor.12249zbMath1348.90595OpenAlexW2402930152MaRDI QIDQ2827765
Antonio Mucherino, Douglas S. Gonçalves
Publication date: 21 October 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12249
Related Items (7)
The referenced vertex ordering problem: theory, applications, and solution methods ⋮ 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 ⋮ Constraint programming approaches for the discretizable molecular distance geometry problem ⋮ On distance graph coloring problems ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
Cites Work
- Sensor network localization, Euclidean distance matrix completions, and graph realization
- Solving a generalized distance geometry problem for protein structure determination
- Discretization orders and efficient computation of Cartesian coordinates for distance geometry
- Discretization orders for protein side chains
- Discretization orders for distance geometry problems
- The discretizable molecular distance geometry problem
- Hierarchical optimization: An introduction
- The discretizable 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
- An overview of bilevel optimization
- 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
- A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Distributed Clock Synchronization for Wireless Sensor Networks Using Belief Propagation
- Fundamental Limits on Synchronizing Clocks Over Networks
- Euclidean Distance Geometry and Applications
- On the Identification of Discretization Orders for Distance Geometry with Intervals
- Preface
This page was built for publication: Optimal partial discretization orders for discretizable distance geometry
