Recent advances on the Discretizable Molecular Distance Geometry Problem

European Journal of Operational Research

Volumn 219, Issue 3, 2012, Pages 698-706

  Lavor, Carlile ^a   Liberti, Leo ^b   MacUlan, Nelson ^c   Mucherino, Antonio ^d  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b ÉCOLE POLYTECHNIQUE   (France)

^c FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

^d UNIVERSITÉ DE RENNES 1   (France)

Author keywords

Bioinformatics; Branch and prune; Graph theory; Protein conformation

Indexed keywords

ADJACENT VERTICES; BRANCH-AND-PRUNE; CONTINUOUS SPACES; EDGE WEIGHTS; EUCLIDEAN DISTANCE; MOLECULAR DISTANCE GEOMETRY PROBLEM; NMR DATA; PROTEIN CONFORMATION; PROTEIN STRUCTURES; PROTEOMICS; UNDIRECTED GRAPH;

BIOINFORMATICS; GRAPH THEORY; MOLECULAR BIOLOGY;

PROTEINS;

EID: 84857919606     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2011.11.007     Document Type: Article

References (42)

1. H.M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T.N. Bhat, H. Weissig, I.N. Shindyalov, and P.E. Bourne The protein data bank Nucleic Acid Research 28 2000 235 242 (Pubitemid 30047768)
2. L. Blumenthal Theory and Applications of Distance Geometry 1953 Oxford University Press Oxford
3. R.S. Carvalho, C. Lavor, and F. Protti Extending the geometric build-up algorithm for the molecular distance geometry problem Information Processing Letters 108 2008 234 237
4. Rn Australian and New Zealand Industrial and Applied Mathematics Journal 42 2000 C461 C477
5. R. Davis, C. Ernst, and D. Wu Protein structure determination via an efficient geometric build-up algorithm BMC Structural Biology 10 Suppl 1 2010 S7
6. Q. Dong, and Z. Wu A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances Journal of Global Optimization 22 2002 365 375
7. Q. Dong, and Z. Wu A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data Journal of Global Optimization 26 2003 321 333
8. T. Eren, D.K. Goldenberg, W. Whiteley, Y.R. Yang, A.S. Morse, B.D.O. Anderson, and P.N. Belhumeur Rigidity, computation, and randomization in network localization IEEE Infocom Proceedings 2004 2673 2684
9. M.R. Garey, and D.S. Johnson Computers and Intractability: A Guide to the Theory of NP-Completeness 1979 Freeman and Company New York
10. H. Gunther NMR Spectroscopy: Basic Principles, Concepts, and Applications in Chemistry 1995 Wiley New York
11. C. Jermann, G. Trombettoni, B. Neveu, and P. Mathis Decomposition of geometric constraint systems: A survey International Journal of Computational Geometry and Applications 16 2006 379 414 (Pubitemid 44701796)
12. Y. Jiao, F.H. Stillinger, S. Torquato, Geometrical ambiguity of pair statistics I. point configurations, Technical Report, , 2009.
13. C. Lavor, J. Lee, A. Lee-St. John, L. Liberti, A. Mucherino, M. Sviridenko, Discretization orders for distance geometry problems, Optimization Letters, doi:10.1007/s11590-011-0302-6.
14. C. Lavor, L. Liberti, and N. Maculan Computational experience with the molecular distance geometry problem J. Pintér, Global Optimization: Scientific and Engineering Case Studies 2006 Springer Berlin 213 225
15. C. Lavor, L. Liberti, N. Maculan, The discretizable molecular distance geometry problem, Technical Report, , 2006.
16. C. Lavor, L. Liberti, and N. Maculan Molecular distance geometry problem C. Floudas, P. Pardalos, Encyclopedia of Optimization second ed. 2009 Springer New York 2305 2311
17. C. Lavor, L. Liberti, N. Maculan, A. Mucherino, The discretizable molecular distance geometry problem, Computational Optimization and Applications, doi:10.1007/s10589-011-9402-6.
18. C. Lavor, L. Liberti, A. Mucherino, The iBP algorithm for the discretizable molecular distance geometry problem with interval data, Journal of Global Optimization. doi:10.1007/s10898-011-9799-6.
19. C. Lavor, L. Liberti, A. Mucherino, and N. Maculan On a discretizable subclass of instances of the molecular distance geometry problem D. Shin, Proceedings of the 24th Annual ACM Symposium on Applied Computing 2009 ACM 804 805
20. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan An artificial backbone of hydrogens for finding the conformation of protein molecules Proceedings of the Computational Structural Bioinformatics Workshop 2009 IEEE Washington DC, USA 152 155
21. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan Computing artificial backbones of hydrogen atoms in order to discover protein backbones Proceedings of the International Multiconference on Computer Science and Information Technology 2009 IEEE Mragowo, Poland 751 756
22. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan On the computation of protein backbones by using artificial backbones of hydrogens Journal of Global Optimization 50 2011 329 344
23. L. Liberti, C. Lavor, and N. Maculan A branch-and-prune algorithm for the molecular distance geometry problem International Transactions in Operational Research 15 2008 1 17
24. L. Liberti, C. Lavor, N. Maculan, and F. Marinelli Double variable neighbourhood search with smoothing for the molecular distance geometry problem Journal of Global Optimization 43 2009 207 218
25. L. Liberti, C. Lavor, A. Mucherino, and N. Maculan Molecular distance geometry methods: From continuous to discrete International Transactions in Operational Research 18 2010 33 51
26. L. Liberti, B. Masson, J. Lee, C. Lavor, A. Mucherino, On the number of solutions of the discretizable molecular distance geometry problem, in: W. Wang, X. Zhu, D-Z. Du (Eds.), LNCS, vol. 6831, Springer, New York, 2011, pp. 322-342.
27. L. Liberti, B. Masson, C. Lavor, A. Mucherino. Branch-and-prune trees with bounded width, in: G. Nicosia, A. Pacifici (Eds.), Proceedings of Cologne-Twente Workshop, Rome, 2011.
28. J.J. Moré, and Z. Wu Global continuation for distance geometry problems SIAM Journal of Optimization 7 1997 814 846
29. A. Mucherino, and C. Lavor The branch and prune algorithm for the molecular distance geometry problem with inexact distances Proceedings of the International Conference on Computational Biology vol. 58 2009 World Academy of Science, Engineering and Technology 349 353
30. A. Mucherino, C. Lavor, L. Liberti, The discretizable distance geometry problem. Optimization Letters. doi:10.1007/s11590-011-0358-3.
31. A. Mucherino, C. Lavor, L. Liberti, and N. Maculan On the definition of artificial backbones for the discretizable molecular distance geometry problem Mathematica Balkanica 23 2009 289 302
32. A. Mucherino, C. Lavor, L. Liberti, N. Maculan, Strategies for solving distance geometry problems with inexact distances by discrete approaches, in: S. Cafieri, E. Hendrix, L. Liberti, F. Messine (Eds.), Proceedings of the Toulouse Global Optimization Workshop, Toulouse, 2010, pp. 93-96.
33. A. Mucherino, C. Lavor, L. Liberti, E-G. Talbi, On suitable parallel implementations of the branch & prune algorithm for distance geometry, in: Proceedings of the Grid5000 Spring School, Lille, France, 2010.
34. A. Mucherino, C. Lavor, L. Liberti, E-G. Talbi. A parallel version of the branch & prune algorithm for the molecular distance geometry problem, in: IEEE Conference Proceedings, ACS/IEEE International Conference on Computer Systems and Applications (AICCSA10), Hammamet, Tunisia, 2010.
35. A. Mucherino, L. Liberti, and C. Lavor MD-jeep: An implementation of a branch-and-prune algorithm for distance geometry problems K. Fukuda, J. van der Hoeven, M. Joswig, N. Takayama, Mathematical Software LNCS vol. 6327 2010 Springer New York 186 197
36. B. Roth Rigid and flexible frameworks American Mathematical Monthly 88 1981 6 21
37. R. Santana, P. Larrañaga, J.A. Lozano, Combining variable neighbourhood search and estimation of distribution algorithms in the protein side chain placement problem, in: Proc. of Mini Euro Conference on Variable Neighbourhood Search, Tenerife, Spain, 2005.
38. J.B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, in: Proceedings of 17th Allerton Conference in Communications, Control and Computing, 1979, pp. 480-489.
39. T. Schlick Molecular Modelling and Simulation: An Interdisciplinary Guide 2002 Springer New York
40. A. Sit, Z. Wu, and Y. Yuan A geometric build-up algorithm for the solution of the distance geometry problem using least-squares approximation Bulletin of Mathematical Biology 71 2009 1914 1933
41. D. Wu, and Z. Wu An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data Journal of Global Optimization 37 2007 661 673 (Pubitemid 46327449)
42. D. Wu, Z. Wu, and Y. Yuan Rigid versus unique determination of protein structures with geometric buildup Optimization Letters 2 2008 319 331 (Pubitemid 351653784)