The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances
Year of publication: |
2013
|
---|---|
Authors: | Lavor, Carlile ; Liberti, Leo ; Mucherino, Antonio |
Published in: |
Journal of Global Optimization. - Springer. - Vol. 56.2013, 3, p. 855-871
|
Publisher: |
Springer |
Subject: | Distance geometry | Protein conformations | NMR data | Combinatorial optimization | Interval Branch and Prune |
-
Discretization orders for protein side chains
Costa, Virginia, (2014)
-
The dynamics of inter-residue distances in bovine pancreatic trypsin inhibitor
Karain, Wael I., (2007)
-
A convex hull algorithm for solving a location problem
Nguyen Kieu Linh, (2015)
- More ...
-
Molecular distance geometry methods : from continuous to discrete
Liberti, Leo, (2011)
-
Recent advances on the discretizable Molecular Distance Geometry Problem
Lavor, Carlile, (2012)
-
The discretizable molecular distance geometry problem
Lavor, Carlile, (2012)
- More ...