Skip to main content
SpringerLink
Log in

The Discretizable Distance Geometry Problem (DDGP3)

  • Chapter
  • First Online:
Book cover An Introduction to Distance Geometry applied to Molecular Geometry

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 859 Accesses

Abstract

We begin this chapter by describing an important class of the DGP in \(\mathbb{R}^{3}\) having a vertex order as described in Sect. 3.3, called the Discretizable DGP3 (DDGP3). Even though this definition can be extended to \(\mathbb{R}^{K}\) [65], we will consider just the case K = 3.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alves, R., Lavor, C.: Geometric algebra to model uncertainties in the discretizable molecular distance geometry problem. Adv. Appl. Clifford Algebr. doi:10.1007/s00006-016-0653-2

    Google Scholar 

  2. Andrioni, A., Lavor, C., Liberti, L., Mucherino, A., Maculan, N., Rodriguez, R. (eds.): Proceedings of the Workshop on Distance Geometry and Applications. Universidade Federal do Amazonas, Manaus (2013)

    Google Scholar 

  3. Cassioli, A., Gunluk, O., Lavor, C., Liberti, L.: Discretization vertex orders in distance geometry. Discret. Appl. Math. 197, 27–41 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  4. Fidalgo, F., Rodriguez, J.: Quaternions as a tool for merging multiple realization trees. In: Andrioni, A., Lavor, C., Liberti, L., Mucherino, A., Maculan, N., Rodriguez, R. (eds.) Proceedings of the Workshop on Distance Geometry and Applications, pp. 119–124. Universidade Federal do Amazonas, Manaus (2013)

    Google Scholar 

  5. Gramacho, W., Gonçalves, D., Mucherino, A., Maculan, N.: A new algorithm to finding discretizable orderings for distance geometry. In: Andrioni, A., Lavor, C., Liberti, L., Mucherino, A., Maculan, N. Rodriguez, R. (eds.) Proceedings of the Workshop on Distance Geometry and Applications. Universidade Federal do Amazonas, Manaus, pp. 149–152 (2013)

    Google Scholar 

  6. Lavor, C., Liberti, L., Maculan, N.: A note on “A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem”. Int. Trans. Oper. Res. 18, 751–752 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  7. Lavor, C., Alves, R., Figueiredo, W., Petraglia, A., Maculan, N.: Clifford algebra and the discretizable molecular distance geometry problem. Adv. Appl. Clifford Algebr. 25, 925–942 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  8. 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)

    Article  MathSciNet  MATH  Google Scholar 

  9. Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem. Optim. Lett. 6, 1671–1686 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  10. Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.): Distance Geometry: Theory, Methods, and Applications. Springer, New York (2013)

    MATH  Google Scholar 

  11. Nucci, P., Nogueira, L., Lavor, C.: Solving the discretizable molecular distance geometry problem by multiple realization trees. In: Mucherino, A., Lavor, C., Liberti, L., Maculan, N. (eds.) Distance Geometry: Theory, Methods, and Applications, pp. 161–176. Springer, New York (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Campinas, Campinas, São Paulo, Brazil

    Carlile Lavor

  2. CNRS and École Polytechnique, Palaiseau, France

    Leo Liberti

  3. University of Colorado Denver, Denver, CO, USA

    Weldon A. Lodwick & Tiago Mendonça da Costa

Authors
  1. Carlile Lavor
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Leo Liberti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Weldon A. Lodwick
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Tiago Mendonça da Costa
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2017 The Author(s)

About this chapter

Cite this chapter

Lavor, C., Liberti, L., Lodwick, W.A., Mendonça da Costa, T. (2017). The Discretizable Distance Geometry Problem (DDGP3). In: An Introduction to Distance Geometry applied to Molecular Geometry. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-57183-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-57183-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-57182-9

  • Online ISBN: 978-3-319-57183-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation