An Angle-Based Algorithmic Framework for the Interval Discretizable Distance Geometry Problem

arXiv:2508.09143 · q-bio.BM, math.MG · Submitted 2025-07-29 · Read on arXiv

q-bio.BM, math.MG

Submitted: 2025-07-29

Updated: 2026-09-24

Code: https://github.com/wdarocha/benchmarks

Terminology

• Distance Geometry Problem — 17× in this paper
• Molecular Distance Geometry Problem — 9× in this paper
• Pruning — 5× in this paper · explained in 4 episodes
• Nuclear Magnetic Resonance — 4× in this paper
• Protein Data Bank — 4× in this paper
• Discretizable Distance Geometry Problem — 3× in this paper
• Accuracy — 2× in this paper · explained in 1 episode
• Consistency — 2× in this paper · explained in 3 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Benchmark — 1× in this paper · explained in 2 episodes
• Core — 1× in this paper · explained in 2 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Largest Distance Error — 1× in this paper
• Root Mean Square Deviation — 1× in this paper
• Verification — 1× in this paper · explained in 2 episodes

Related papers

• Speak to a Protein: An Interactive Multimodal Co-Scientist
• Learning Topological Representations of Protein Structure and Dynamics
• p2smi: A Python Toolkit for Peptide FASTA-to-SMILES Conversion and Molecular Property Analysis
• UNAAGI: Atom-Level Diffusion for Generating Non-Canonical Amino Acid Substitutions
• Co-folding with a Soup of Representations
• Non-Markovain Quantum State Diffusion for the Tunneling in SARS-COVID-19 virus