Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alipanahi, B., Krislock, N., Ghodsi, A., Wolkowicz, H., Donaldson, L., Li, M.: Determining Protein Structures from NOESY Distance Constraints by Semidefinite Programming. Journal of Computational Biology 20(4), 296–310 (2013)
Biswas, P., Lian, T., Wang, T., Ye, Y.: Semidefinite Programming based Algorithms for Sensor Network Localization. ACM Transactions in Sensor Networks 2, 188–220 (2006)
Carvalho, R.S., Lavor, C., Protti, F.: Extending the Geometric Build-Up Algorithm for the Molecular Distance Geometry Problem. Information Processing Letters 108, 234–237 (2008)
Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. John Wiley & Sons, New York (1988)
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)
Dong, Q., Wu, Z.: A linear-time Algorithm for Solving the Molecular Distance Geometry Problem with Exact Inter-Atomic Distances. Journal of Global Optimization 22, 365–375 (2002)
Dong, Q., Wu, Z.: A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data. Journal of Global Optimization 26, 321–333 (2003)
Krislock, N., Wolkowicz, H.: Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions. SIAM Journal on Optimization 20, 2679–2708 (2010)
Lavor, C., Lee, J., John, A.L.-S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization Orders for Distance Geometry Problems. Optimization Letters 6(4), 783–796 (2012)
Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: Recent Advances on the Discretizable Molecular Distance Geometry Problem. European Journal of Operational Research 219, 698–706 (2012)
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)
Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean Distance Geometry and Applications. To appear in SIAM Review (2013)
Malliavin, T.E., Mucherino, A., Nilges, M.: Distance Geometry in Structural Biology: New Perspectives. In: [17], pp. 329–350 (2013)
Moré, J.J., Wu, Z.: Global Continuation for Distance Geometry Problems. SIAM Journal on Optimization 7, 814–836 (1997)
Moré, J.J., Wu, Z.: Distance Geometry Optimization for Protein Structures. Journal of Global Optimimization 15, 219–223 (1999)
Mucherino, A., Lavor, C., Liberti, L.: The Discretizable Distance Geometry Problem. Optimization Letters 6(8), 1671–1686 (2012)
Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry: Theory, Methods and Applications, 410 pages. Springer (2013)
Mucherino, A., Lavor, C., Malliavin, T., Liberti, L., Nilges, M., Maculan, N.: Influence of Pruning Devices on the Solution of Molecular Distance Geometry Problems. In: Pardalos, P.M., Rebennack, S. (eds.) SEA 2011. LNCS, vol. 6630, pp. 206–217. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mucherino, A. (2013). On the Identification of Discretization Orders for Distance Geometry with Intervals. In: Nielsen, F., Barbaresco, F. (eds) Geometric Science of Information. GSI 2013. Lecture Notes in Computer Science, vol 8085. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40020-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-642-40020-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40019-3
Online ISBN: 978-3-642-40020-9
eBook Packages: Computer ScienceComputer Science (R0)