Abstract
We discuss a discretization-based solution approach for a classic problem in global optimization, namely the distance geometry problem (DGP). We focus our attention on a particular class of the DGP which is concerned with the identification of the conformation of biological molecules. Among the many relevant ideas for the discretization of the DGP in the literature, we identify the most promising ones and address their inherent limitations to application to this class of problems. The result is an improved method for estimating 3D structures of small proteins based only on the knowledge of some distance restraints between pairs of atoms. We present computational results showcasing the usefulness of the new proposed approach. Proteins act on living cells according to their geometric and chemical properties: finding protein conformations can be very useful within the pharmaceutical industry in order to synthesize new drugs.
Similar content being viewed by others
Notes
Continuous motions of part of the structure preserving all distance restraints.
References
Alfakih, A.Y., Khandani, A., Wolkowicz, H.: Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl. 12, 13–30 (1999)
Alipanahi, B., Krislock, N., Ghodsi, A., Wolkowicz, H., Donaldson, L., Li, M.: Determining protein structures from NOESY distance constraints by semidefinite programming. J. Comput. Biol. 20, 296–310 (2013)
Almeida, F.C.L., Moraes, A.H., Gomes-Neto, F.: An overview on protein structure determination by NMR: historical and future perspectives of the use of distance geometry methods. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)
Berman, H., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T., Weissig, H., Shindyalov, I., Bourne, P.: The Protein Data Bank. Nucl. Acids Res. 28, 235–242 (2000)
Billeter, M., Braun, W., Wüthrich, K.: Sequential resonance assignments in protein \(^1\)H nuclear magnetic resonance spectra. Computation of sterically allowed proton-proton distances and statistical analysis of proton-proton distances in single crystal protein conformations. J. Mol. Biol. 155, 321–346 (1982)
Biswas, P., Lian, T., Wang, T., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Netw. 2, 188–220 (2006)
Bizien, T., Durand, D., Roblina, P., Thureau, A., Vachette, P., Péreza, J.: A brief Survey of State-of-the-Art BioSAXS. Protein Pept. Lett. 23, 217–231 (2016)
Cassioli, A., Bordeaux, B., Bouvier, G., Mucherino, A., Alves, R., Liberti, L., Nilges, M., Lavor, C., Malliavin, T.: An algorithm to enumerate all possible protein conformations verifying a set of distance constraints. BMC Bioinform. 16, 16–23 (2015)
Cassioli, A., Gunluk, O., Lavor, C., Liberti, L.: Discretization vertex orders in distance geometry. Discrete Appl. Math. 197, 27–41 (2015)
Chen, Z.A., Jawhari, A., Fischer, L., Buchen, C., Tahir, S., Kamenski, T., Rasmussen, M., Lariviere, L., Bukowski-Wills, J.-C., Nilges, M., Cramer, P., Rappsilber, J.: Architecture of the RNA polymerase II–TFIIF complex revealed by cross-linking and mass spectrometry. EMBO J. 29, 717–726 (2010)
Costa, V., Mucherino, A., Lavor, C., Cassioli, A., Carvalho, L.M., Maculan, N.: Discretization orders for protein side chains. J. Glob. Optim. 60, 333–349 (2014)
Crippen, G., Havel, T.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)
Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. \({\cal{M}}\epsilon {\upbeta } oo\), Palo Alto (2005)
Dokmanic, I., Parhizkar, R., Ranieri, J., Vetterli, M.: Euclidean distance matrices: essential theory, algorithms, and applications. Sig. Process. Mag. IEEE 32(6), 12–30 (2015)
Dong, Q., Wu, Z.: A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances. J. Glob. Optim. 22, 365–375 (2002)
Dong, Q., Wu, Z.: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Glob. Optim. 26(3), 321–333 (2003)
Ferguson, D., Marsh, A., Metzger, T., Garrett, D., Kastella, K.: Conformational searches for the global minimum of protein models. J. Glob. Optim. 4, 209–227 (1994)
Fiorioto, F., Damberger, F., Herrmann, T., Wüthrich, K.: Automated amino acid side-chain NMR assignment of proteins using 13C- and 15N-resolved 3D [1H,1H]-NOESY. J. Biomol. NMR 42, 23–33 (2008)
Gonçalves, D.S., Mucherino, A.: Discretization orders and efficient computation of cartesian coordinates for distance geometry. Optim. Lett. 8, 2111–2125 (2014)
Gonçalves, D.S., Mucherino, A., Lavor, C.: An adaptive branching scheme for the branch & prune algorithm applied to distance geometry. In: IEEE Conference Proceedings, pp. 463–469. Workshop on Computational Optimization (WCO14), FedCSIS14, Warsaw, Poland (2014)
Grand, S.L., Merz, K.: The application of the genetic algorithm to the minimization of potential energy functions. J. Glob. Optim. 3, 49–66 (1993)
Guerry, P., Duong, V.D., Herrmann, T.: CASD-NMR 2: robust and accurate unsupervised analysis of raw NOESY spectra and protein structure determination with UNIO. J. Biomol. NMR 62, 473–480 (2015)
Güntert, P.: Automated NMR structure calculation with CYANA. Methods Mol. Biol. 278, 353–378 (2004)
Herrmann, T., Güntert, P., Wüthrich, K.: Protein NMR structure determination with automated NOE assignment using the new software CANDID and the torsion angle dynamics algorithm DYANA. J. Mol. Biol. 319, 209–227 (2002)
Herrmann, T., Güntert, P., Wüthrich, K.: Protein NMR structure determination with automated NOE-identification in the NOESY spectra using the new software ATNOS. J. Biomol. NMR 24, 171–189 (2002)
L, Hoai An: Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and d.c. programming. J. Glob. Optim. 27, 375–397 (2003)
Huang, H.X., Liang, Z.A., Pardalos, P.: Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems. J. Glob. Optim. 25, 3–21 (2003)
Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Krislock, N., Wolkowicz, H.: Explicit sensor network localization using semidefinite representations and facial reductions. SIAM J. Optim. 20, 2679–2708 (2010)
Lavor, C., Alves, R., Figueiredo, W., Petraglia, A., Maculan, N.: Clifford algebra and the discretizable molecular distance geometry problem. Adv. Appl. Clifford Algebras 25, 925–942 (2015)
Lavor, C., Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. 6, 783–796 (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)
Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: On the computation of protein backbones by using artificial backbones of hydrogens. J. Glob. Optim. 50, 329–344 (2011)
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., Marinelli, F.: Double variable neighbourhood search with smoothing for the molecular distance geometry problem. J. Glob. Optim. 43, 207–218 (2009)
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., Lavor, C., Mucherino, A.: The discretizable molecular distance geometry problem seems easier on proteins. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry, pp. 47–60. Springer, New York (2013)
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)
Linge, J.P., Habeck, M., Rieping, W., Nilges, M.: ARIA: automated NOE assignment and NMR structure calculation. Bioinformatics 19, 315–316 (2003)
Locatelli, M., Schoen, F.: Minimal interatomic distance in morse clusters. J. Glob. Optim. 22(1), 175–190 (2002)
Malliavin, T., 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 (2003)
Man-Cho So, A., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. B 109, 367–384 (2007)
Maranas, C., Floudas, C.: Global minimum potential energy conformations of small molecules. J. Glob. Optim. 4, 135–170 (1994)
Moré, J., Wu, Z.: Distance geometry optimization for protein structures. J. Glob. Optim. 15(3), 219–234 (1999)
Moré, J., Wu, Z.: Distance geometry optimization for protein structures. J. Glob. Optim. 15, 219–223 (1999)
Mucherino, A.: On the identification of discretization orders for distance geometry with intervals. In: Proceedings of Geometric Science of Information (GSI13), pp. 231–238. Lecture Notes in Computer Science 8085, Paris, France (2013)
Mucherino, A.: A pseudo De Bruijn graph representation for discretization orders for distance geometry. In: Proceedings of the 3rd International Work-Conference on Bioinformatics and Biomedical Engineering (IWBBIO15), Part I, Lecture Notes in Bioinformatics, vol. 9043, pp. 514–523. Granada, Spain (2015)
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. Springer, New York (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.) Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), Lecture Notes in Computer Science, vol. 6630, pp. 206–217. Crete, Greece (2011)
Ryu, J., Kim, D.S.: Protein structure optimization by side-chain positioning via beta-complex. J. Glob. Optim. 57(1), 217–250 (2013)
Santana, R., Larrañaga, P., Lozano, J.: Side chain placement using estimation of distribution algorithms. Artif. Intell. Med. 39, 49–63 (2007)
Saxe, J.B.: Embeddability of weighted graphs in \(k\)-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications. Control and Computing, pp. 480–489. Monticello, IL (1979)
Schlick, T.: Molecular Modelling and Simulation: An Interdisciplinary Guide. Springer, New York (2002)
Schoenberg, I.: Remarks to Maurice Fréchet’s article “Sur la définition axiomatique d’une classe d’espaces distanciés vectoriellement applicable sur l’espace de Hilbert”. Ann. Math. 36, 724–732 (1935)
Sippl, M., Scheraga, H.: Cayley–Menger coordinates. Proc. Natl. Acad. Sci. USA 83, 2283–2287 (1986)
Sit, A., Wu, Z.: Solving a generalized distance geometry problem for protein structure determination. Bull. Math. Biol. 73, 2809–2836 (2011)
Souza, M., Lavor, C., Muritiba, A., Maculan, N.: Solving the molecular distance geometry problem with innacurate distance data. BMC Bioinform. 14(Suppl 9):S7 (2013)
Thompson, H.: Calculation of cartesian coordinates and their derivatives from internal molecular coordinates. J. Chem. Phys. 47, 3407–3410 (1967)
Volk, J., Herrmann, T., Wüthrich, K.: Automated sequence-specific protein NMR assigment using memetic algorithm MATCH. J. Biomol. NMR 41, 127–138 (2008)
Wu, D., Wu, Z.: An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Glob. Optim. 37, 661–673 (2007)
Wu, D., Wu, Z., Yuan, Y.: Rigid versus unique determination of protein structures with geometric buildup. Optim. Lett. 2, 319–331 (2008)
Wüthrich, K., Billeter, M., Braun, W.: Pseudo-structures for the 20 common amino acids for use in studies of protein conformations by measurements of intramolecular proton-proton distance constraints with Nuclear Magnetic Ressonance. J. Mol. Biol. 169, 949–961 (1983)
Zhang, Y., Skolnick, J.: TM-align: a protein structure alignment algorithm based on TM-score. Nucl. Acids Res. 33, 2302–2309 (2005)
Zou, Z., Bird, R., Schnabel, R.: A stochastic/perturbation global optimization algorithm for distance geometry problems. J. Glob. Optim. 11(1), 91–105 (1997)
Acknowledgements
DG and CL are thankful to the Brazilian research agencies FAPESP and CNPq for partial financial support. LL was partially supported by the “Bip:Bip” project within the ANR “Investissement d’Avenir” program. AM thanks University of Rennes 1 for financial support. AM and DG also acknowledge Brittany Region (France) for partial financial support.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Gonçalves, D.S., Mucherino, A., Lavor, C. et al. Recent advances on the interval distance geometry problem. J Glob Optim 69, 525–545 (2017). https://doi.org/10.1007/s10898-016-0493-6
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10898-016-0493-6