Molecular distance geometry methods: From continuous to discrete

International Transactions in Operational Research

Volumn 18, Issue 1, 2011, Pages 33-51

  Liberti, Leo ^a   Lavor, Carlile ^b   Mucherino, Antonio ^a   Maculan, Nelson ^c  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Distance geometry; Optimization; Protein conformation

Indexed keywords

DISCRETE METHOD; DISCRETE SETS; DISTANCE GEOMETRY; EUCLIDEAN; EUCLIDEAN SPACES; GRAPH DRAWING; K-SPACE; MOLECULAR DISTANCES; POWER-LOSSES; PROBLEM STRUCTURE; PROTEIN CONFORMATION; RELATIVE DISTANCES; SENSOR NETWORK LOCALIZATION; THREE DIMENSIONS; WIRELESS SENSOR;

CHEMICAL PROPERTIES; DRAWING (GRAPHICS); GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SENSOR NETWORKS;

GEOMETRY;

EID: 84863430641     PISSN: 09696016     EISSN: 14753995     Source Type: Journal    
DOI: 10.1111/j.1475-3995.2009.00757.x     Document Type: Article

References (56)

1. Bachrach, J., Taylor, C., 2005. Localization in sensor networks. In Stojmenović, I. (ed.) Handbook of Sensor Networks. Wiley, Chichester, pp. 3627-3643.
2. Belotti, P., Lee, J., Liberti, L., Margot, F., Wächter, A., 2009. Branching and bounds tightening techniques for nonconvex MINLP. Optimization Methods and Software 24, 4, 597-634.
3. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E., 2000. The protein data bank. Nucleic Acid Research 28, 235-242.
4. Biswas, P., Toh, K.C., Ye, Y., 2008. A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM Journal on Scientific Computing 30, 3, 1251-1277.
5. Carvalho, R.S., Lavor, C., Protti, F., 2008. Extending the geometric build-up algorithm for the molecular distance geometry problem. Information Processing Letters 108, 234-237.
6. Coleman, T.F., Shalloway, D., Wu, Z., 1993. Isotropic effective energy simulated annealing searches for low energy molecular cluster states. Computational Optimization and Applications 2, 145-170.
7. Coleman, T.F., Shalloway, D., Wu, Z., 1994. A parallel build-up algorithm for global energy minimizations of molecular clusters using effective energy simulated annealing. Journal of Global Optimization 4, 171-185.
8. Crippen, G.M., Havel, T.F., 1988. Distance Geometry and Molecular Conformation. Wiley, New York.
9. Dong, Q., Wu, Z., 2002. A linear-time algorithm for solving the molecular distance geometry problem with exact interatomic distances. Journal of Global Optimization 22, 365-375.
10. Dong, Q., Wu, Z., 2003. A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. Journal of Global Optimization 26, 321-333.
11. Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O., Belhumeur, P.N., 2004. Rigidity, computation, and randomization in network localization. IEEE Infocom Proceedings 2673-2684.
12. Gluck, H., 1975. Almost all simply connected closed surfaces are rigid. In Dold, A., Eckmann, B. (eds) Geometric Topology, Volume 438 of Lecture Notes in Mathematics. Springer, Berlin, pp. 225-239.
13. Glunt, W., Hayden, T.H., Hong, S., Wells, J., 1990. An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM Journal on Matrix Analysis and Applications 11, 4, 589-600.
14. Grosso, A., Locatelli, M., Schoen, F., 2009. Solving molecular distance geometry problems by global optimization algorithms. Computational Optimization and Applications 43, 23-27.
15. Hansen, P., Mladenović, N., 2001. Variable neighbourhood search: Principles and applications. European Journal of Operations Research 130, 449-467.
16. Hendrickson, B.A., 1992. Conditions for unique graph realizations. SIAM Journal on Computing 21, 1, 65-84.
17. Hendrickson, B.A., 1995. The molecule problem: Exploiting structure in global optimization. SIAM Journal on Optimization 5, 835-857.
18. Hoai An, L.T., 2003. Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and d.c. programming. Journal of Global Optimization 27, 375-397.
19. Hoai An, L.T., Tao, P.D., 2003. Large-scale molecular optimization from distance matrices by a d.c. optimization approach. SIAM Journal on Optimization 14, 77-114.
20. Izrailev, S., Zhu, F., Agrafiotis, D.K., 2006. A distance geometry heuristic for expanding the range of geometries sampled during conformational search. Journal of Computational Chemistry 26, 3, 1962-1969.
21. Kostrowicki, J., Piela, L., 1991. Diffusion equation method of global minimization: Performance for standard functions. Journal of Optimization Theory and Applications 69, 269-284.
22. Kostrowicki, J., Piela, L., Cherayil, B.J., Scheraga, H.A., 1991. Performance of the diffusion equation method in searches for optimum structures of clusters of Lennard-Jones atoms. Journal of Physical Chemistry 95, 4113-4119.
23. Kostrowicki, J., Scheraga, H.A., 1992. Application of the diffusion equation method for global optimization of oligopeptides. Journal of Physical Chemistry 96, 7442-7449.
24. Kucherenko, S., Sytsko, Yu., 2004. Application of deterministic low-discrepancy sequences in global optimization. Computational Optimization and Applications 30, 3, 297-318.
25. Lavor, C., 2006. On generating instances for the molecular distance geometry problem. In Liberti, L., Maculan, N. (eds) Global Optimization: From Theory to Implementation. Springer, Berlin, pp. 405-414.
26. Lavor, C., Liberti, L., Maculan, N., 2006. Computational experience with the molecular distance geometry problem. In Pinté r, J. (ed.) Global Optimization: Scientific and Engineering Case Studies. Springer, Berlin, pp. 213-225.
27. Lavor, C., Liberti, L., Maculan, N., 2009a. Molecular distance geometry problem. In Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization, (2nd edn), Springer, New York, pp. 2305-2311.
28. Lavor, C., Liberti, L., Mucherino, A., Maculan, N., 2009b. On a discretizable subclass of instances of the molecular distance geometry problem. In Proceedings of the 24th Annual ACM Symposium on Applied Computing. ACM, New York, pp. 804-805.
29. Lavor, C., Mucherino, A., Liberti, L., Maculan, N., 2009c. Computing artificial backbones of hydrogen atoms in order to discover protein backbones. In Proceedings of the International Multiconference on Computer Science and Information Technology, Workshop on Computational Optimization, IEEE.
30. Liberti, L., 2006. Writing global optimization software. In Liberti, L., Maculan, N. (eds) Global Optimization: From Theory to Implementation. Springer, Berlin, pp. 211-262.
31. Liberti, L., Dražic, M., 2005. Variable neighbourhood search for the global optimization of constrained NLPs. In Proceedings of GO, Workshop, Almeria, Spain.
32. Liberti, L., Lavor, C., Maculan, N., 2006. A branch-and-prune algorithm for the molecular distance geometry problem. Technical Report q-bio/0608012, arXiv.
33. Liberti, L., Lavor, C., Maculan, N., 2008. A branch-and-prune algorithm for the molecular distance geometry problem. International Transactions in Operational Research 15, 1-17.
34. Liberti, L., Lavor, C., Maculan, N., Marinelli, F., 2009a. Double variable neighbourhood search with smoothing for the molecular distance geometry problem. Journal of Global Optimization 43, 207-218.
35. Liberti, L., Mladenović, N., Nannicini, G., 2009b. A good recipe for solving MINLPs. In Maniezzo, V., Stü tzle, T., Voβ, S. (eds) Hybridizing Metaheuristics and Mathematical Programming, Volume 10 of Annals of Information Systems. Springer, New York, pp. 231-244.
36. Liberti, L., Tsiakis, P., Keeping, B., Pantelides, C.C., 2001. ooOPS. Centre for Process Systems Engineering, Chemical Engineering Department, Imperial College, London, UK.
37. Mladenović, N., Petrović, J., Kovačević-Vujčić, V., Čangalović, M., 2003. Solving a spread-spectrum radar polyphase code design problem by tabu search and variable neighbourhood search. European Journal of Operations Research 151, 389-399.
38. Moré, J.J., Wu, Z., 1997. Global continuation for distance geometry problems. SIAM Journal on Optimization 7, 3, 814-846.
39. Mucherino, A., Lavor, C., 2009. The branch and prune algorithm for the molecular distance geometry problem with inexact distances. In Proceedings of the International Conference on Computational Biology, Vol. 58. World Academy of Science, Engineering and Technology, pp. 349-353.
40. Mucherino, A., Lavor, C., Maculan, N., 2009a. The molecular distance geometry problem applied to protein conformations. In Cafieri, S., Mucherino, A., Nannicini, G., Tarissan, F., Liberti, L. (eds) Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization. É cole Polytechnique, Paris, pp. 337-340.
41. Mucherino, A., Liberti, L., Lavor, C., Maculan, N., 2009b. Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. In Rothlauf, F. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference. ACM, Montreal, pp. 333-340.
42. Piela, L., Kostrowicki, J., Scheraga, H.A., 1989. The multiple-minima problem in the conformational analysis of molecules: Deformation of the protein energy hypersurface by the diffusion equation method. Journal of Physical Chemistry 93, 3339-3346.
43. Reams, R., Chatham, G., Glunt, W., McDonald, D., Hayden, T., 1999. Determining protein structure using the distance geometry program APA. Computers and Chemistry 23, 153-163.
44. Roth, B., 1981. Rigid and flexible frameworks. American Mathematical Monthly 88, 1, 6-21.
45. Santana, R., Larrañaga, P., Lozano, J.A., 2005. Combining variable neighbourhood search and estimation of distribution algorithms in the protein side chain placement problem. In Proceedings of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain.
46. Santana, R., Larrañaga, P., Lozano, J.A., 2008. Combining variable neighbourhood search and estimation of distribution algorithms in the protein side chain placement problem. Journal of Heuristics 14, 519-547.
47. Saxe, J.B., 1979. Embeddability of weighted graphs in k-space is strongly NP-hard. Proceedings of 17th Allerton Conference in Communications, Control and Computing, Allerton, pp. 480-489.
48. Schoenberg, I.J., 1935. 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". Annals of Mathematics 36, 3, 724-732.
49. Smith, E.M.B., Pantelides, C.C., 1999. A symbolic reformulation/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Computers and Chemical Engineering 23, 457-478.
50. So, M.-C., Ye, Y., 2007. Theory of semidefinite programming for sensor network localization. Mathematical Programming 109, 367-384.
51. Tawarmalani, M., Sahinidis, N.V., 2004. Global optimization of mixed integer nonlinear programs: A theoretical and computational study. Mathematical Programming 99, 563-591.
52. Williams, G.A., Dugan, J.M., Altman, R.P., 2001. Constrained global optimization for estimating molecular structure from atomic distances. Journal of Computational Biology 8, 523-547.
53. Wu, D., Wu, Z., 2007. An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. Journal of Global Optimization 37, 661-673.
54. Wu, D., Wu, Z., Yuan, Y., 2008. Rigid versus unique determination of protein structures with geometric buildup. Optimization Letters 2, 3, 319-331.
55. Wu, Z., 1996. The effective energy transformation scheme as a special continuation approach to global optimization with application to molecular conformation. SIAM Journal on Optimization 6, 748-768.
56. Xu, H., Izrailev, S., Agrafiotis, D.K., 2003. Conformational sampling by self-organization. Journal of Chemical Information and Computer Sciences 43, 1186-1191.