On the computation of protein backbones by using artificial backbones of hydrogens

Journal of Global Optimization

Volumn 50, Issue 2, 2011, Pages 329-344

  Lavor, C ^a   Mucherino, A ^b   Liberti, L ^c   MacUlan, N ^d  

^a UNIVERSITY OF CAMPINAS   (Brazil)

^b INRIA   (France)

^c ÉCOLE POLYTECHNIQUE   (France)

^d FEDERAL UNIVERSITY OF RIO DE JANEIRO   (Brazil)

Author keywords

Branch and Prune; Combinatorial optimization; Distance geometry; Hydrogen atoms; Protein molecules

Indexed keywords

ATOMS; COMBINATORIAL OPTIMIZATION; CONFORMATIONS; MOLECULES; NUCLEAR MAGNETIC RESONANCE SPECTROSCOPY; PROTEINS;

BRANCH AND PRUNES; COMBINATORIAL PROBLEM; DISTANCE GEOMETRY; HYDROGEN ATOMS; MOLECULAR DISTANCE GEOMETRY PROBLEM; PROTEIN BACKBONE; PROTEIN CONFORMATION; PROTEIN MOLECULES;

PROBLEM SOLVING;

EID: 79955868839     PISSN: 09255001     EISSN: 15732916     Source Type: Journal    
DOI: 10.1007/s10898-010-9584-y     Document Type: Article

References (33)

1. L.T.H. An P.D. Tao 2003 Large-scale molecular optimization from distance matrices by a D.C. optimization approach SIAM J. Optim. 14 77 114 10.1137/S1052623498342794
2. Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users' Guide, 3rd Edn., SIAM (1999)
3. P. Biswas K.-C. Toh Y. Ye 2008 A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation SIAM J. Sci. Comput. 30 1251 1277 10.1137/05062754X
4. R.S. Carvalho C. Lavor F. Protti 2008 Extending the geometric buildup algorithm for the molecular distance geometry problem Inf. Process. Lett. 108 234 237 10.1016/j.ipl.2008.05.009
5. Crippen G.M., Havel T.F.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)
6. Q. Dong Z. Wu 2002 A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances J. Glob. Optim. 22 365 375 10.1023/A:1013857218127
7. R.A. Engh R. Huber 1991 Accurate bond and angle parameters for x-ray protein structure refinement Acta Crystallogr. A47 392 400
8. A. Grosso M. Locatelli F. Schoen 2009 Solving molecular distance geometry problems by global optimization algorithms Comput. Optim. Appl. 43 23 27 10.1007/s10589-007-9127-8
9. Havel T.F.: Distance geometry. In: Grant, D.M., Harris, R.K. (eds) Encyclopedia of Nuclear Magnetic Resonance, pp. 1701-1710. Wiley, New York (1995)
10. S. Kirkpatrick C.D. Gelatt Jr M.P. Vecchi 1983 Optimization by simulated annealing Science 220 4598 671 680 10.1126/science.220.4598.671
11. Lavor, C.: On generating instances for the molecular distance geometry problem. In: Liberti, L., Maculan, N. (eds.) Global Optimization From Theory to Implementation. Series: Nonconvex Optimization and Its Applications vol. 84, pp. 405-414. Springer (2006)
12. Lavor, C., Liberti, L., Maculan, N.: Discretizable molecular distance geometry problem. Tech. Rep. q-bio.BM/0608012, arXiv (2006)
13. Lavor C., Liberti L., Maculan N.: Molecular distance geometry problem. In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization, pp. 2305-2311. Springer, New York (2009)
14. Lavor, C., Liberti, L., Mucherino, A., Maculan, N.: On a discretizable subclass of instances of the molecular distance geometry problem. In: ACM Conference Proceedings, 24th Annual ACM Symposium on Applied Computing (SAC09), Hawaii USA, pp. 804-805 (2009)
15. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Computing artificial backbones of hydrogen atoms in order to discover protein backbones. In: IEEE Conference Proceedings, International Conference IMCSIT09, Workshop on Combinatorial Optimization (WCO09), Poland, pp. 751-756 (2009)
16. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: An artificial backbone of hydrogens for finding the conformation of protein molecules. In: IEEE Conference Proceedings, Computational Structural Bioinformatics Workshop (CSBW09), Washington D.C., USA, pp. 152-155, (2009)
17. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Discrete approaches for solving molecular distance geometry problems using NMR data. Int. J. Comput. Biosci. (2010) (to appear)
18. L. Liberti C. Lavor N. Maculan 2008 A Branch-and-Prune algorithm for the molecular distance geometry problem Int. Trans. Oper. Res. 15 1 1 17 10.1111/j.1475-3995.2007.00622.x
19. L. Liberti C. Lavor N. Maculan F. Marinelli 2009 Double variable neighbourhood search with smoothing for the molecular distance geometry problem J. Glob. Optim. 43 207 218 10.1007/s10898-007-9218-1
20. Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. (2010) (to appear)
21. J.J. Moré Z. Wu 1997 Global continuation for distance geometry problems SIAM J. Optim. 7 814 836 10.1137/S1052623495283024 (Pubitemid 127108820)
22. J.J. Moré Z. Wu 1999 Distance geometry optimization for protein structures J. Glob. Optim. 15 219 234 10.1023/A:1008380219900 (Pubitemid 129620084)
23. Mucherino, A., Lavor, C.: The Branch and Prune algorithm for the molecular distance geometry problem with inexact distances, World Academy of Science, Engineering and Technology (WASET). In: Proceedings of the "International Conference on Bioinformatics and Biomedicine" (ICBB09), Venice, Italy (2009)
24. Mucherino, A., Lavor, C., Maculan, N.: The molecular distance geometry problem applied to protein conformations. In: Cafieri, S., Mucherino, A., Nannicini, G., Tarissan, F., Liberti, L. (eds.) Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW09), pp. 337-340, Paris (2009)
25. A. Mucherino C. Lavor L. Liberti N. Maculan 2009 On the definition of artificial backbones for the discretizable molecular distance geometry problem Math. Balkanica 23 3-4 289 302
26. Mucherino, A., Liberti, L., Lavor, C., Maculan, N.: Comparisons between an exact and a MetaHeuristic algorithm for the molecular distance geometry problem. In: ACM Conference Proceedings, Genetic and Evolutionary Computation Conference (GECCO09), Montréal, Canada, pp. 333-340 (2009)
27. Mucherino, A., Liberti, L., Lavor, C.: An implementation of a Branch & Prune algorithm for distance geometry problems, LNCS series. In: Proceedings of the Third International Congress on Mathematical Software (ICMS10), Kobe, Japan (2010)
28. 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, Monticello, IL, pp. 480-489 (1979)
29. Schlick T.: Molecular Modelling and Simulation: An Interdisciplinary Guide. Springer, New York (2002)
30. C.D. Schwieters J.J. Kuszewski G.M. Clore 2006 Using Xplor-NIH for NMR molecular structure determination Prog. Nucl. Magn. Reson. Spectrosc. 48 47 62 10.1016/j.pnmrs.2005.10.001
31. D. Wu Z. Wu 2007 An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data J. Glob. Optim. 37 661 673 10.1007/s10898-006-9080-6 (Pubitemid 46327449)
32. D. Wu Z. Wu Y. Yuan 2008 Rigid versus unique determination of protein structures with geometric buildup Optim. Lett. 2 319 331 10.1007/s11590-007- 0060-7 (Pubitemid 351653784)
33. H. Xu S. Izrailev D.K. Agrafiotis 2003 Conformational sampling by self-organization J. Chem. Inf. Comput. Sci. 43 1186 1191