A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912665692012544 |
|---|---|
| author | Secchin, Leonardo D. da Rocha, Wagner da Rosa, Mariana Liberti, Leo Lavor, Carlile |
| author_facet | Secchin, Leonardo D. da Rocha, Wagner da Rosa, Mariana Liberti, Leo Lavor, Carlile |
| contents | The Molecular Distance Geometry Problem (MDGP) is essential in structural biology, as it seeks to determine three-dimensional protein structures from partial interatomic distances. Its discretizable subclass (DMDGP) admits an exact combinatorial formulation that enables efficient exploration of the search space. However, in practical settings such as Nuclear Magnetic Resonance (NMR) spectroscopy, distances are available only within uncertainty bounds, leading to the interval variant (\emph{i}DMDGP). We propose a hybrid combinatorial--continuous framework for solving the \emph{i}DMDGP. The method combines an enumeration process derived from the DMDGP with a continuous refinement stage that minimizes a nonconvex stress function that penalizes deviations from admissible distance intervals. This integration supports a systematic exploration guided by discrete structure and local optimization. The formulation incorporates torsion-angle intervals and chirality constraints through a refined atom ordering that preserves protein-backbone geometry. Numerical experiments show that the approach efficiently reconstructs geometrically valid conformations even under wide distance bounds, whereas most existing studies assume narrow ones. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_19970 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems Secchin, Leonardo D. da Rocha, Wagner da Rosa, Mariana Liberti, Leo Lavor, Carlile Optimization and Control The Molecular Distance Geometry Problem (MDGP) is essential in structural biology, as it seeks to determine three-dimensional protein structures from partial interatomic distances. Its discretizable subclass (DMDGP) admits an exact combinatorial formulation that enables efficient exploration of the search space. However, in practical settings such as Nuclear Magnetic Resonance (NMR) spectroscopy, distances are available only within uncertainty bounds, leading to the interval variant (\emph{i}DMDGP). We propose a hybrid combinatorial--continuous framework for solving the \emph{i}DMDGP. The method combines an enumeration process derived from the DMDGP with a continuous refinement stage that minimizes a nonconvex stress function that penalizes deviations from admissible distance intervals. This integration supports a systematic exploration guided by discrete structure and local optimization. The formulation incorporates torsion-angle intervals and chirality constraints through a refined atom ordering that preserves protein-backbone geometry. Numerical experiments show that the approach efficiently reconstructs geometrically valid conformations even under wide distance bounds, whereas most existing studies assume narrow ones. |
| title | A hybrid combinatorial-continuous strategy for solving molecular distance geometry problems |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2510.19970 |