Abstract
We know that to ensure the finiteness of the solution set of the DGP, we can impose an order on the vertices of the associated graph. If such an order exists, it is not hard to find it in the DGP graph.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Abud, G., Alencar, J.: Counting the number of solutions of the discretizable molecular distance geometry problem. In: Andrioni, A., Lavor, C., Liberti, L., Mucherino, A., Maculan, N., Rodriguez, R. (eds.) Proceedings of the Workshop on Distance Geometry and Applications, pp. 29–32. Universidade Federal do Amazonas, Manaus (2013)
Cassioli, A., Gunluk, O., Lavor, C., Liberti, L.: Discretization vertex orders in distance geometry. Discret. Appl. Math. 197, 27–41 (2015).
Lavor, C., Liberti, L., Maculan, N.: A note on “A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem”. Int. Trans. Oper. Res. 18, 751–752 (2011)
Lavor, C., Liberti, L., Maculan, N., Mucherino, A.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. 52, 115–146 (2012)
Lavor, C., Liberti, L., Mucherino, A.: The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances. J. Glob. Optim. 56, 855–871 (2013)
Lavor, C., Alves, R., Figueiredo, W., Petraglia, A., Maculan, N.: Clifford algebra and the discretizable molecular distance geometry problem. Adv. Appl. Clifford Algebr. 25, 925–942 (2015)
Liberti, L., Lavor, C., Maculan, N.: A branch-and-prune algorithm for the molecular distance geometry problem. Int. Trans. Oper. Res. 15, 1–17 (2008)
Liberti, L., Lavor, C., Alencar, J., Resende, G.: Counting the number of solutions of KDMDGP instances. Lecture Notes Comput. Sci. 8085, 224–230 (2013)
Liberti, L., Lavor, C., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56, 3–69 (2014)
Liberti, L., Masson, B., Lee, J., Lavor, C., Mucherino, A.: On the number of realizations of certain Henneberg graphs arising in protein conformation. Discret. Appl. Math. 165, 213–232 (2014)
Mucherino, A., Lavor, C., Liberti, L.: Exploiting symmetry properties of the discretizable molecular distance geometry problem. J. Bioinform. Comput. Biol. 10, 1242009(1–15) (2012)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2017 The Author(s)
About this chapter
Cite this chapter
Lavor, C., Liberti, L., Lodwick, W.A., Mendonça da Costa, T. (2017). The Discretizable Molecular Distance Geometry Problem (DMDGP). In: An Introduction to Distance Geometry applied to Molecular Geometry. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-57183-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-57183-6_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57182-9
Online ISBN: 978-3-319-57183-6
eBook Packages: Computer ScienceComputer Science (R0)