arXiv (All)
open access
An Angle-Based Algorithmic Framework for the Interval Discretizable Distance Geometry Problem
Distance Geometry is central to protein structure determination from Nuclear Magnetic Resonance data, where distance restraints are naturally uncertain. We study the interval Discretizable Distance Geometry Problem (\textit{i}DDGP) and introduce two angular Branch-and-Prune (BP) frameworks: the inte
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Differential-geometric methods for neural signed distance fields: Parameterized surface extraction and curvature regularization for CAD models#424370
- MedCore: Boundary-Preserving Medical Core Pruning for MedSAM#180670
- Systematic vertex corrections through iterative solution of Hedin's equations beyond the it GW approximation#290349
- Zometool Shape Approximation#296944
- The Art of Approximation in Science and Engineering#3471
Record · ID 1104392
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive