On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem

DOI10.1007/978-3-642-22616-8_26zbMath1342.90168arXiv1010.1834OpenAlexW2158004617WikidataQ62562187 ScholiaQ62562187MaRDI QIDQ5199160

Leo Liberti, Antonio Mucherino, Benoît Masson, Jon Lee, Carlile C. Lavor

Publication date: 12 August 2011

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1010.1834

zbMATH Keywords

symmetrydistance geometrybranch-and-prunepower of two

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (8)

Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem ⋮ Recent advances on the discretizable molecular distance geometry problem ⋮ On a Relationship Between Graph Realizability and Distance Matrix Completion ⋮ On the number of realizations of certain Henneberg graphs arising in protein conformation ⋮ Recent results on assigned and unassigned distance geometry with applications to protein molecules and nanostructures ⋮ Discretization orders for distance geometry problems ⋮ The discretizable molecular distance geometry problem ⋮ A new algorithm for the \(^K\)DMDGP subclass of distance geometry problems with exact distances

This page was built for publication: On the Number of Solutions of the Discretizable Molecular Distance Geometry Problem