On the Identification of Discretization Orders for Distance Geometry with Intervals
The discretization of instances of the distance geometry problem is possible when some particular assumptions are satisfied. When molecules are concerned, such assumptions strongly depend on the order in which the atoms of the molecule are considered. When the chemical composition of the molecule is known, as it is the case for the proteins, a general order can be identified for an entire class of instances. However, when this information is not available, ad-hoc orders need to be found for every considered instance. In this paper, the problem of finding discretization orders for distance geometry problems with intervals is formalized, and an algorithm for its solution is presented.
Unable to display preview. Download preview PDF.
- 5.Costa, V., Mucherino, A., Lavor, C., Carvalho, L.M., Maculan, N.: On Suitable Orders for Discretizing Molecular Distance Geometry Problems related to Protein Side Chains. In: IEEE Conference Proceedings, Federated Conference on Computer Science and Information Systems (FedCSIS 2012), Workshop on Computational Optimization (WCO 2012), Wroclaw, Poland, pp. 397–402 (2012)Google Scholar
- 11.Lavor, C., Liberti, L., Mucherino, A.: The interval, Branch-and-Prune Algorithm for the Discretizable Molecular Distance Geometry Problem with Inexact Distances. To appear in Journal of Global Optimization (2013)Google Scholar
- 12.Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean Distance Geometry and Applications. To appear in SIAM Review (2013)Google Scholar
- 13.Malliavin, T.E., Mucherino, A., Nilges, M.: Distance Geometry in Structural Biology: New Perspectives. In: , pp. 329–350 (2013)Google Scholar
- 17.Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry: Theory, Methods and Applications, 410 pages. Springer (2013)Google Scholar