Unassigned distance geometry and molecular conformation problems

3D protein structures and nanostructures can be obtained by exploiting distance information provided by experimental techniques, such as nuclear magnetic resonance and the pair distribution function method. These are examples of instances of the unassigned distance geometry problem (uDGP), where the aim is to calculate the position of some points using a list of associated distance values not previoulsy assigned to the pair of points. We propose new mathematical programming formulations and a new heuristic to solve the uDGP related to molecular structure calculations. In addition to theoretical results, computational experiments are also provided.

[1]  Thibaut Vidal,et al.  The minimum distance superset problem: formulations and algorithms , 2018, J. Glob. Optim..

[2]  Carlile Lavor,et al.  A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix , 2017 .

[3]  Leo Liberti,et al.  Open research areas in distance geometry , 2016, ArXiv.

[4]  Carlile Lavor,et al.  A new algorithm for the small-field astrometric point-pattern matching problem , 2018, J. Glob. Optim..

[5]  Antonio Mucherino,et al.  Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures , 2018, Ann. Oper. Res..

[6]  Isiah Zaplana,et al.  A Geometric Algebra Invitation to Space-Time Physics, Robotics and Molecular Geometry , 2018 .

[7]  Carlile Lavor,et al.  Euclidean Distance Geometry - an Introduction , 2017, Springer undergraduate texts in mathematics and technology.

[8]  Oktay Günlük,et al.  Discretization vertex orders in distance geometry , 2015, Discret. Appl. Math..

[9]  K. Menger.  Untersuchungen über allgemeine Metrik , 1928 .

[10]  Leo Liberti,et al.  On the polynomiality of finding KDMDGP re-orders , 2019, Discret. Appl. Math..

[11]  Leo Liberti,et al.  Recent advances on the interval distance geometry problem , 2017, Journal of Global Optimization.

[12]  Leo Liberti,et al.  Recent advances on the Discretizable Molecular Distance Geometry Problem , 2012, Eur. J. Oper. Res..

[13]  Leo Liberti,et al.  Systematic exploration of protein conformational space using a Distance Geometry approach , 2019, bioRxiv.

[14]  Carlile Lavor,et al.  Clifford algebra and discretizable distance geometry , 2018 .

[15]  Leo Liberti,et al.  An Introduction to Distance Geometry applied to Molecular Geometry , 2017, SpringerBriefs in Computer Science.

[16]  Leo Liberti,et al.  The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances , 2011, Journal of Global Optimization.

[17]  Nelson Maculan,et al.  Clifford Algebra and the Discretizable Molecular Distance Geometry Problem , 2015 .

[18]  Simon J. L. Billinge,et al.  The unassigned distance geometry problem , 2016, Discret. Appl. Math..

[19]  Leo Liberti,et al.  Tuning interval Branch-and-Prune for protein structure determination , 2018, Journal of Global Optimization.

[20]  Steven Skiena,et al.  Reconstructing sets from interpoint distances (extended abstract) , 1990, SCG '90.

[21]  Leo Liberti,et al.  The discretizable molecular distance geometry problem , 2006, Computational Optimization and Applications.

[22]  Carlile Lavor,et al.  A note on computing the intersection of spheres in \(\mathbb{R}^{n}\) , 2018 .

[23]  P M Duxbury,et al.  Ab-initio reconstruction of complex Euclidean networks in two dimensions. , 2014, Physical review. E, Statistical, nonlinear, and soft matter physics.

[24]  Leo Liberti,et al.  A Branch-and-Prune algorithm for the Molecular Distance Geometry Problem , 2008, Int. Trans. Oper. Res..

[25]  W. Punch,et al.  Ab initio determination of solid-state nanostructure , 2006, Nature.

[26]  Carlile Lavor,et al.  Oriented Conformal Geometric Algebra and the Molecular Distance Geometry Problem , 2018, Advances in Applied Clifford Algebras.

[27]  Warren D. Smith,et al.  Reconstructing Sets From Interpoint Distances , 2003 .

[28]  Carlile Lavor,et al.  A constrained interval approach to the generalized distance geometry problem , 2020, Optim. Lett..

[29]  Carlile Lavor,et al.  On generating Instances for the Molecular Distance Geometry Problem , 2006 .

[30]  Antonio Mucherino,et al.  Improving the sampling process in the interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem , 2021, Appl. Math. Comput..

[31]  Ky Khac Vu,et al.  New Error Measures and Methods for Realizing Protein Graphs from Distance Data , 2016, Discrete & Computational Geometry.

[32]  J. M. Martínez,et al.  A note on the theoretical convergence properties of the SIMP method , 2005 .

[33]  Leo Liberti,et al.  Distance Geometry: Theory, Methods, and Applications , 2013, Distance Geometry.

[34]  K. Menger.  Untersuchungen über allgemeine Metrik , 1928 .

[35]  Leo Liberti,et al.  Euclidean Distance Geometry and Applications , 2012, SIAM Rev..

[36]  Christiano Lyra,et al.  A new quadratic relaxation for binary variables applied to the distance geometry problem , 2020 .

[37]  Carlile Lavor,et al.  A NOTE ON COMPUTING THE INTERSECTION OF SPHERES IN , 2017 .

[38]  Leo Liberti,et al.  Six mathematical gems from the history of distance geometry , 2015, Int. Trans. Oper. Res..

[39]  C. Lavor,et al.  On the estimation of unknown distances for a class of Euclidean distance matrix completion problems with interval data , 2020 .

[40]  Carlile Lavor,et al.  Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis , 2017, Inf. Sci..

[41]  Antonio Mucherino,et al.  Assigned and unassigned distance geometry: applications to biological molecules and nanostructures , 2016, 4OR.

[42]  C. Lavor,et al.  Geometric Algebra to Model Uncertainties in the Discretizable Molecular Distance Geometry Problem , 2017 .

[43]  Bruce Randall Donald,et al.  Minimal NMR distance information for rigidity of protein graphs , 2019, Discret. Appl. Math..