✦ LIBER ✦

TheintervalBranch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances

✍ Scribed by Carlile Lavor, Leo Liberti, Antonio Mucherino

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Branch-and-Prune algorithm for the Mol

✍ Leo Liberti; Carlile Lavor; Nelson Maculan 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 234 KB

A note on “A branch-and-prune algorithm

✍ Carlile Lavor; Leo Liberti; Nelson Maculan 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB

A linear-time algorithm for solving the

✍ Qunfeng Dong; Zhijun Wu 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 270 KB

A Geometric Build-Up Algorithm for Solvi

✍ Qunfeng Dong; Zhijun Wu 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 234 KB

An updated geometric build-up algorithm

✍ Di Wu; Zhijun Wu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 240 KB

Extending the geometric build-up algorit

✍ Ricardo dos Santos Carvalho; Carlile Lavor; Fábio Protti 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 127 KB