The discretizable molecular distance geometry problem

Computational Optimization and Applications

Volumn 52, Issue 1, 2012, Pages 115-146

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

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b ÉCOLE POLYTECHNIQUE   (France)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^d CERFACS   (France)

Author keywords

Branch and prune; Distance geometry; Molecular conformation; NMR; Protein

Indexed keywords

BP ALGORITHM; BRANCH-AND-PRUNE; COMPUTATIONAL RESULTS; DISCRETE SPACES; DISTANCE GEOMETRY; MOLECULAR CONFORMATION; MOLECULAR DISTANCE GEOMETRY PROBLEM; NP-HARD; SOLUTION ACCURACY; SOLUTION ALGORITHMS; WEIGHTED UNDIRECTED GRAPH;

COMPUTATIONAL METHODS; NUCLEAR MAGNETIC RESONANCE; OPTIMIZATION; PROTEINS;

GEOMETRY;

EID: 84861967373     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-011-9402-6     Document Type: Conference Paper

References (69)

1. An, L.T.H.: 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)
2. An, L.T.H., Tao, P.D.: Large-scale molecular optimization from distance matrices by a d.c. optimization approach. SIAM J. Optim. 14, 77-114 (2003)
3. Bachrach, J., Taylor, C.: Localization in sensor networks. In: Stojmenović, I. (ed.) Handbook of Sensor Networks, pp. 3627-3643. Wiley, New York (2005)
4. Barker, G.: The lattice of faces of a finite dimensional cone. Linear Algebra Appl. 7(1), 71-82 (1973)
5. Berger, B., Kleinberg, J., Leighton, T.: Reconstructing a three-dimensional model with arbitrary errors. J. ACM 46(2), 212-235 (1999)
6. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The protein data bank. Nucleic Acids Res. 28, 235-242 (2000)
7. Biswas, P.: Semidefinite programming approaches to distance geometry problems. Ph.D. thesis, Stanford University (2007)
8. Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN04), New York, NY, USA, pp. 46-54. ACM, New York (2004)
9. Biswas, P., Ye, Y.: A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. In: Multiscale Optimization Methods and Applications, vol. 82, pp. 69-84. Springer, Berlin (2006)
10. Biswas, P., Lian, T., Wang, T., Ye, Y.: Semidefinite programming based algorithms for sensor network localization. ACM Trans. Sens. Networks 2, 188-220 (2006)
11. Biswas, P., Liang, T.-C., Toh, K.-C., Wang, T.-C., Ye, Y.: Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans. Autom. Sci. Eng. 3, 360-371 (2006)
12. Biswas, P., Toh, K.C., Ye, Y.: A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM J. Sci. Comput. 30(3), 1251-1277 (2008)
13. Blumenthal, L.: Theory and Applications of Distance Geometry. Oxford University Press, London (1953)
14. Burkowski, F.: Structural Bioinformatics: An Algorithmic Approach. CRC Press, Boca Raton (2009)
15. Carvalho, R.S., Lavor, C., Protti, F.: Extending the geometric build-up algorithm for the molecular distance geometry problem. Inf. Process. Lett. 108, 234-237 (2008)
16. Connelly, R.: Generic global rigidity. Discrete Comput. Geom. 33, 549-563 (2005)
17. Creighton, T.: Proteins: Structures and Molecular Properties. Freeman, New York (1993)
18. Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)
19. Dattorro, J.: Convex Optimization and Euclidean Distance Geometry. Annual Reviews, Palo Alto (2005)
20. 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)
21. Dong, Q., Wu, Z.: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Glob. Optim. 26, 321-333 (2003)
22. Eren, T., Goldenberg, D.K., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, pp. 2673-2684 (2004)
23. Floyd, R.W.: Algorithm 97: Shortest path. Commun. ACM 5(6), 345 (1962)
24. Glunt, W., Hayden, T.H., Hong, S., Wells, J.: An alternating projection algorithm for computing the nearest Euclidean distance matrix. SIAM J. Matrix Anal. Appl. 11(4), 589-600 (1990)
25. Grosso, A., Locatelli, M., Schoen, F.: Solving molecular distance geometry problems by global optimization algorithms. Comput. Optim. Appl. 43, 23-27 (2009)
26. Havel, T.: Distance geometry. In: Grant, D., Harris, R. (eds.) Encyclopedia of Nuclear Magnetic Resonance, pp. 1701-1710. Wiley, New York (1995)
27. Hendrickson, B.A.: The molecule problem: exploiting structure in global optimization. SIAM J. Optim. 5, 835-857 (1995)
28. 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)
29. Johnson, C., Kroschel, B., Wolkowicz, H.: An interior-point method for approximate positive semidefinite completions. Comput. Optim. Appl. 9, 175-190 (1998)
30. Kearsley, A., Tapia, R., Trosset, M.: The solution of the metric stress and stress problems in multidimensional scaling by newton's method. Comput. Stat. 13, 369-396 (1998)
31. Krislock, N.: Semidefinite facial reduction for low-rank Euclidean distance matrix completion. Ph.D. thesis, University of Waterloo (2010)
32. Krislock, N., Wolkowicz, H.: Explicit sensor network localization using semidefinite representations and facial reductions. SIAM J. Optim. 20, 2679-2708 (2010)
33. Laurent, M.: Matrix completion problems. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 1967-1975. Springer, New York (2009)
34. Lavor, C.: On generating instances for the molecular distance geometry problem. In: Liberti, L., Maculan, N. (eds.) Global Optimization: From Theory to Implementation, pp. 405-414. Springer, Berlin (2006)
35. Lavor, C., Liberti, L., Maculan, N.: Grover's algorithm applied to the molecular distance geometry problem. In: Proc. of VII Brazilian Congress of Neural Networks, Natal, Brazil (2005)
36. Lavor, C., Liberti, L., Maculan, N.: Computational experience with the molecular distance geometry problem. In: Pintér, J. (ed.) Global Optimization: Scientific and Engineering Case Studies, pp. 213-225. Springer, Berlin (2006)
37. Lavor, C., Liberti, L., Maculan, N.: The discretizable molecular distance geometry problem. Technical Report, arXiv: q-bio/0608012 (2006)
38. Lavor, C., Liberti, L., Maculan, N.: Molecular distance geometry problem. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 2305-2311. Springer, New York (2009)
39. Lavor, C., Liberti, L., Mucherino, A., Maculan, N.: On a discretizable subclass of instances of the molecular distance geometry problem. In: Shin, D. (ed.) Proceedings of the 24th Annual ACM Symposium on Applied Computing, pp. 804-805. ACM, New York (2009)
40. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Computing artificial backbones of hydrogen atoms in order to discover protein backbones. In: Proceedings of the International Multiconference on Computer Science and Information Technology, Mragowo, Poland, pp. 751-756. IEEE Press, New York (2009)
41. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: On the solution of molecular distance geometry problems with interval data. In: Proceedings of the International Workshop on Computational Proteomics, Hong Kong. IEEE Press, New York (2010)
42. Lavor, C., Lee, J., Lee-St. John, A., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. (accepted for publication)
43. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: On the computation of protein backbones by using artificial backbones of hydrogens. J. Glob. Optim. (accepted). doi: 10.1007/s10898-010-9584-y
44. Liberti, L., Lavor, C., Maculan, N.: Double VNS for the molecular distance geometry problem. In: Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)
45. 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)
46. 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)
47. Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18, 33-51 (2010)
48. Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A.: On the number of solutions of the discretizable molecular distance geometry problem. Technical Report, arXiv: 1010.1834v1 [cs.DM] (2010)
49. Moré, J.J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7(3), 814-846 (1997)
50. Moré, J.J., Wu, Z.: Distance geometry optimization for protein structures. J. Glob. Optim. 15, 219-234 (1999)
51. Mucherino, A., Lavor, C.: The branch and prune algorithm for the molecular distance geometry problem with inexact distances. In: Proceedings of the International Conference on Computational Biology. World Academy of Science, Engineering and Technology, vol. 58, pp. 349-353 (2009)
52. Mucherino, A., Lavor, C., Maculan, N.: 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, pp. 337-340. École Polytechnique, Paris (2009)
53. Mucherino, A., Lavor, C., Liberti, L., Talbi, E.-G.: A parallel version of the branch & prune algorithm for the molecular distance geometry problem. In: ACS/IEEE International Conference on Computer Systems and Applications (AICCSA10), Hammamet, Tunisia. IEEE Press, New York (2010)
54. Mucherino, A., Liberti, L., Lavor, C., Maculan, N.: 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, Montreal, pp. 333-340. ACM, New York (2009)
55. Mucherino, A., Liberti, L., Lavor, C.: MD-jeep: an implementation of a branch-and-prune algorithm for distance geometry problems. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) Mathematical Software. LNCS, vol. 6327, pp. 186-197. Springer, New York (2010)
56. Phillips, A.T., Rosen, J.B., Walke, V.H.: Molecular structure determination by convex underestimation of local energy minima. In: Pardalos, P.M., Shalloway, D., Xue, G. (eds.) Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, vol. 23, pp. 181-198. American Mathematical Society, Providence (1996)
57. Pogorelov, A.: Geometry. Mir, Moscow (1987)
58. Roth, B.: Rigid and flexible frameworks. Am. Math. Mon. 88(1), 6-21 (1981)
59. Santana, R., Larrañaga, P., Lozano, J.A.: Combining variable neighbourhood search and estimation of distribution algorithms in the protein side chain placement problem. In: Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain (2005)
60. Santana, R., Larra naga, P., Lozano, J.A.: Side chain placement using estimation of distribution algorithms. Artif. Intell. Med. 39, 49-63 (2007)
61. 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 (1979)
62. Schlick, T.: Molecular Modelling and Simulation: An Interdisciplinary Guide. Springer, New York (2002)
63. Schoenberg, I.J.: 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(3), 724-732 (1935)
64. So, M.-C., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109, 367-384 (2007)
65. Trosset, M.: Applications of multidimensional scaling to molecular conformation. Comput. Sci. Stat. 29, 148-152 (1998)
66. Wang, L., Mettu, R., Donald, B.R.: An algebraic geometry approach to protein structure determination from nmr data. In: Proceedings of the Computational Systems Bioinformatics Conference. IEEE Press, New York (2005)
67. 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)
68. Wu, D., Wu, Z., Yuan, Y.: Rigid versus unique determination of protein structures with geometric buildup. Optim. Lett. 2(3), 319-331 (2008)
69. Zou, Z., Bird, R., Schnabel, R.: A stochastic/perturbation global optimization algorithm for distance geometry problems. J. Glob. Optim. 11, 91-105 (1997)