Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis

Abstract The calculation of the 3D structure of a protein molecule is important because it is associated to its biological function. Nuclear Magnetic Resonance (NMR) experiments can provide distance information between atoms that are close enough in a given protein and the problem is how to use these distances to determine the protein structure. Using the chemistry of proteins and supposing all the distances are precise values, it is possible to define an atomic order v 1 , ⋅⋅⋅, v n , such that the distances related to the pairs { v i − 3 , v i } , { v i − 2 , v i } , { v i − 1 , v i } are available, and solve the problem iteratively using a combinatorial method, called Branch-and-Prune (BP). However, due to uncertainty in NMR data, the distances associated with pairs { v i − 3 , v i } may not be precise, which implies that there are many difficulties in applying the BP algorithm to this scenario. The use of standard interval arithmetic can be directly applied to the algorithm, but it is known that it generates overestimations. This paper proposes a new methodology to compute possible conformations on the presence of uncertainties arising from NMR distance measurements using a constraint interval analysis approach. Some numerical examples are presented.

[1]  Leo Liberti,et al.  Discretization orders for distance geometry problems , 2012, Optim. Lett..

[2]  Leo Liberti,et al.  An algorithm to enumerate all possible protein conformations verifying a set of distance constraints , 2015, BMC Bioinformatics.

[3]  Weldon A. Lodwick,et al.  Constrained Interval Arithmetic , 1999 .

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

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

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

[7]  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.

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

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

[10]  Yurilev Chalco-Cano,et al.  Single level constraint interval arithmetic , 2014, Fuzzy Sets Syst..

[11]  Didier Dubois,et al.  Interval linear systems as a necessary step in fuzzy linear systems , 2015, Fuzzy Sets Syst..

[12]  Leo Liberti,et al.  Noname manuscript No. (will be inserted by the editor) The Discretizable Distance Geometry Problem , 2022 .

[13]  Leo Liberti,et al.  Computational Experience with the Molecular Distance Geometry Problem , 2006 .

[14]  Leo Liberti,et al.  Molecular distance geometry methods: from continuous to discrete , 2010, Int. Trans. Oper. Res..

[15]  R. Baker Kearfott,et al.  Introduction to Interval Analysis , 2009 .

[16]  Leo Liberti,et al.  Exploiting Symmetry Properties of the Discretizable molecular Distance Geometry Problem , 2012, J. Bioinform. Comput. Biol..

[17]  Leo Liberti,et al.  On the number of realizations of certain Henneberg graphs arising in protein conformation , 2014, Discret. Appl. Math..

[18]  Weldon A. Lodwick,et al.  Constrained intervals and interval spaces , 2013, Soft Comput..

[19]  Weldon A. Lodwick,et al.  Interval and Fuzzy Analysis: A Unified Approach , 2007 .

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