The interval Branch-and-Prune algorithm for the discretizable molecular distance geometry problem with inexact distances

Journal of Global Optimization

Volumn 56, Issue 3, 2013, Pages 855-871

  Lavor, Carlile ^a   Liberti, Leo ^b   Mucherino, Antonio ^c  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b ÉCOLE POLYTECHNIQUE   (France)

^c UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Combinatorial optimization; Distance geometry; Interval Branch and Prune; NMR data; Protein conformations

Indexed keywords

BRANCH AND PRUNES; BRANCH-AND-PRUNE ALGORITHMS; COMPUTATIONAL EXPERIMENT; DISTANCE GEOMETRY; EUCLIDEAN DISTANCE; MOLECULAR DISTANCE GEOMETRY PROBLEM; NMR DATA; PROTEIN CONFORMATION;

ALGORITHMS; COMBINATORIAL OPTIMIZATION; GEOMETRY; PROTEINS;

PROBLEM SOLVING;

EID: 84879688166     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-011-9799-6     Document Type: Conference Paper

References (29)

1. Berman H.M.; Westbrook J.; Feng Z.; Gilliland G.; Bhat T.N.; Weissig H.; Shindyalov I.N.; Bourne P.E.: The protein data bank. Nucleic Acid Res. 28, 235-242 (2000)
2. Carvalho R.S.; Lavor C.; Protti F.: Extending the geometric build-up algorithm for the molecular distance geometry problem. Inf. Process. Lett. 108, 234-237 (2008)
3. 3n}. Australian N. Z. Ind. Appl. Math. J. 42, C461-C477 (2000)
4. Eren, T.; Goldenberg, D.K.; Whiteley, W.; Yang, Y.R.; Morse, A.S.; Anderson, B.D.O.; Belhumeur, P.N.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, pp. 2673-2684 (2004)
5. Henneberg L.: Die graphische Statik der starren Systeme. B.G. Teubner, Leipzig (1911)
6. Kirkpatrick S.; Jr. Gelatt C.D.; Vecchi M.P.: Optimization by simulated annealing. Science 220, 671-680 (1983)
7. Krislock, N.: Semidefinite facial reduction for low-rank Euclidean distance matrix completion. Ph.D. thesis, University of Waterloo (2010)
8. Lavor, C.; Lee, J.; Lee-St. John, A.; Liberti, L.; Mucherino, A.; Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. (to appear)
9. Lavor, C.; Liberti, L.; Maculan, N.: The discretizable molecular distance geometry problem. Technical report q-bio/0608012, arXiv (2006)
10. Lavor C.; Liberti L.; Maculan N.: Molecular distance geometry problem. In: Floudas, C.; Pardalos, P. (eds) Encyclopedia of Optimization. 2nd edn, pp. 2305-2311. Springer, New York (2009)
11. Lavor, C.; Liberti, L.; Maculan, N.; Mucherino, A.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. (2011, to appear)
12. Lavor, C.; Liberti, L.; Mucherino, A.: On the solution of molecular distance geometry problems with interval data. In: International Conference on Bioinformatics and Biomedicine, IEEE Conference Proceedings, Hong Kong (2010)
13. Lavor C.; Mucherino A.; Liberti L.; Maculan N.: Discrete approaches for solving molecular distance geometry problems using nmr data. Int. J. Comput. Biosci. 1, 88-94 (2011)
14. Lavor C.; Mucherino A.; Liberti L.; Maculan N.: On the computation of protein backbones by using artificial backbones of hydrogens. J. Glob. Optim. 50, 329-344 (2011)
15. Lee-St. John, A.: Geometric constraint systems with applications in CAD and biology. Ph.D. thesis, University of Massachusetts at Amherst (2008)
16. Liberti L.; Lavor C.; Maculan N.: A branch-and-prune algorithm for the molecular distance geometry problem. Int. Trans. Oper. Res. 15, 1-17 (2008)
17. Liberti L.; Lavor C.; Mucherino A.; Maculan N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18, 33-51 (2011)
18. Liu, X.; Pardalos, P.M.: A tabu based pattern search method for the distance geometry problem. In: Giannessi, F. et al. (eds.) New Trends in Mathematical Programming, pp. 223-234. Kluwer Academic Publishers, The Netherlands (1998)
19. Mucherino, A.; Lavor, C.: The branch and prune algorithm for the molecular distance geometry problem with inexact distances. In: Proceedings of the International Conference on Computational Biology, vol. 58. World Academy of Science, Engineering and Technology, 349-353 (2009)
20. Mucherino, A.; Lavor, C.; Liberti, L.: The discretizable distance geometry problem. Optim. Lett. (to appear)
21. Mucherino A.; Lavor C.; Liberti L.; Maculan N.: On the definition of artificial backbones for the discretizable molecular distance geometry problem. Mathematica Balkanica 23, 289-302 (2009)
22. Mucherino, A.; Liberti, L.; Lavor, C.; Maculan, N.: Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. In: Rothlauf, F. (ed.) Proceedings of the Genetic and Evolutionary Computation Conference, pp. 333-340. Montreal, ACM (2009)
23. Nilges M.; Gronenborn A.M.; Brunger A.T.; Clore G.M.: Determination of three-dimensional structures of proteins by simulated annealing with interproton distance restraints. application to crambin, potato carboxypeptidase inhibitor and barley serine proteinase inhibitor 2. Protein Eng. 2, 27-38 (1988)
24. Nilges M.; Macias M.J.; O'Donoghue S.I.; Oschkinat H.: Automated noesy interpretation with ambiguous distance restraints: The refined nmr solution structure of the pleckstrin homology domain from β-spectrin. J. Mol. Biol. 269, 408-422 (1997)
25. Pardalos, P.M.; Shalloway, D.; Xu, G. (eds.): Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding. DIMACS. AMS (1996)
26. Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: Proceedings of 17th Allerton Conference in Communications, Control and Computing, pp. 480-489 (1979)
27. Schlick T.: Molecular modelling and simulation: an interdisciplinary guide. Springer, New York (2002)
28. So M.-C.; Ye Y.: Theory of semidefinite programming for sensor network localization. Math. Programm. 109, 367-384 (2007)
29. Wu D.; Wu Z.; Yuan Y.: Rigid versus unique determination of protein structures with geometric buildup. Optim. Lett. 2, 319-331 (2008)