Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem

DOI10.1016/j.amc.2020.125586OpenAlexW3083889701MaRDI QIDQ2660371

Douglas S. Gonçalves, Luiz Mariano Carvalho, Michael Souza, Antonio Mucherino, Carlile C. Lavor

Publication date: 30 March 2021

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2020.125586

zbMATH Keywords

distance geometryprotein structurebranch-and-prune

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Protein sequences, DNA sequences (92D20) General theory of distance geometry (51K05)

Related Items (2)

Unassigned distance geometry and molecular conformation problems ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances

Uses Software

• iBP

Cites Work

• Discretization vertex orders in distance geometry
• Assigned and unassigned distance geometry: applications to biological molecules and nanostructures
• New error measures and methods for realizing protein graphs from distance data
• A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
• The discretizable molecular distance geometry problem
• Extending the geometric build-up algorithm for the molecular distance geometry problem
• Recent advances on the interval distance geometry problem
• Minimal NMR distance information for rigidity of protein graphs
• Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures
• Tuning interval branch-and-prune for protein structure determination
• 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
• Solving the Discretizable Molecular Distance Geometry Problem by Multiple Realization Trees
• Distance Geometry
• Algorithms and Analytic Solutions Using Sparse Residual Dipolar Couplings for High-Resolution Automated Protein Backbone Structure Determination by NMR
• A Branch‐and‐Prune algorithm for the Molecular Distance Geometry Problem
• A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN
• On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem
• Euclidean Distance Geometry and Applications
• Counting the Number of Solutions of KDMDGP Instances

This page was built for publication: Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem