Skip to main content
SpringerLink
Log in

Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures

  • SI: 4OR Surveys
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In the 2 years since our last 4OR review of distance geometry methods with applications to proteins and nanostructures, there has been rapid progress in treating uncertainties in the discretizable distance geometry problem; and a new class of geometry problems started to be explored, namely vector geometry problems. In this work we review this progress in the context of the earlier literature.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

(Image from Gujarathi 2014)

Fig. 2

(Reproduced with permission from Juhás et al. 2006)

Fig. 3
Fig. 4

(Reproduced with permission from Duxbury et al. 2016)

Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

(Reproduced with permission from Billinge and Levin 2007)

Fig. 11

(Reroduced with permission from Juhás et al. 2006, 2008)

Similar content being viewed by others

Notes

  1. \(\langle (X,y), (\hat{X},\hat{y}) \rangle := \text {tr} (X \hat{X}^T) + y^T \hat{y}\).

References

  • Abud, G., Alencar, J., Lavor, C., Liberti, L., & Mucherino, A. (2018). The \(k\)-discretization and \(k\)-incident graphs for discretizable distance geometry. Optimization Letters. https://doi.org/10.1007/s11590-018-1294-2.

  • Agra, A., Figueiredo, R., Lavor, C., Maculan, N., Pereira, A., & Requejo, C. (2017). Feasibility check for the distance geometry problem: An application to molecular conformations. International Transactions in Operational Research, 24, 1023–1040.

    Google Scholar 

  • Almeida, F. C. L., Moraes, A. H., & Gomes-Neto, F. (2013). An overview on protein structure determination by NMR, historical and future perspectives of the use of distance geometry methods. In A. Mucherino et al. (Eds.), (Vol. 102, pp. 377–412).

  • Alves, R., & Lavor, C. (2017). Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem. Advances in Applied Clifford Algebra, 27, 439–452.

    Google Scholar 

  • Alves, R., Lavor, C., Souza, C., & Souza, M. (2018). Clifford algebra and discretizable distance geometry. Mathematical Methods in the Applied Sciences, 41(11), 4063–4073.

    Google Scholar 

  • Barzilai, J., & Borwein, J. (1988). Two-point step size gradient methods. IMA Journal of Numerical Analysis, 8, 141–148.

    Google Scholar 

  • Billinge, S. J. L., Duxbury, Ph M, Gonçalves, D. S., Lavor, C., & Mucherino, A. (2016). Assigned and unassigned distance geometry: Applications to biological molecules and nanostructures. Quarterly Journal of Operations Research, 14(4), 337–376.

    Google Scholar 

  • Billinge, S. J. L., & Kanatzidis, M. G. (2004). Beyond crystallography: the study of disorder, nanocrystallinity and crystallographically challenged materials with pair distribution functions. Chemical Communications (Cambridge, England), 7, 749–760.

    Google Scholar 

  • Billinge, S. J. L., & Levin, I. (2007). The problem with determining atomic structure at the nanoscale. Science, 316(5824), 561–565.

    Google Scholar 

  • Birgin, E. G., Martínez, J. M., & Raydan, M. (2000). Nonmonotone spectral projected gradient methods on convex sets. SIAM Journal on Optimization, 10, 1196–1211.

    Google Scholar 

  • Biswas, P., Lian, T., Wang, T., & Ye, Y. (2006). Semidefinite programming based algorithms for sensor network localization. ACM Transactions in Sensor Networks, 2, 188–220.

    Google Scholar 

  • Biswas, P., & Ye, Y. (2006). A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization (pp. 69–84). Boston: Springer.

    Google Scholar 

  • Blumenthal, L. M. (1953). Theory and applications of distance geometry (p. 347). Oxford: Clarendon Press.

    Google Scholar 

  • Bouchevreau, B., Martineau, C., Mellot-Draznieks, C., Tuel, A., Suchomel, M. R., Trebosc, J., et al. (2013). An NMR-driven crystallography strategy to overcome the computability limit of powder structure determination: A layered aluminophosphate case. International Journal of Computational Geometry and Applications, 19, 5009–5013.

    Google Scholar 

  • Boutin, M., & Kemper, G. (2007). Which point configurations are determined by the distribution of their pairwise distances. International Journal of Computational Geometry and Applications, 17(1), 31–43.

    Google Scholar 

  • Brunger, A. T., Adams, P. D., Clore, G. M., DeLano, W. L., Gros, P., Grosse-Kunstleve, R. W., et al. (1998). Crystallography & NMR system: A new software suite for macromolecular structure determination. Acta Crystallographica Section D: Biological Crystallography, 54(595), 905–921.

    Google Scholar 

  • 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.

    Google Scholar 

  • Cassioli, A., Bardiaux, B., Bouvier, G., Mucherino, A., Alves, R., Liberti, L., et al. (2015). An algorithm to enumerate all possible protein conformations verifying a set of distance restraints. BMC Bioinformatics, 16(23), 1–15.

    Google Scholar 

  • Clore, G. M., & Gronenborn, A. M. (1997). New methods of structure refinement for macromolecular structure determination by NMR. PNAS, 95, 5891–5898.

    Google Scholar 

  • Connelly, R. (1991). On generic global rigidity, in: Applied geometry and discrete mathematics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 4, 147–155.

    Google Scholar 

  • Connelly, R. (2005). Generic global rigidity. Discrete Computational Geometry, 33, 549–563.

    Google Scholar 

  • Connelly, R. (2013). Generic global rigidity of body-bar frameworks. Journal of Combinational Theory Series B, 103, 689–705.

    Google Scholar 

  • Coope, I. D. (2000). Reliable computation of the points of intersection of \(n\) spheres in \(n\)-space. ANZIAM Journal, 42, 461–477.

    Google Scholar 

  • Costa, T., Bouwmeester, H., Lodwick, W., & Lavor, C. (2017). Calculating the possible conformations arising from uncertainty in the molecular distance geometry problem using constraint interval analysis. Information Sciences, 415–416, 41–52.

    Google Scholar 

  • Costa, V., Mucherino, A., Lavor, C., Cassioli, A., Carvalho, L., & Maculan, N. (2014). Discretization orders for protein side chains. Journal of Global Optimization, 60, 333–349.

    Google Scholar 

  • Crippen, G. M., & Havel, T. F. (1988). Distance geometry and molecular conformation. New York: Wiley.

    Google Scholar 

  • D’Ambrosio, C., Ky, V., Lavor, C., Liberti, L., & Maculan, N. (2017). New error measures and methods for realizing protein graphs from distance data. Discrete & Computational Geometry, 57, 371–418.

    Google Scholar 

  • de Leeuw, J. (1988). Convergence of the majorization method for multidimensional scaling. Journal of Classification, 5, 163–180.

    Google Scholar 

  • Ding, Y., Krislock, N., Qian, J., & Wolkowicz, H. (2010). Sensor network localization, euclidean distance matrix completions, and graph realization. Optimization and Engineering, 11(1), 45–66.

    Google Scholar 

  • Dokmanic, I., & Lu, Y. M. (2016). Sampling sparse signals on the sphere: Algorithms and applications. IEEE Transactions on Signal Processing, 64(1), 189–202.

    Google Scholar 

  • Dokmanic, I., Parhizkar, R., Ranieri, J., & Vetterli, M. (2015). Euclidean distance matrices: Essential theory, algorithms, and applications. IEEE Signal Processing Magazine, 32(6), 12–30.

    Google Scholar 

  • Donald, B. R. (2011). Algorithms in structural molecular biology (p. 464). Boston: MIT Press.

    Google Scholar 

  • 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.

    Google Scholar 

  • Duxbury, P. M., Granlund, L., Gujarathi, S. R., Juhas, P., & Billinge, S. J. L. (2016). The unassigned distance geometry problem. Discrete Applied Mathematics, 204, 117–132.

    Google Scholar 

  • Egami, T., & Billinge, S. J. L. (2012). Underneath the Bragg peaks: Structural analysis of complex materials (2nd ed.). Oxford: Pergamon Press, Elsevier.

    Google Scholar 

  • Evrard, G., & Pusztai, L. (2005). Reverse Monte Carlo modelling of the structure of disordered materials with RMC++: A new implementation of the algorithm in C++. Journal of Physics: Condensed Matter, 17, S1–S13.

    Google Scholar 

  • Farrow, C. L., Juhas, P., Liu, J. W., Bryndin, D., Boz̈in, E. S., Bloch, J., et al. (2007). Pdffit2 and pdfgui: Computer programs for studying nanostructure in crystals. Journal of Physics: Condensed Matter, 19(33), 335219.

    Google Scholar 

  • Fidalgo, F., Gonçalves, D. S., Lavor, C., Liberti, L., & Mucherino, A. (2018). A symmetry-based splitting strategy for discretizable distance geometry problems. Journal of Global Optimization, 71(4), 717–733.

    Google Scholar 

  • Freris, N. M., Graham, S. R., & Kumar, P. R. (2010). Fundamental limits on synchronizing clocks over networks. IEEE Transactions on Automatic Control, 56(6), 1352–1364.

    Google Scholar 

  • Gaffney, K. J., & Chapman, H. N. (2007). Imaging atomic structure and dynamics with ultrafast x-ray scattering. Science, 36(5830), 1444–1448.

    Google Scholar 

  • Glunt, W., Hayden, T. L., & Raydan, M. (1993). Molecular conformation from distance matrices. Journal of Computational Chemistry, 14, 114–120.

    Google Scholar 

  • Glunt, W., Hayden, T. L., & Raydan, M. (1994). Preconditioners for distance matrix algorithms. Journal of Computational Chemistry, 15, 227–232.

    Google Scholar 

  • Gommes, C. J., Jiao, Y., & Torquato, S. (2012). Microstructural degeneracy associated with a two-point correlation function and its information contents. Physical Review E, 85, 051140.

    Google Scholar 

  • Gonçalves, D. S. (2018). A least-squares approach for discretizable distance geometry problems with inexact distances. Optimization Letters. https://doi.org/10.1007/s11590-017-1225-7.

  • Gonçalves, D., & Mucherino, A. (2014). Discretization orders and efficient computation of cartesian coordinates for distance geometry. Optimization Letters, 8, 2111–2125.

    Google Scholar 

  • Gonçalves, D. S., & Mucherino, A. (2016). Optimal partial discretization orders for discretizable distance geometry. International Transactions in Operational Research, 23(5), 947–967.

    Google Scholar 

  • Gonçalves, D. S., Mucherino, A., & Lavor, C. (2014). An adaptive branching scheme for the branch & prune algorithm applied to distance geometry. In IEEE conference proceedings, federated conference on computer science and information systems (FedCSIS14), workshop on computational optimization (WCO14), Warsaw, Poland (pp. 463–469).

  • Gonçalves, D. S., Mucherino, A., Lavor, C., & Liberti, L. (2017). Recent advances on the interval distance geometry problem. Journal of Global Optimization, 69(3), 525–545.

    Google Scholar 

  • Gonçalves, D. S., Nicolas, J., Mucherino, A., & Lavor, C. (2015). Finding optimal discretization orders for molecular distance geometry by answer set programming. In S. Fidanova (Ed.), Recent advances in computational optimization. Studies in computational intelligence (Vol. 610, pp. 1–15). Cham: Springer.

    Google Scholar 

  • Gortler, S., Healy, A., & Thurston, D. (2010). Characterizing generic global rigidity. American Journal of Mathematics, 132(4), 897–939.

    Google Scholar 

  • Gramacho, W., Gonçalves, D., Mucherino, A., & Maculan, N. (2013). A new algorithm to finding discretizable orderings for distance geometry. In Proceedings of distance geometry and applications (DGA13) (pp. 149–152). Manaus, Amazonas, Brazil.

  • Gramacho, W., Mucherino, A., Lavor, C., & Maculan, N. (2012). A parallel bp algorithm for the discretizable distance geometry problem. In In IEEE conference proceedings, workshop on parallel computing and optimization (PCO12), 26th IEEE international parallel & distributed processing symposium (IPDPS12) (pp. 1756–1762). Shanghai, China.

  • Graver, J., Servatius, B., & Servatius, H. (1993). Combinatorial rigidity, graduate studies in mathematics (Vol. 2). American Mathematical Society.

  • Guerry, P., & Herrmann, T. (2011). Advances in automated NMR protein structure determination. Quarterly Reviews of Biophysics, 44(3), 257–309.

    Google Scholar 

  • Gujarathi, S. (2014). Ab initio nanostructure determination. Ph.D. thesis, Michigan State University.

  • Gujarathi, S. R., Farrow, C. L., Glosser, C., Granlund, L., & Duxbury, P. M. (2014). Ab-initio reconstruction of complex Euclidean networks in two dimensions. Physical Review, 89, 053311.

    Google Scholar 

  • Havel, T. F., Kuntz, I. D., & Crippen, G. M. (1983). The theory and practice of distance geometry. Bulletin of Mathematical Biology, 45, 665–720.

    Google Scholar 

  • Hendrickson, B. (1992). Conditions for unique graph realizations. SIAM Journal of Computing, 21, 65–84.

    Google Scholar 

  • Hendrickson, B. (1995). The molecule problem: Exploiting structure in global optimization. SIAM Journal on Optimization, 5(4), 835–857.

    Google Scholar 

  • Jackson, B., & Jordan, T. (2005). Connected rigidity matroids and unique realization graphs. Journal of Combinatorial Theory Series B, 94, 1–29.

    Google Scholar 

  • Jacobs, D. J., & Hendrickson, B. (1997). An algorithm for two-dimensional rigidity percolation: The pebble game. Journal of Computational Physics, 137, 346–365.

    Google Scholar 

  • Jacobs, D. J., & Thorpe, M. F. (1995). Generic rigidity percolation: The pebble game. Physical Review Letteers, 75(22), 4051–4054.

    Google Scholar 

  • Jaganathan, K., & Hassibi, B. (2013). Reconstruction of integers from pairwise distances. In IEEE conference proceedings, international conference on acoustics, speech and signal processing (ICASSP13) (pp. 5974–5978). Vancouver (BC), Canada.

  • Jain, P. C., & Trigunayat, G. C. (1977). Resolution of ambiguities in Zhdanov notation: Actual examples of homometric structures. Acta Crystallographica, A33, 257–260.

    Google Scholar 

  • Juhás, P., Cherba, D. M., Duxbury, P. M., Punch, W. F., & Billinge, S. J. L. (2006). Ab initio determination of solid-state nanostructure. Nature, 440(7084), 655–658.

    Google Scholar 

  • Juhás, P., Granlund, L., Duxbury, P. M., Punch, W. F., & Billinge, S. J. L. (2008). The LIGA algorithm for ab initio determination of nanostructure. Acta Crystallographica. Section A, Foundations of crystallography, 64(Pt 6), 631–640.

    Google Scholar 

  • Juhas, P., Granlund, L., Gujarathi, S. R., Duxbury, P. M., & Billinge, S. J. L. (2010). Crystal structure solution from experimentally determined atomic pair distribution functions. Journal of Applied Crystallography, 43, 623–629.

    Google Scholar 

  • Laman, G. (1970). On graphs and rigidity of plane skeletal structures. Journal of Engineering Mathematics, 4, 331–340.

    Google Scholar 

  • Lavor, C., Alves, R., Figueiredo, W., Petraglia, A., & Maculan, N. (2015). Clifford algebra and the discretizable molecular distance geometry problem. Advances in Applied Clifford Algebras, 25, 925–942.

    Google Scholar 

  • Lavor, C., Lee, J., Lee-St.John, A., Liberti, L., Mucherino, A., & Sviridenko, M. (2012). Discretization orders for distance geometry problems. Optimization Letters, 6(4), 783–796.

    Google Scholar 

  • Lavor, C., Liberti, L., Donald, B., Worley, B., Bardiaux, B., Malliavin, T., & Nilges, M. (2018). Minimal NMR distance information for rigidity of protein graphs. Discrete Applied Mathematics. https://doi.org/10.1016/j.dam.2018.03.071.

  • Lavor, C., Liberti, L., Lodwick, W., & Mendonça da Costa, T. (2017). An introduction to distance geometry applied to molecular geometry. Number 54 pages in springerbriefs in computer science. New York: Springer.

    Google Scholar 

  • Lavor, C., Liberti, L., Maculan, N., & Mucherino, A. (2012a). The discretizable molecular distance geometry problem. Computational Optimization and Applications, 52, 115–146.

    Google Scholar 

  • Lavor, C., Liberti, L., Maculan, N., & Mucherino, A. (2012b). Recent advances on the discretizable molecular distance geometry problem. European Journal of Operational Research, 219, 698–706.

    Google Scholar 

  • Lavor, C., Liberti, L., & Mucherino, A. (2013). The interval BP algorithm for the discretizable molecular distance geometry problem with interval data. Journal of Global Optimization, 56, 855–871.

    Google Scholar 

  • Lavor, C., Mucherino, A., Liberti, L., & Maculan, N. (2011). On the computation of protein backbones by using artificial backbones of hydrogens. Journal of Global Optimization, 50, 329–344.

    Google Scholar 

  • Lavor, C., Xambo-Descamps, S., & Zaplana, I. (2018). A geometric algebra invitation to space-time physics, robotics and molecular geometry. Number 130 pages in springerbriefs in mathematics. New York: Springer.

    Google Scholar 

  • Liberti, L., & Lavor, C. (2016). Six mathematical gems from the history of distance geometry. International Transactions in Operational Research, 23, 897–920.

    Google Scholar 

  • Liberti, L., & Lavor, C. (2017). Euclidean distance geometry (p. 133). Berlin: Springer.

    Google Scholar 

  • Liberti, L., & Lavor, C. (2018). Open research areas in distance geometry. In A. Migdalas & P. Pardalos (Eds.), Open problems in mathematics, optimization and data science. Berlin: Springer.

  • Liberti, L., Lavor, C., Alencar, J., & Resende, G. (2013). Counting the number of solutions of \(^{K}\)dmdgp instances. Lecture Notes in Computer Science, 8085, 224–230.

  • 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.

    Google Scholar 

  • Liberti, L., Lavor, C., Maculan, N., & Mucherino, A. (2014). Euclidean distance geometry and applications. SIAM Review, 56(1), 3–69.

    Google Scholar 

  • Liberti, L., Lavor, C., Mucherino, A., & Maculan, N. (2010). Molecular distance geometry methods: From continuous to discrete. International Transactions in Operational Research, 18(1), 33–51.

    Google Scholar 

  • Liberti, L., Masson, B., Lee, J., Lavor, C., & Mucherino, A. (2011). On the number of solutions of the discretizable molecular distance geometry problem. In Wang, W., Zhu, X., & Du, D-Z. (eds), Proceedings of the 5th annual international conference on combinatorial optimization and applications (COCOA11). Lecture notes in computer science (Vol. 6831, pp. 322–342). Zhangjiajie, China.

  • Liberti, L., Masson, B., Lee, J., Lavor, C., & Mucherino, A. (2014). On the number of realizations of certain Henneberg graphs arising in protein conformation. Discrete Applied Mathematics, 165, 213–232.

    Google Scholar 

  • Maioli, D., Lavor, C., & Gonçalves, D. (2017). A note on computing the intersection of spheres in \(\mathbb{R}^{n}\). ANZIAM Journal, 59, 271–279.

    Google Scholar 

  • Malliavin, T. E., Mucherino, A., & Nilges, M. (2013). Distance geometry in structural biology: New perspectives. In A. Mucherino et al. (Eds.), (Vol. 102, pp. 329–350). Springer.

  • McGreevy, R. L., & Pusztai, L. (1988). Reverse Monte Carlo simulation: A new technique for the determination of disordered structures. Molecular Simulation, 1, 359–367.

    Google Scholar 

  • Moreira, N., Duarte, L., Lavor, C., & Torezzan, C. (2018). A novel low-rank matrix completion approach to estimate missing entries in Euclidean distance matrix. Computational and Applied Mathematics. https://doi.org/10.1007/s40314-018-0613-7.

    Google Scholar 

  • Moukarzel, C. (1996). An efficient algorithm for testing the generic rigidity of graphs in the plane. Journal of Physics A: Mathematical and General, 29, 8079–8098.

    Google Scholar 

  • Moukarzel, C., & Duxbury, P. M. (1995). Stressed backbone and elasticity of random central-force system. Physical Review Letters, 75(22), 4055–4058.

    Google Scholar 

  • Mucherino, A. (2013). On the identification of discretization orders for distance geometry with intervals. Lecture notes in computer science. In Nielsen, F., & Barbaresco, F. (Eds.), Proceedings of geometric science of information (GSI13), Paris, France (Vol. 8085, pp 231–238).

    Google Scholar 

  • Mucherino, A. (2015a). Optimal discretization orders for distance geometry: a theoretical standpoint. In Lecture notes in computer science, proceedings of the 10th international conference on large-scale scientific computations (LSSC15) (pp. 234–242), Sozopol, Bulgaria.

  • Mucherino, A. (2015b). A pseudo de bruijn graph representation for discretization orders for distance geometry. Lecture notes in computer science. Lecture notes in bioinformatics series. In Ortuño, F., & Rojas, I. (Eds.), Proceedings of the 3rd international work-conference on bioinformatics and biomedical engineering (IWBBIO15), Granada, Spain (Vol. 9043, pp. 514–523).

    Google Scholar 

  • Mucherino, A. (2018). On the exact solution of the distance geometry with interval distances in dimension 1. In Fidanova, S. (Ed), Recent advances in computational optimization, studies in computational intelligence (Vol. 717, pp. 123–134).

    Google Scholar 

  • Mucherino, A., de Freitas, R., & Lavor, C. (2015). Distance geometry and applications. Special Issue of Discrete Applied Mathematics, 197, 1–144.

    Google Scholar 

  • Mucherino, A., Lavor, C., & Liberti, L. (2011). 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) (pp. 390–395). Atlanta, GA, USA.

  • Mucherino, A., Lavor, C., & Liberti, L. (2012a). The discretizable distance geometry problem. Optimization Letters, 6, 1671–1686.

    Google Scholar 

  • Mucherino, A., Lavor, C., & Liberti, L. (2012b). Exploiting symmetry properties of the discretizable molecular distance geometry problem. Journal of Bioinformatics and Computational Biology, 10(3), 1242009.

    Google Scholar 

  • Mucherino, A., Lavor, C., Liberti, L., & Maculan, N. (2012). On the discretization of distance geometry problems. In ITHEA conference proceedings, mathematics of distances and applications 2012 (MDA12) (pp. 160–168). Varna, Bulgaria.

  • Mucherino, A., Lavor, C., Liberti, L., & Maculan, N. (Eds.). (2013). Distance geometry: Theory, methods, and applications. New York: Springer.

    Google Scholar 

  • Mucherino, A., Lavor, C., Liberti, L., & Talbi, E. -G. (2010). 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) (pp. 1–6). Hammamet, Tunisia.

  • Mucherino, A., Lavor, C., Malliavin, T., Liberti, L., Nilges, M., & Maculan, N. (2011). Influence of pruning devices on the solution of molecular distance geometry problems. Lecture notes in computer science. In Pardalos, P. M., & Rebennack, S. (Eds.), Proceedings of the 10th international symposium on experimental algorithms (SEA11), Crete, Greece (Vol. 6630, pp. 206–217).

    Google Scholar 

  • Nilges, M., & O’Donoghue, S. I. (1998). Ambiguous NOEs and automated NOE assignment. Progress in Nuclear Magnetic Resonance Spectroscopy, 32(2), 107–139.

    Google Scholar 

  • Patterson, A. L. (1934). A fourier series method for the determination of the components of interatomic distances in crystals. Physical Review, 46(5), 372–376.

    Google Scholar 

  • Patterson, A. L. (1944). Ambiguities in the x-ray analysis of crystal structures. Physical Review, 65, 195–201.

    Google Scholar 

  • Rader, A. J., Hespenheide, B. M., Kuhn, L. A., & Thorpe, M. F. (2002). Protein unfolding: Rigidity lost. PNAS, 99, 3540–3545.

    Google Scholar 

  • Rossmann, M. G., & Arnold, E. (2006). Patterson and molecular replacement techniques. International Tables for Crystallography, B, 235–263.

    Google Scholar 

  • Sallaume, S., Martins, S., Ochi, L., Gramacho, W., Lavor, C., & Liberti, L. (2013). A discrete search algorithm for finding the structure of protein backbones and side chains. International Journal of Bioinformatics Research and Applications, 9, 261–270.

    Google Scholar 

  • Santiago, C., Lavor, C., Monteiro, S., & Kroner-Martins, A. (2018). A new algorithm for the small-field astrometric point-pattern matching problem. Journal of Global Optimization. https://doi.org/10.1007/s10898-018-0653-y.

    Google Scholar 

  • Saxe, J. (1979). Embeddability of weighted graphs in k-space is strongly NP-hard. Conference in Communications Control and Computing (pp. 480–489).

  • Schneider, M. N., Seibald, M., Lagally, P., & Oeckler, O. (2010). Ambiguities in the structure determination of antimony tellurides arising from almost homometric structure models and stacking disorder. Journal of Applied Crystallography, 43, 1011–1020.

    Google Scholar 

  • Senechal, M. (2008). A point set puzzle revisited. European Journal of Combinatorics, 29, 1933–1944.

    Google Scholar 

  • Sippl, M. J., & Scheraga, H. A. (1986). Cayley-menger coordinates. Proceedings of the National Academy of Sciences of the United States (PNAS), 83, 2283–2287.

    Google Scholar 

  • Sivia, D. S. (2011). Elementary scattering theory. Oxford: Oxford University Press.

    Google Scholar 

  • Skiena, S., Smith, W., & Lemke, P. (1990). Reconstructing sets from interpoint distances. In Sixth ACM symposium on computational geometry (pp. 332–339).

  • Souza, M., Lavor, C., Muritiba, A., & Maculan, N. (2013). Solving the molecular distance geometry problem with inaccurate distance data. BMC Bioinformatics, 14, S71–S76.

    Google Scholar 

  • Tay, T. S. (1984). Rigidity of multi-graphs I: Linking rigid bodies in n-space. Journal of Combinatorial Theory Series B, 36, 95–112.

    Google Scholar 

  • Thompson, H. (1967). Calculation of cartesian coordinates and their derivatives from internal molecular coordinates. Journal of Chemical Physics, 47, 3407–3410.

    Google Scholar 

  • Thorpe, M. F., & Duxbury, P. M. (Eds.). (1999). Rigidity theory and applications. New York: Springer.

    Google Scholar 

  • Tucker, M. G., Keen, D. A., Dove, M. T., Goodwin, A. L., & Huie, Q. (2007). RMCProfile: Reverse Monte Carlo for polycrystalline materialss. Journal of Physics: Condensed Matter, 19, 335218.

    Google Scholar 

  • Voller, Z., & Wu, Z. (2013). Distance geometry methods for protein structure determination. In A. Mucherino et al. (Eds.) (Vol. 102, pp. 139–159).

  • Wang, Z., Zheng, S., Ye, Y., & Boyd, S. (2008). Further relaxations of the semidefinite programming approach to sensor network localization. SIAM Journal on Optimization, 19(2), 655–673.

    Google Scholar 

  • Worley, B., Delhommel, F., Cordier, F., Malliavin, T., Bardiaux, B., Wolff, N., Nilges, M., Lavor, C., & Liberti, L. (2018). Tuning interval branch-and-prune for protein structure determination. Journal of Global Optimization. https://doi.org/10.1007/s10898-018-0635-0.

    Google Scholar 

  • Wu, D., & Wu, Z. (2007). An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse data. Journal of Global Optimization, 37, 661–672.

    Google Scholar 

  • Wu, Y.-C., Chaudhari, Q., & Serpedin, E. (2011). Clock synchronization of wireless sensor networks. IEEE Signal Processing Magazine, 28(1), 124–138.

    Google Scholar 

  • Wüthrich, K. (1986). NMR of proteins and nucleic acids (p. 320). New York: Wiley.

    Google Scholar 

  • Wuthrich, K. (1989). The development of nuclear magnetic resonance spectroscopy as a technique for protein structure determination. Accounts of Chemical Research, 22(1), 36–44.

    Google Scholar 

  • Zhang, H., & Hager, W. W. (2004). A nonmonotone line search technique and its applications to unconstrained optimization. SIAM Journal of Optimization, 14(4), 1043–1056.

    Google Scholar 

Download references

Acknowledgements

The authors are thankful to the editors for their invitation to submit an updated version of our survey that was previously published in 2016 in the Quarterly Journal of Operations Research. We wish to thank FAPESP and CNPq for financial support. Support for work at Michigan State University by the MSU foundation is gratefully acknowledged. Collaborations with Pavol Juhas, Luke Granlund, Saurabh Gujarathi, Chris Farrow and Connor Glosser are much appreciated. PMD, CL and AM would like to thank Leo Liberti for interesting and motivating discussions. Work in the Billinge group was supported by the U.S. National Science Foundation through grant DMREF-1534910.

Author information

Authors and Affiliations

  1. Applied Physics and Applied Mathematics, Columbia University, New York, NY, 10027, USA

    Simon J. L. Billinge

  2. X-Ray Scattering Group, Brookhaven National Laboratory, Upton, NY, 11973, USA

    Simon J. L. Billinge

  3. Department of Physics and Astronomy, Michigan State University, East Lansing, MI, 48824, USA

    Phillip M. Duxbury

  4. Centro de Ciências Físicas e Matemáticas, Universidade Federal de Santa Catarina, Florianópolis, Brazil

    Douglas S. Gonçalves

  5. Department of Applied Mathematics (IMECC-UNICAMP), University of Campinas, Campinas, SP, 13081-970, Brazil

    Carlile Lavor

  6. Institut de Recherche en Informatique et Systèmes Aléatoires, Université de Rennes 1, 35042, Rennes, France

    Antonio Mucherino

Authors
  1. Simon J. L. Billinge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Phillip M. Duxbury
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Douglas S. Gonçalves
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Carlile Lavor
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Antonio Mucherino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Douglas S. Gonçalves.

Additional information

This is an updated version of the paper “Assigned and unassigned distance geometry: applications to biological molecules and nanostructures” that appeared in 4OR—Q J Oper Res (2016) 14: 337–376.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Billinge, S.J.L., Duxbury, P.M., Gonçalves, D.S. et al. Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures. Ann Oper Res 271, 161–203 (2018). https://doi.org/10.1007/s10479-018-2989-6

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-018-2989-6

Keywords

Search

Navigation