Euclidean distance geometry and applications

SIAM Review

Volumn 56, Issue 1, 2014, Pages 3-69

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

^a ÉCOLE POLYTECHNIQUE   (France)

^b IBM T J WATSON RESEARCH CENTER   (United States)

^c UNIVERSITY OF CAMPINAS   (Brazil)

^d FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^e UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Bar and joint framework; Graph rigidity; Inverse problem; Matrix completion; Protein conformation; Sensor network

Indexed keywords

BAR-AND-JOINT FRAMEWORK; EUCLIDEAN DISTANCE; EUCLIDEAN GEOMETRY; EUCLIDEAN SPACES; INPUT DATAS; MATRIX COMPLETION; MOLECULAR CONFORMATION; PROTEIN CONFORMATION;

INVERSE PROBLEMS; SENSOR NETWORKS;

GEOMETRY;

EID: 84893837430     PISSN: 00361445     EISSN: None     Source Type: Journal    
DOI: 10.1137/120875909     Document Type: Article

References (245)

1. A. Alexandrov, Convex Polyhedra, Gosudarstv. Izdat. Tekhn.-Theor. Lit., Moscow, 1950 (in Russian).
2. A. Alfakih, A. Khandani, and H. Wolkowicz, Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl., 12 (1999), pp. 13-30.
3. R. Alves, A. Cassioli, A. Mucherino, C. Lavor, and L. Liberti, Adaptive branching in iBP with Clifford algebra, in Proceedings of the Workshop on Distance Geometry and Applications, A. Andrioni, C. Lavor, L. Liberti, A. Mucherino, N. Maculan, and R. Rodriguez, eds., Universidade Federal do Amazonas, Manaus, 2013, pp. 65-69.
4. B. Anderson, P. Belhumeur, T. Eren, D. Goldenberg, S. Morse, W. Whiteley, and R. Yang, Graphical properties of easily localizable sensor networks, Wireless Networks, 15 (2009), pp. 177-191.
5. P. Arabie, Was Euclid an unnecessarily sophisticated psychologist?, Psychometrika, 56 (1991), pp. 567-587.
6. L. Asimow and B. Roth, The rigidity of graphs, Trans. Amer. Math. Soc., 245 (1978), pp. 279-289.
7. L. Asimow and B. Roth, The rigidity of graphs II, J. Math. Anal. Appl., 68 (1979), pp. 171-190.
8. J. Aspnes, T. Eren, D. Goldenberg, S. Morse, W. Whiteley, R. Yang, B. Anderson, and P. Belhumeur, A theory of network localization, IEEE Trans. Mobile Comput., 5 (2006), pp. 1663-1678.
9. J. Aspnes, D. Goldenberg, and R. Yang, On the computational complexity of sensor network localization, in Algorithmic Aspects of Wireless Sensor Networks, S. Nikoletseas and J. Rolim, eds., Lecture Notes in Comput. Sci. 3121, Springer, Berlin, 2004, pp. 32-44.
10. L. Auslander and R. MacKenzie, Introduction to Differentiable Manifolds, Dover, New York, 1977.
11. A. Bahr, J. Leonard, and M. Fallon, Cooperative localization for autonomous underwater vehicles, Internat. J. Robotics Res., 28 (2009), pp. 714-728.
12. A. Barvinok, Problems of distance geometry and convex properties of quadratic maps, Discrete Comput. Geom., 13 (1995), pp. 189-202.
13. M. Belkin and P. Niyogi, Laplacian eigenmaps for dimensionality reduction and data representation, Neural Comput., 15 (2003), pp. 1373-1396.
14. P. Belotti, J. Lee, L. Liberti, F. Margot, and A. Wächter, Branching and bounds tightening techniques for non-convex MINLP, Optim. Methods Softw., 24 (2009), pp. 597-634.
15. A. Ben-Israel and B. Mond, What is invexity?, J. Aust. Math. Soc. Ser. B, 28 (1986), pp. 1-9.
16. R. Benedetti and J.-J. Risler, Real Algebraic and Semi-algebraic Sets, Hermann, Paris, 1990.
17. B. Berger, J. Kleinberg, and T. Leighton, Reconstructing a three-dimensional model with arbitrary errors, J. ACM, 46 (1999), pp. 212-235.
18. H. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. Bhat, H. Weissig, I. Shindyalov, and P. Bourne, The protein data bank, Nucleic Acid Res., 28 (2000), pp. 235-242.
19. N. Biggs, Algebraic Graph Theory, Cambridge University Press, Cambridge, UK, 1974.
20. N. Biggs, E. Lloyd, and R. Wilson, Graph Theory 1736-1936, Oxford University Press, Oxford, 1976.
21. P. Biswas, Semidefinite Programming Approaches to Distance Geometry Problems, Ph.D. thesis, Stanford University, Stanford, CA, 2007.
22. P. Biswas, T. Lian, T. Wang, and Y. Ye, Semidefinite programming based algorithms for sensor network localization, ACM Trans. Sensor Networks, 2 (2006), pp. 188-220.
23. P. Biswas, T.-C. Liang, K.-C. Toh, T.-C. Wang, and Y. Ye, Semidefinite programming approaches for sensor network localization with noisy distance measurements, IEEE Trans. Automation Sci. Engrg., 3 (2006), pp. 360-371.
24. P. Biswas, K.-C. Toh, and Y. Ye, A distributed SDP approach for large-scale noisy anchorfree graph realization with applications to molecular conformation, SIAM J. Sci. Comput., 30 (2008), pp. 1251-1277.
25. P. Biswas and Y. Ye, Semidefinite programming for ad hoc wireless sensor network localization, in Proceedings of the 3rd International Symposium on Information Processing in Sensor Networks (IPSN04), ACM, New York, 2004, pp. 46-54.
26. P. Biswas and Y. Ye, A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization, in Multiscale Optimization Methods and Applications, W. Hager et al., eds., Nonconvex Optim. Appl. 82, Springer, New York, 2006, pp. 69-84.
27. A. Björner, M. Las Vergnas, B. Sturmfels, N. White, and G. Ziegler, Oriented Matroids, Cambridge University Press, Cambridge, UK, 1993.
28. L. Blumenthal, Theory and Applications of Distance Geometry, Oxford University Press, Oxford, 1953.
29. H. Bohr and S. Brunak, eds., Protein Folds: A Distance Based Approach, CRC Press, Boca Raton, FL, 1996.
30. J. Bokowski and B. Sturmfels, On the coordinatization of oriented matroids, Discrete Comput. Geom., 1 (1986), pp. 293-306.
31. I. Borg and P. Groenen, Modern Multidimensional Scaling, 2nd ed., Springer, New York, 2010.
32. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory, SIAM, Philadelphia, 1994.
33. H. Breu and D. Kirkpatrick, Unit disk graph recognition is NP-hard, Comput. Geom., 9 (1998), pp. 3-24.
34. J. Canny and I. Emiris, A subdivision-based algorithm for the sparse resultant, J. ACM, 47 (2000), pp. 417-451.
35. J. Carroll and J. Chang, Analysis of individual differences in multidimensional scaling via an n-way generalization of "Eckart-Young" decomposition, Psychometrika, 35 (1970), pp. 283-319.
36. R. Carvalho, C. Lavor, and F. Protti, Extending the geometric build-up algorithm for the molecular distance geometry problem, Inform. Process. Lett., 108 (2008), pp. 234-237.
37. A.-L. Cauchy, Sur les polygones et les polyèdres, J. Ecole Polytechnique, 16 (1813), pp. 87-99.
38. A. Cayley, A theorem in the geometry of position, Cambridge Math. J., 2 (1841), pp. 267-271.
39. H. Chen, Distance Geometry for Kissing Balls, preprint, arXiv:1203.2131v2, 2012.
40. C. Chevalley, The Construction and Study of Certain Important Algebras, The Mathematical Society of Japan, Tokyo, 1955.
41. B. Clark, C. Colburn, and D. Johnson, Unit disk graphs, Discrete Math., 86 (1990), pp. 165-177.
42. G. Clore and A. Gronenborn, Determination of three-dimensional structures of proteins and nucleic acids in solution by nuclear magnetic resonance spectroscopy, Critical Reviews in Biochemistry and Molecular Biology, 24 (1989), pp. 479-564.
43. R. Connelly, A counterexample to the rigidity conjecture for polyhedra, Inst. Hautes Études Sci. Publ. Math., 47 (1978), pp. 333-338.
44. R. Connelly, On generic global rigidity, in Applied Geometry and Discrete Mathematics, DIMACS Ser. Discrete Math. Theoret. Comput. Sci. 4, AMS, Providence, RI, 1991, pp. 147-155.
45. R. Connelly, Generic global rigidity, Discrete Comput. Geom., 33 (2005), pp. 549-563.
46. J. Conway and N. Sloane, Sphere Packings, Lattices and Groups, Springer, Berlin, 1993.
47. I. Coope, Reliable computation of the points of intersection of n spheres in Rn, Aust. N. Z. Indust. Appl. Math. J., 42 (2000), pp. C461-C477.
48. V. Costa, C. Lavor, A. Mucherino, A. Cassioli, L. Carvalho, and N. Maculan, Discretization orders for protein side chains, J. Global Optim., to appear.
49. L. Cremona, Le figure reciproche nella statica grafica, G. Bernardoni, Milano, 1872.
50. L. Cremona, Elementi di calcolo grafico, Paravia, Torino, 1874.
51. G. Crippen, Distance geometry for realistic molecular conformations, in Distance Geometry: Theory, Methods, and Applications, A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New York, 2013, pp. 315-328.
52. G. Crippen and T. Havel, Distance Geometry and Molecular Conformation, Wiley, New York, 1988.
53. A. Crum Brown, On the theory of isomeric compounds, Trans. Roy. Soc. Edinburgh, 23 (1864), pp. 707-719.
54. M. Cucuringu, Y. Lipman, and A. Singer, Sensor network localization by eigenvector synchronization over the Euclidean group, ACM Trans. Sensor Networks, 8 (2012), pp. 1-42.
55. M. Cucuringu, A. Singer, and D. Cowburn, Eigenvector synchronization, graph rigidity and the molecule problem, Inform. Inference, 1 (2012), pp. 21-67.
56. J. Dattorro, Convex Optimization and Euclidean Distance Geometry, Mß oo, Palo Alto, 2005.
57. J. Dattorro, Equality relating Euclidean distance cone to positive semidefinite cone, Linear Algebra Appl., 428 (2008), pp. 2597-2600.
58. J. de Leeuw and W. Heiser, Theory of multidimensional scaling, in Classification Pattern Recognition and Reduction of Dimensionality, P. Krishnaiah and L. Kanal, eds., Handbook of Statist. 2, Elsevier, 1982, pp. 285-316.
59. E. Demaine, F. Gomez-Martin, H. Meijer, D. Rappaport, P. Taslakian, G. Toussaint, T. Winograd, and D. Wood, The distance geometry of music, Comput. Geom., 42 (2009), pp. 429-454.
60. M. Deza and E. Deza, Encyclopedia of Distances, Springer, Berlin, 2009.
61. R. Diestel, Graph Theory, Springer, New York, 2005.
62. G. Dirac, On rigid circuit graphs, Abh. Math. Sem. Univ. Hamburg, 25 (1961), pp. 71-76.
63. L. Doherty, K. Pister, and L. El Ghaoui, Convex position estimation in wireless sensor networks, in Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 3 of INFOCOM, IEEE, 2001, pp. 1655-1663.
64. B. Donald, Algorithms in Structural Molecular Biology, MIT Press, Boston, 2011.
65. Q. Dong and Z. Wu, A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances, J. Global Optim., 22 (2002), pp. 365-375.
66. Q. Dong and Z. Wu, A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data, J. Global Optim., 26 (2003), pp. 321-333.
67. A. Dress and T. Havel, Distance geometry and geometric algebra, Found. Phys., 23 (1993), pp. 1357-1374.
68. G. Dzemyda, O. Kurasova, and J. Žilinskas, Multidimensional Data Visualiation: Methods and Applications, Springer, New York, 2013.
69. E. Dzhafarov and H. Colonius, Reconstructing distances among objects from their discriminability, Psychometrika, 71 (2006), pp. 365-386.
70. J. Eaton, GNU Octave Manual, Network Theory Limited, 2002.
71. C. Eckart and G. Young, The approximation of one matrix by another of lower rank, Psychometrika, 1 (1936), pp. 211-218.
72. I. Emiris and B. Mourrain, Computer algebra methods for studying and computing molecular conformations, Algorithmica, 25 (1999), pp. 372-402.
73. T. Eren, D. Goldenberg, W. Whiteley, Y. Yang, A. Morse, B. Anderson, and P. Belhumeur, Rigidity, computation, and randomization in network localization, IEEE Infocom Proc., 4 (2004), pp. 2673-2684.
74. B. Everitt and S. Rabe-Hesketh, The Analysis of Proximity Data, Arnold, London, 1997.
75. S. Feferman, J. Dawson, S. Kleene, G. Moore, R. Solovay, and J. van Heijenoort, eds., Kurt Gödel: Collected Works, Vol. I, Oxford University Press, Oxford, 1986.
76. Z. Fekete and T. Jordán, Uniquely localizable networks with few anchors, in Algorithmic Aspects of Wireless Sensor Networks, S. Nikoletseas and J. Rolim, eds., Lecture Notes in Comput. Sci. 4240, Springer, Berlin, 2006, pp. 176-183.
77. G. Forman and J. Zahorjan, The challenges of mobile computing, IEEE Comput., 27 (1994), pp. 38-47.
78. I. Fudos and C. Hoffmann, A graph-constructive approach to solving systems of geometric constraints, ACM Trans. Graphics, 16 (1997), pp. 179-216.
79. M. Garey and D. Johnson, Computers and Intractability: A Guide to the Theory of NPCompleteness, Freeman and Company, New York, 1979.
80. K. Gibson and H. Scheraga, Energy minimization of rigid-geometry polypeptides with exactly closed disulfide loops, J. Comput. Chem., 18 (1997), pp. 403-415.
81. H. Gluck, Almost all simply connected closed surfaces are rigid, in Geometric Topology, A. Dold and B. Eckmann, eds., Lecture Notes in Math. 438, Springer, Berlin, 1975, pp. 225-239.
82. W. Glunt, T. L. Hayden, S. Hong, and J. Wells, An alternating projection algorithm for computing the nearest Euclidean distance matrix, SIAM J. Matrix Anal. Appl., 11 (1990), pp. 589-600.
83. S. Gortler, A. Healy, and D. Thurston, Characterizing generic global rigidity, Amer. J. Math., 132 (2010), pp. 897-939.
84. J. Gower, Some distance properties of latent root and vector methods in multivariate analysis, Biometrika, 53 (1966), pp. 325-338.
85. J. Gower, Euclidean distance geometry, Math. Sci., 7 (1982), pp. 1-14.
86. W. Gramacho, A. Mucherino, C. Lavor, and N. Maculan, A parallel BP algorithm for the discretizable distance geometry problem, in Proceedings of the Workshop on Parallel Computing and Optimization, Shanghai, 2012, IEEE, pp. 1756-1762.
87. J. Graver, Rigidity matroids, SIAM J. Discrete Math., 4 (1991), pp. 355-368.
88. J. Graver, B. Servatius, and H. Servatius, Combinatorial Rigidity, AMS, Providence, RI, 1993.
89. L. Grippo and M. Sciandrone, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints, Oper. Res. Lett., 26 (2000), pp. 127-136.
90. R. Grone, C. Johnson, E. de Sá, and H. Wolkowicz, Positive definite completions of partial Hermitian matrices, Linear Algebra Appl., 58 (1984), pp. 109-124.
91. A. Grosso, M. Locatelli, and F. Schoen, Solving molecular distance geometry problems by global optimization algorithms, Comput. Optim. Appl., 43 (2009), pp. 23-27.
92. T. Havel, Metric matrix embedding in protein structure calculations, Magnetic Resonance Chem., 41 (2003), pp. 537-550.
93. T. Havel, I. Kuntz, and G. Crippen, The theory and practice of distance geometry, Bull. Math. Biol., 45 (1983), pp. 665-720.
94. B. Hendrickson, Conditions for unique graph realizations, SIAM J. Comput., 21 (1992), pp. 65-84.
95. B. Hendrickson, The molecule problem: Exploiting structure in global optimization, SIAM J. Optim., 5 (1995), pp. 835-857.
96. L. Henneberg, Statik der starren Systeme, Bergstræsser, Darmstadt, 1886.
97. L. Henneberg, Die Graphische Statik der starren Systeme, Teubner, Leipzig, 1911.
98. L. Hoai An, Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming, J. Global Optim., 27 (2003), pp. 375-397.
99. L. T. Hoai An and P. Dinh Tao, Large-scale molecular optimization from distance matrices by a d.c. optimization approach, SIAM J. Optim., 14 (2003), pp. 77-114.
100. H.-X. Huang, Z.-A. Liang, and P. Pardalos, Some properties for the Euclidean distance matrix and positive semidefinite matrix completion problems, J. Global Optim., 25 (2003), pp. 3-21.
101. K. Hunt, Kinematic Geometry of Mechanisms, Oxford University Press, Oxford, 1990.
102. S. Izrailev, F. Zhu, and D. Agrafiotis, A distance geometry heuristic for expanding the range of geometries sampled during conformational search, J. Comput. Chem., 26 (2006), pp. 1962-1969.
103. B. Jackson and T. Jordán, Connected rigidity matroids and unique realization of graphs, J. Combin. Theory Ser. B, 94 (2005), pp. 1-29.
104. B. Jackson and T. Jordán, On the rigidity of molecular graphs, Combinatorica, 28 (2008), pp. 645-658.
105. B. Jackson and T. Jordán, Graph theoretic techniques in the analysis of uniquely localizable sensor networks, in Localization Algorithms and Strategies for Wireless Sensor Networks: Monitoring and Surveillance Techniques for Target Tracking, G. Mao and B. Fidan, eds., IGI Global, 2009, pp. 146-173.
106. C. Johnson, B. Kroschel, and H. Wolkowicz, An interior-point method for approximate positive semidefinite completions, Comput. Optim. Appl., 9 (1998), pp. 175-190.
107. I. Jolliffe, Principal Component Analysis, 2nd ed., Springer, Berlin, 2010.
108. J. Kostrowicki and L. Piela, Diffusion equation method of global minimization: Performance for standard test functions, J. Optim. Theory Appl., 69 (1991), pp. 269-284.
109. P. Krishnaiah and L. Kanal, eds., Theory of Multidimensional Scaling, Vol. 2, North-Holland, 1982.
110. N. Krislock, Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion, Ph.D. thesis, University of Waterloo, 2010.
111. N. Krislock and H. Wolkowicz, Explicit sensor network localization using semidefinite representations and facial reductions, SIAM J. Optim., 20 (2010), pp. 2679-2708.
112. J. Kruskal, Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis, Psychometrika, 29 (1964), pp. 1-27.
113. J. Kruskal, Nonmetric multidimensional scaling: A numerical method, Psychometrika, 29 (1964), pp. 115-129.
114. S. Kucherenko, P. Belotti, L. Liberti, and N. Maculan, New formulations for the kissing number problem, Discrete Appl. Math., 155 (2007), pp. 1837-1841.
115. S. Kucherenko and Y. Sytsko, Application of deterministic low-discrepancy sequences in global optimization, Comput. Optim. Appl., 30 (2004), pp. 297-318.
116. G. Laman, On graphs and rigidity of plane skeletal structures, J. Engrg. Math., 4 (1970), pp. 331-340.
117. M. Laurent, Cuts, matrix completions and graph rigidity, Math. Program., 79 (1997), pp. 255-283.
118. M. Laurent, Polynomial instances of the positive semidefinite and Euclidean distance matrix completion problems, SIAM J. Matrix Anal. Appl., 22 (2000), pp. 874-894.
119. M. Laurent, Matrix completion problems, in Encyclopedia of Optimization, 2nd ed., C. Floudas and P. Pardalos, eds., Springer, New York, 2009, pp. 1967-1975.
120. C. Lavor, On generating instances for the molecular distance geometry problem, in Global Optimization: From Theory to Implementation, L. Liberti and N.Maculan, eds., Springer, Berlin, 2006, pp. 405-414.
121. C. Lavor, J. Lee, A. Lee-St. John, L. Liberti, A. Mucherino, and M. Sviridenko, Discretization orders for distance geometry problems, Optim. Lett., 6 (2012), pp. 783-796.
122. C. Lavor, L. Liberti, and N. Maculan, Grover's algorithm applied to the molecular distance geometry problem, in Proceedings of the 7th Brazilian Congress of Neural Networks, Natal, Brazil, 2005.
123. C. Lavor, L. Liberti, and N. Maculan, Computational experience with the molecular distance geometry problem, in Global Optimization: Scientific and Engineering Case Studies, J. Pintér, ed., Springer, Berlin, 2006, pp. 213-225.
124. C. Lavor, L. Liberti, and N. Maculan, The Discretizable Molecular Distance Geometry Problem, preprint, arXiv:q-bio/0608012, 2006.
125. C. Lavor, L. Liberti, and N. Maculan, Molecular distance geometry problem, in Encyclopedia of Optimization, 2nd ed., C. Floudas and P. Pardalos, eds., Springer, New York, 2009, pp. 2305-2311.
126. C. Lavor, L. Liberti, and N. Maculan, A note on "A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem," Internat. Trans. Oper. Res., 18 (2011), pp. 751-752.
127. C. Lavor, L. Liberti, N. Maculan, and A. Mucherino, The discretizable molecular distance geometry problem, Comput. Optim. Appl., 52 (2012), pp. 115-146.
128. C. Lavor, L. Liberti, N. Maculan, and A. Mucherino, Recent advances on the discretizable molecular distance geometry problem, European J. Oper. Res., 219 (2012), pp. 698-706.
129. C. Lavor, L. Liberti, and A. Mucherino, The interval branch-and-prune algorithm for the discretizable molecular distance geometry problem with inexact distances, J. Global Optim., 56 (2013), pp. 855-871.
130. C. Lavor, L. Liberti, A. Mucherino, and N. Maculan, On a discretizable subclass of instances of the molecular distance geometry problem, in Proceedings of the 24th Annual ACM Symposium on Applied Computing, D. Shin, ed., ACM, New York, 2009, pp. 804-805.
131. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan, An artificial backbone of hydrogens for finding the conformation of protein molecules, in Proceedings of the Computational Structural Bioinformatics Workshop, Washington D.C., IEEE, 2009, pp. 152-155.
132. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan, 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, IEEE, 2009, pp. 751-756.
133. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan, Discrete approaches for solving molecular distance geometry problems using NMR data, Internat. J. Comput. Biosci., 1 (2010), pp. 88-94.
134. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan, On the solution of molecular distance geometry problems with interval data, in Proceedings of the International Workshop on Computational Proteomics, Hong Kong, IEEE, 2010, pp. 77-82.
135. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan, On the computation of protein backbones by using artificial backbones of hydrogens, J. Global Optim., 50 (2011), pp. 329-344.
136. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan, Finding low-energy homopolymer conformations by a discrete approach, in Proceedings of the Global Optimization Workshop, D. Aloise, P. Hansen, and C. Rocha, eds., Universidade Federal do Rio Grande do Norte, Natal, 2012.
137. S. Le Grand, A. Elofsson, and D. Eisenberg, The effect of distance-cutoff on the performance of the distance matrix error when used as a potential function to drive conformational search, in Protein Folds: A Distance Based Approach, H. Bohr and S. Brunak, eds., CRC Press, Boca Raton, FL, 1996, pp. 105-113.
138. J. Lee and M. Verleysen, Nonlinear Dimensionality Reduction, Springer, Berlin, 2010.
139. N.-H. Z. Leung and K.-C. Toh, An SDP-based divide-and-conquer algorithm for large-scale noisy anchor-free graph realization, SIAM J. Sci. Comput., 31 (2009), pp. 4351-4372.
140. L. Liberti, Reformulation and Convex Relaxation Techniques for Global Optimization, Ph.D. thesis, Imperial College London, London, 2004.
141. L. Liberti, Reformulations in mathematical programming: Definitions and systematics, RAIRO Oper. Res., 43 (2009), pp. 55-85.
142. L. Liberti and M. Dražic, Variable neighbourhood search for the global optimization of constrained NLPs, in Proceedings of GO Workshop, Almeria, Spain, 2005.
143. L. Liberti and S. Kucherenko, Comparison of Deterministic and Stochastic Approaches to Global Optimization, Tech. Rep. 2004.25, DEI, Politecnico di Milano, 2004.
144. L. Liberti and C. Lavor, On a relationship between graph realizability and distance matrix completion, in Optimization Theory, Decision Making, and Operational Research Applications, A. Migdalas, A. Sifaleras, C. Georgiadis, J. Papathanaiou, and E. Stiakakis, eds., Proc. Math. Statist. 31, Springer, Berlin, 2013, pp. 39-48.
145. L. Liberti, C. Lavor, and N. Maculan, A branch-and-prune algorithm for the molecular distance geometry problem, Internat. Trans. Oper. Res., 15 (2008), pp. 1-17.
146. L. Liberti, C. Lavor, N. Maculan, and F. Marinelli, Double variable neighbourhood search with smoothing for the molecular distance geometry problem, J. Global Optim., 43 (2009), pp. 207-218.
147. L. Liberti, C. Lavor, and A. Mucherino, The discretizable molecular distance geometry problem seems easier on proteins, in Distance Geometry: Theory, Methods, and Applications, A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New York, 2013, pp. 47-60.
148. L. Liberti, C. Lavor, A. Mucherino, and N. Maculan, Molecular distance geometry methods: From continuous to discrete, Internat. Trans. Oper. Res., 18 (2010), pp. 33-51.
149. L. Liberti, B. Masson, C. Lavor, J. Lee, and A. Mucherino, On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem, preprint, arXiv:1010.1834v1 [cs.DM], 2010.
150. L. Liberti, B. Masson, C. Lavor, and A. Mucherino, Branch-and-prune trees with bounded width, in Proceedings of Cologne/Twente Workshop, G. Nicosia and A. Pacifici, eds., Università di Roma 2-Tor Vergata, Rome, 2011.
151. L. Liberti, B. Masson, J. Lee, C. Lavor, and A. Mucherino, On the number of solutions of the discretizable molecular distance geometry problem, in Combinatorial Optimization, Constraints and Applications (COCOA11), Lecture Notes in Comput. Sci. 6831, Springer, New York, 2011, pp. 322-342.
152. L. Liberti, B. Masson, J. Lee, C. Lavor, and A. Mucherino, On the number of realizations of certain Henneberg graphs arising in protein conformation, Discrete Appl. Math., to appear.
153. L. Liberti, P. Tsiakis, B. Keeping, and C. Pantelides, ooOPS, Centre for Process Systems Engineering, Chemical Engineering Department, Imperial College London, London, 2001.
154. L. Lovász and Y. Yemini, On generic rigidity in the plane, SIAM J. Algebraic Discrete Methods, 3 (1982), pp. 91-98.
155. Y. Ma and Y. Fu, eds., Manifold Learning Theory and Applications, CRC Press, Boca Raton, FL, 2012.
156. T. Malliavin, A. Mucherino, and M. Nilges, Distance geometry in structural biology, in Distance Geometry: Theory, Methods, and Applications, A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New York, 2013, pp. 329-350.
157. A. Man-Cho So and Y. Ye, Theory of semidefinite programming for sensor network localization, Math. Program. Ser. B, 109 (2007), pp. 367-384.
158. D. Manocha and J. Canny, Efficient inverse kinematics for general 6R manipulators, IEEE Trans. Robotics Automation, 10 (1994), pp. 648-657.
159. J. Maxwell, On reciprocal figures and diagrams of forces, Philos. Mag., 27 (1864), pp. 250-261.
160. J. Maxwell, On the calculation of the equilibrium and stiffness of frames, Philos. Mag., 27 (1864), pp. 294-299.
161. K. Menger, Untersuchungen über allgemeine Metrik, Math. Ann., 100 (1928), pp. 75-163.
162. K. Menger, New foundation of Euclidean geometry, Amer. J. Math., 53 (1931), pp. 721-745.
163. B. Mishra, Computational real algebraic geometry, in Handbook of Discrete and Computational Geometry, 2nd ed., J. Goodman and J. O'Rourke, eds., CRC Press, Boca Raton, FL, 2004, pp. 743-764.
164. J. Moré and Z. Wu, Global continuation for distance geometry problems, SIAM J. Optim., 7 (1997), pp. 814-836.
165. J. Moré and Z. Wu, Distance geometry optimization for protein structures, J. Global Optim., 15 (1999), pp. 219-234.
166. A. Mucherino and C. Lavor, 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, 2009, pp. 349-353.
167. A. Mucherino, C. Lavor, and L. Liberti, A symmetry-driven BP algorithm for the discretizable molecular distance geometry problem, in Proceedings of Computational Structural Bioinformatics Workshop, IEEE, 2011, pp. 390-395.
168. A. Mucherino, C. Lavor, and L. Liberti, The discretizable distance geometry problem, Optim. Lett., 6 (2012), pp. 1671-1686.
169. A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, On the definition of artificial backbones for the discretizable molecular distance geometry problem, Math. Balkanica (N.S.), 23 (2009), pp. 289-302.
170. A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, Strategies for solving distance geometry problems with inexact distances by discrete approaches, in Proceedings of the Toulouse Global Optimization Workshop, S. Cafieri, E. Hendrix, L. Liberti, and F. Messine, eds., Toulouse, 2010, pp. 93-96.
171. A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, On the discretization of distance geometry problems, in Proceedings of the Conference on Mathematics of Distances and Applications, M. Deza, M. Petitjean, and K. Markov, eds., ITHEA, Varna, 2012, pp. 160-168.
172. A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Distance Geometry: Theory, Methods, and Applications, Springer, New York, 2013.
173. A. Mucherino, C. Lavor, L. Liberti, and E.-G. Talbi, 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, 2010, pp. 1-6.
174. A. Mucherino, C. Lavor, and N. Maculan, The molecular distance geometry problem applied to protein conformations, in Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, eds., École Polytechnique, Paris, 2009, pp. 337-340.
175. A. Mucherino, C. Lavor, T. Malliavin, L. Liberti, M. Nilges, and N. Maculan, Influence of pruning devices on the solution of molecular distance geometry problems, in Experimental Algorithms, P. Pardalos and S. Rebennack, eds., Lecture Notes in Comput. Sci. 6630, Springer, Berlin, 2011, pp. 206-217.
176. A. Mucherino, L. Liberti, and C. Lavor, MD-jeep: An implementation of a branch-andprune algorithm for distance geometry problems, in Mathematical Software, K. Fukuda, J. van der Hoeven, M. Joswig, and N. Takayama, eds., Lecture Notes in Comput. Sci. 6327, Springer, New York, 2010, pp. 186-197.
177. A. Mucherino, L. Liberti, C. Lavor, and N. Maculan, Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem, in Proceedings of the Genetic and Evolutionary Computation Conference, F. Rothlauf, ed., Montreal, ACM, New York, 2009, pp. 333-340.
178. J. Nielsen and B. Roth, On the kinematic analysis of robotic mechanisms, Internat. J. Robotics Res., 18 (1999), pp. 1147-1160.
179. M. Nilges, M. Macias, S. O'Donoghue, and H. Oschkinat, Automated NOESY interpretation with ambiguous distance restraints: The refined NMR solution structure of the Pleckstrin homology domain from β-spectrin, J. Molecular Biol., 269 (1997), pp. 408-422.
180. P. Nucci, L. Nogueira, and C. Lavor, Solving the discretizable molecular distance geometry problem by multiple realization trees, in Distance Geometry: Theory, Methods, and Applications, A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New York, 2013, pp. 161-176.
181. M. Petitjean, Sphere unions and intersections and some of their applications in molecular modeling, in Distance Geometry: Theory, Methods, and Applications, A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New York, 2013, pp. 61-83.
182. T. Pong and P. Tseng, (Robust) edge-based semidefinite programming relaxation of sensor network localization, Math. Program. Ser. A, 130 (2011), pp. 321-358.
183. J. Porta, L. Ros, and F. Thomas, Inverse kinematics by distance matrix completion, in Proceedings of the 12th International Workshop on Computational Kinematics, 2005, pp. 1-9.
184. J. Porta, L. Ros, F. Thomas, and C. Torras, A branch-and-prune solver for distance constraints, IEEE Trans. Robotics, 21 (2005), pp. 176-187.
185. R. Rao, A. Asaithambi, and S. Agrawal, Inverse kinematic solution of robot manipulators using interval analysis, ASME J. Mech. Design, 120 (1998), pp. 147-150.
186. R. Reams, G. Chatham, W. Glunt, D. McDonald, and T. Hayden, Determining protein structure using the distance geometry program APA, Computers and Chemistry, 23 (1999), pp. 153-163.
187. A. Recski, A network theory approach to the rigidity of skeletal structures. Part 2. Laman's theorem and topological formulae, Discrete Appl. Math., 8 (1984), pp. 63-68.
188. N. Rojas, Distance-Based Formulations for the Position Analysis of Kinematic Chains, Ph.D. thesis, Universitat Politecnica de Catalunya, 1989.
189. D. J. Rose, R. E. Tarjan, and G. S. Lueker, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
190. B. Roth, Rigid and flexible frameworks, Amer. Math. Monthly, 88 (1981), pp. 6-21.
191. B. Roth and F. Freudenstein, Synthesis of path-generating mechanisms by numerical methods, J. Engrg. Industry, 85 (1963), pp. 298-307.
192. S. Sallaume, S. Martins, L. Ochi, W. Gramacho, C. Lavor, and L. Liberti, A discrete search algorithm for finding the structure of protein backbones and side chains, Internat. J. Bioinform. Res. Appl., 9 (2013), pp. 261-270.
193. R. Santana, P. Larrañaga, and J. Lozano, Side chain placement using estimation of distribution algorithms, Art. Intell. Med., 39 (2007), pp. 49-63.
194. C. Saviotti, Nouvelles méthodes pour le calcul des travures réticulaires, in Appendix to L. Cremona, "Les figures réciproques en statique graphique," Gauthier-Villars, Paris, 1885, pp. 37-100.
195. C. Saviotti, La statica grafica: Lezioni, U. Hoepli, Milano, 1888.
196. A. Savvides, C.-C. Han, and M. Strivastava, Dynamic fine-grained localization in ad-hoc networks of sensors, in Proceedings of the 7th Annual International Conference on Mobile Computing and Networking, MobiCom '01, ACM, New York, 2001, pp. 166-179.
197. J. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, Proceedings of the 17th Allerton Conference in Communications, Control and Computing, 1979, pp. 480-489.
198. T. Schlick, Molecular Modelling and Simulation: An Interdisciplinary Guide, Springer, New York, 2002.
199. I. Schoenberg, 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. of Math., 36 (1935), pp. 724-732.
200. B. Servatius and H. Servatius, Generic and abstract rigidity, in Rigidity Theory and Applications, M. Thorpe and P. Duxbury, eds., Fundamental Materials Research, Springer, New York, 2002, pp. 1-19.
201. R. Shepard, The analysis of proximities: Multidimensional scaling with an unknown distance function, Part I, Psychometrika, 27 (1962), pp. 125-140.
202. R. Shepard, The analysis of proximities: Multidimensional scaling with an unknown distance function, Part II, Psychometrika, 27 (1962), pp. 219-246.
203. R. Shepard, Metric structures in ordinal data, J. Math. Psych., 3 (1966), pp. 287-315.
204. A. Singer, Angular synchronization by eigenvectors and semidefinite programming, Appl. Comput. Harmon. Anal., 30 (2011), pp. 20-36.
205. A. Singer and M. Cucuringu, Uniqueness of low-rank matrix completion by rigidity theory, SIAM J. Matrix Anal. Appl., 31 (2010), pp. 1621-1641.
206. A. Singer, Z. Zhao, Y. Shkolnisky, and R. Hadani, Viewing angle classification of cryoelectron microscopy images using eigenvectors, SIAM J. Imaging Sci., 4 (2011), pp. 723-759.
207. M. Sippl and H. Scheraga, Solution of the embedding problem and decomposition of symmetric matrices, Proc. Natl. Acad. Sci. USA, 82 (1985), pp. 2197-2201.
208. M. Sippl and H. Scheraga, Cayley-Menger coordinates, Proc. Natl. Acad. Sci. USA, 83 (1986), pp. 2283-2287.
209. M. Sitharam and Y. Zhou, A tractable, approximate, combinatorial 3D rigidity characterization, in the Fifth Workshop on Automated Deduction in Geometry, 2004.
210. M. Souza, C. Lavor, A. Muritiba, and N. Maculan, Solving the molecular distance geometry problem with inaccurate distance data, BMC Bioinform., 14 (2013), pp. S71-S76.
211. M. Souza, A. Xavier, C. Lavor, and N. Maculan, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, Oper. Res. Lett., 39 (2011), pp. 461-465.
212. C. Stumpf, Tonpsychologie, Vol. I, Hirzel, Leipzig, 1883.
213. C. Stumpf, Tonpsychologie, Vol. II, Hirzel, Leipzig, 1890.
214. J. Sylvester, Chemistry and algebra, Nature, 17 (1877), pp. 284-284.
215. Y. Takane, F. Young, and J. De Leeuw, Nonmetric individual differences in multidimensional scaling: An alternating least squares method with optimal scaling features, Psychometrika, 42 (1977), pp. 7-67.
216. T.-S. Tay, On the generic rigidity of bar-frameworks, Adv. Appl. Math., 23 (1999), pp. 14-28.
217. T.-S. Tay and W. Whiteley, Generating isostatic frameworks, Struct. Topology, 11 (1985), pp. 21-69.
218. J. Tenenbaum, V. de Silva, and J. Langford, A global geometric framework for nonlinear dimensionality reduction, Science, 290 (2000), pp. 2319-2322.
219. F. Thomas, J. Porta, and L. Ros, Distance constraints solved geometrically, in Advances in Robot Kinematics, G. Galletti and J. Lenarcic, eds., Kluwer, Dordrecht, 2004, pp. 123-132.
220. C. Thomassen, The graph genus problem is NP-complete, J. Algorithms, 10 (1989), pp. 568-576.
221. D. Tolani, A. Goswami, and N. Badler, Real-time inverse kinematics techniques for anthropomorphic limbs, Graphical Models, 62 (2000), pp. 353-388.
222. W. Torgerson, Theory and Methods of Scaling, Wiley, New York, 1958.
223. L. Tsai and A. Morgan, Solving the kinematics of the most general six-and five-degree-offreedom manipulators by continuation methods, J. Mech. Transmissions Automation in Design, 107 (1985), pp. 189-200.
224. P. Tseng, Convergence of a block coordinate descent method for nondifferentiable minimization, J. Optim. Theory Appl., 109 (2001), pp. 475-494.
225. P. Tseng, Second-order cone programming relaxations of sensor network localization, SIAM J. Optim., 18 (2007), pp. 156-185.
226. P. Varignon, Nouvelle Mécanique, Claude Jombert, Paris, 1725.
227. Z. Voller and Z. Wu, Distance geometry methods for protein structure determination, in Distance Geometry: Theory, Methods, and Applications, A. Mucherino, C. Lavor, L. Liberti, and N. Maculan, eds., Springer, New York, 2013, pp. 139-159.
228. P. von Rague, P. Schreiner, N. Allinger, T. Clark, J. Gasteiger, P. Kollman, and H. Schaefer, eds., Distance Geometry: Theory, Algorithms, and Chemical Applications, Wiley, 1988.
229. C. Wampler, A. Morgan, and A. Sommese, Numerical continuation methods for solving polynomial systems arising in kinematics, J. Mech. Design, 112 (1990), pp. 59-68.
230. Z. Wang, S. Zheng, Y. Ye, and S. Boyd, Further relaxations of the semidefinite programming approach to sensor network localization, SIAM J. Optim., 19 (2008), pp. 655-673.
231. M. Weiser, Some computer science issues in ubiquitous computing, Comm. ACM, 36 (1993), pp. 75-84.
232. W. Whiteley, Infinitesimally rigid polyhedra. I. Statics of frameworks, Trans. Amer. Math. Soc., 285 (1984), pp. 431-465.
233. W. Whiteley, Rigidity and scene analysis, in Handbook of Discrete and Computational Geometry, J. Goodman and J. O'Rourke, eds., CRC Press, Boca Raton, FL, 2004.
234. G. Williams, J. Dugan, and R. Altman, Constrained global optimization for estimating molecular structure from atomic distances, J. Comput. Biol., 8 (2001), pp. 523-547.
235. D. Wu and Z. Wu, An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data, J. Global Optim., 37 (2007), pp. 661-673.
236. D. Wu, Z. Wu, and Y. Yuan, Rigid versus unique determination of protein structures with geometric buildup, Optim. Lett., 2 (2008), pp. 319-331.
237. K. Wüthrich, Protein structure determination in solution by nuclear magnetic resonance spectroscopy, Science, 243 (1989), pp. 45-50.
238. K. Wüthrich, M. Billeter, and W. Braun, 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 resonance, J. Molecular Biol., 169 (1983), pp. 949-961.
239. H. Xu, S. Izrailev, and D. Agrafiotis, Conformational sampling by self-organization, J. Chem. Inform. Comput. Sci., 43 (2003), pp. 1186-1191.
240. L. Yang, Solving spatial constraints with global distance coordinate system, J. Comput. Geom. Appl., 16 (2006), pp. 533-547.
241. Y. Yemini, The positioning problem-a draft of an intermediate summary, in Proceedings of the Conference on Distributed Sensor Networks, Carnegie-Mellon University, Pittsburgh, 1978, pp. 137-145.
242. Y. Yemini, Some theoretical aspects of position-location problems, in Proceedings of the 20th Annual Symposium on the Foundations of Computer Science, IEEE, 1979, pp. 1-8.
243. M. Zhang, R. White, L. Wang, R. Goldman, L. Kavraki, and B. Hassett, Improving conformational searches by geometric screening, Bioinform., 21 (2005), pp. 624-630.
244. Z. Zhu, A. Man-Cho So, and Y. Ye, Universal rigidity and edge sparsification for sensor network localization, SIAM J. Optim., 20 (2010), pp. 3059-3081.
245. A. Žilinskas and J. Žilinskas, Branch and bound algorithm for multidimensional scaling with city-block metric, J. Global Optim., 43 (2009), pp. 357-372.