Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
In some of our past papers, e.g., [76, 79, 83, 100], we defined DDGP, DMDGP , and \(^{\textsf {K}}\)DMDGP with one further condition, i.e. d satisfies strict simplex inequalities. This is equivalent to the condition on the rank of A in Sect. 3.3.6; its purpose is to eliminate those edge weight functions that prevent the application of the methods given in Ch. 3.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2017 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Liberti, L., Lavor, C. (2017). Molecular distance geometry problems. In: Euclidean Distance Geometry. Springer Undergraduate Texts in Mathematics and Technology. Springer, Cham. https://doi.org/10.1007/978-3-319-60792-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-60792-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-60791-7
Online ISBN: 978-3-319-60792-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)