Molecular distance geometry problems

  • Leo LibertiEmail author
  • Carlile Lavor
Part of the Springer Undergraduate Texts in Mathematics and Technology book series (SUMAT)


The Molecular Distance Geometry Problem (MDGP) [86] is the subclass of DGP instances with K=3. Since the DGP is NP-hard for each K [107], the MDGP is also NP-hard.

Copyright information

© Springer International Publishing Switzerland 2017

Authors and Affiliations

  1. 1.CNRS LIXÉcole PolytechniquePalaiseauFrance
  2. 2.Department of Applied Mathematics, IMECC-UNICAMPUniversity of CampinasCampinasBrazil

Personalised recommendations