Solving the discretizable molecular distance geometry problem by multiple realization trees

DOI10.1007/978-1-4614-5128-0_9MaRDI QIDQ2841705zbMATH OpenOpenAlexFDO

Authors Pedro Nucci, Loana T. Nogueira, Carlile Lavor

Publication date 29 July 2013

Published in Distance Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-1-4614-5128-0_9

zbMATH Keywords

branch-and-prunedistance geometryrealization tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Applications of graph theory (05C90) Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20)

Recommendations

• The discretizable molecular distance geometry problem
• A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
• The discretizable distance geometry problem
• On the number of solutions of the discretizable molecular distance geometry problem
• Recent advances on the discretizable molecular distance geometry problem

Cited in

(5)

• A symmetry-based splitting strategy for discretizable distance geometry problems
• A new algorithm for the \(^K\mathrm{DMDGP}\) subclass of distance geometry problems with exact distances
• On the optimality of finding DMDGP symmetries
• Improving the sampling process in the interval branch-and-prune algorithm for the discretizable molecular distance geometry problem
• On the number of solutions of the discretizable molecular distance geometry problem

This page was built for publication: Solving the discretizable molecular distance geometry problem by multiple realization trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2841705)