Abstract
Discretizable distance geometry problems consist in a subclass of distance geometry problems where the search space can be discretized and reduced to a tree. Such problems can be tackled by applying a branch-and-prune algorithm, which is able to perform an exhaustive enumeration of the solution set. In this work, we exploit the concept of symmetry in the search tree for isolating subtrees that are explored only one time for improving the algorithm performances. The proposed strategy is based on the idea of dividing an original instance of the problem into sub-instances that can thereafter be solved (almost) independently. We present some computational experiments on a set of artificially generated instances, with exact distances, to validate the theoretical results.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Notes
The term vertex rank refers to the position (index) of a vertex in a given order.
References
Bichot, C.-E.: General introduction to graph partitioning. In: Bichot, C.-E., Siarry, P. (eds.) Graph Partitioning, pp. 1–25. Wiley, Hoboken (2013)
Cassioli, A., Bardiaux, B., Bouvier, G., Malliavin, T.E., Mucherino, A., Nilges, M., Alves, R., Liberti, L., Lavor, C.: An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinform. 16(23), 1–15 (2015)
Gramacho, W., Mucherino, A., Lavor, C., Maculan, N.: A parallel bp algorithm for the discretizable distance geometry problem. In: IEEE Conference Proceedings, Workshop on Parallel Computing and Optimization (PCO12), 26th IEEE International Parallel & Distributed Processing Symposium (IPDPS12), Shanghai, China, pp. 1756–1762 (2012)
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., Maculan, N., Mucherino, A.: Recent advances on the discretizable molecular distance geometry problem. Eur. J. Oper. Res. 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. J. Glob. Optim. 56, 855–871 (2013)
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., Maculan, N., Mucherino, A.: Euclidean distance geometry and applications. SIAM Rev. 56, 3–69 (2014)
Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18, 33–51 (2011)
Liberti, L., Masson, B., Lee, J., Lavor, C., Mucherino, A.: On the number of realizations of certain henneberg graphs arising in protein conformation. Discrete Appl. Math. 165, 213–232 (2014)
Malliavin, T.E., Mucherino, A., Nilges, M.: Distance geometry in structural biology: new perspectives. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods and Applications, pp. 329–350. Springer, Berlin (2013)
Moré, J., Wu, Z.: Distance geometry optimization for protein structures. J. Glob. Optim. 15, 219–234 (1999)
Mucherino, A., Lavor, C., Liberti, L.: A symmetry-driven bp algorithm for the discretizable molecular distance geometry problem. In: IEEE Conference Proceedings, Computational Structural Bioinformatics Workshop (CSBW11), International Conference on Bioinformatics & Biomedicine (BIBM11), Atlanta, GA, USA, pp. 390–395 (2011)
Mucherino, A., Lavor, C., Liberti, L.: Exploiting symmetry properties of the discretizable molecular distance geometry problem. J. Bioinform. Comput. Biol. 10(1–15), 1242009 (2012)
Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem. Optim. Lett. 6, 1671–1686 (2012)
Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry: Theory, Methods and Applications, pp. 329–350. Springer, New York (2013)
Mucherino, A., Lavor, C., Liberti, L., Maculan, N.: On the discretization of distance geometry problems. In: ITHEA Conference Proceedings, Mathematics of Distances and Applications 2012 (MDA12), Varna, Bulgaria, pp. 160–168 (2012)
Mucherino, A., Lavor, C., Liberti, L., Talbi, E-G.: A Parallel version of the branch & prune algorithm for the molecular distance geometry problem. In: IEEE Conference Proceedings, ACS/IEEE International Conference on Computer Systems and Applications (AICCSA10), Hammamet, Tunisia, pp. 1–6 (2010)
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.), Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), Crete, Greece, Lecture Notes in Computer Science, vol. 6630, pp. 206–217 (2011)
Nucci, P., Nogueira, L., Lavor, C.: Solving the discretizable molecular distance geometry problem by multiple realization trees. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods and Applications, pp. 161–176. Springer, Berlin (2013)
Raynal, M.: Distributed Algorithms for Message-Passing Systems, p. 500. Springer, Berlin (2013)
Acknowledgements
FF, DG, CL and AM wish to thank FAPESP and CNPq for financial support. LL was partly supported by the ANR “Bip:Bip” project under contract ANR-10-BINF-0003.
Author information
Authors and Affiliations
Corresponding author
Additional information
In memory of our esteemed colleague, Chris Floudas.
Rights and permissions
About this article
Cite this article
Fidalgo, F., Gonçalves, D.S., Lavor, C. et al. A symmetry-based splitting strategy for discretizable distance geometry problems. J Glob Optim 71, 717–733 (2018). https://doi.org/10.1007/s10898-018-0610-9
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-018-0610-9