A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems

DOI10.1007/s10589-023-00526-8OpenAlexW4387020945MaRDI QIDQ6155061

Emerson Vitor Castelani, Guilherme Philippi, Felipe Fidalgo

Publication date: 16 February 2024

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-023-00526-8

zbMATH Keywords

distance geometryquaternionsnumerical optimizationbranch-and-pruneprotein conformation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• The discretizable molecular distance geometry problem
• Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
• Minimal NMR distance information for rigidity of protein graphs
• The discretizable distance geometry problem
• A least-squares approach for discretizable distance geometry problems with inexact distances
• Distance geometry and data science
• 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
• Six mathematical gems from the history of distance geometry
• Julia: A Fresh Approach to Numerical Computing
• Molecular distance geometry methods: from continuous to discrete
• 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
• Global Continuation for Distance Geometry Problems
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Euclidean Distance Geometry
• Euclidean Distance Geometry and Applications
• MD-jeep: An Implementation of a Branch and Prune Algorithm for Distance Geometry Problems
• Benchmarking optimization software with performance profiles.

This page was built for publication: A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems