Answers are grounded in this paper and cite their sources.
Nuclear Magnetic Resonance (NMR) experiments can be used to calculate 3D protein structures and geometric properties of protein molecules allow us to solve the problem iteratively using a combinatorial method, called Branch-and-Prune (BP). The main step of BP algorithm is to intersect three spheres centered at the positions for atoms i − 3, i − 2, i − 1, with radii given by the atomic distances di −3, i, di −2, i, di −1, i, respectively, to obtain the position for atom i. Because of uncertainty in NMR data, some of the distances di −3, i should be represented as interval distances [ d _ i - 3 , i , d ¯ i - 3 , i {{d}i - 3,i},{ di - 3,i} ], where d _ i - 3 , i ≤ d i - 3 , i ≤ d ¯ i - 3 , i {{d}i - 3,i} ≤ {di - 3,i} ≤ { di - 3,i} . In the literature, an extension of the BP algorithm was proposed to deal with interval distances, where the idea is to sample values from [ d _ i - 3 , i , d ¯ i - 3 , i {{d}i - 3,i},{ di - 3,i} ]. We present a new method, based on conformal geometric algebra, to reduce the size of [ d _ i - 3 , i , d ¯ i - 3 ,
No takes yet. Share an insight, caveat, or question.
Lavor et al. (2020) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: