Exploiting symmetry properties of the discretizable molecular distance geometry problem

Journal of Bioinformatics and Computational Biology

Volumn 10, Issue 3, 2012, Pages

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

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

branch and prune; discretization; distance geometry; NMR; Protein conformation; symmetry

Indexed keywords

PROTEIN;

ALGORITHM; ARTICLE; CHEMICAL STRUCTURE; CHEMISTRY;

ALGORITHMS; MODELS, MOLECULAR; PROTEINS;

EID: 84862505760     PISSN: 02197200     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0219720012420097     Document Type: Conference Paper

References (25)

1. Crippen G, Havel T, Distance Geometry and Molecular Conformation, Wiley, New York, 1988.
2. Schlick T, Molecular Modelling and Simulation: An Interdisciplinary Guide, Springer, New York, 2002.
3. Lavor C, Liberti L, Maculan N, Mucherino A, The discretizable molecular distance geometry problem, to appear in Comput Opt Appl, 2012.
4. Saxe JB, Embeddability of weighted graphs in k-space is strongly NP-hard, Proc 17th Allerton Conference in Communications, Control and Computing, pp. 480-489, 1979.
5. Biswas P, Toh K-C, Ye Y, A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation, SIAM J Sci Comput 30:1251-1277, 2008.
6. Krislock N, Semidenite facial reduction for low-rank euclidean distance matrix completion. PhD thesis, University of Waterloo, 2010.
7. Mor-e JJ, Wu Z, Distance geometry optimization for protein structures, J Global Optim 15:219-234, 1999.
8. Wu D, Wu Z, An updated geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data, J Global Optimization 37:661-673, 2007.
9. Lavor C, Liberti L, Maculan N, Molecular distance geometry problem, in Floudas C, Pardalos P (eds), Encyclopedia of Optimization 2nd edn., Springer, New York, 2009, pp. 2305-2311.
10. Lavor C, Liberti L, Maculan N, Mucherino A, Recent advances on the discretizable molecular distance geometry problem, Eur J Oper Res 219:698-706, 2012.
11. Liberti L, Lavor C, Mucherino A, Maculan N, Molecular distance geometry methods: From continuous to discrete, Int Transact Oper Res 18:33-51, 2011.
12. Liberti L, Lavor C, Maculan N, A branch-And-prune algorithm for the molecular distance geometry problem, Int Transact Oper Res 15:1-17, 2008.
13. Mucherino A, Liberti L, Lavor C, MD-jeep: An implementation of a branch & prune algorithm for distance geometry problems, in Fukuda K et al. (ed), Proc Third Int Congress on Mathematical Software (ICMS10), volume 6327 of Lectures Notes in Computer Science, Kobe, Japan, Springer, pp. 186-197, 2010.
14. Lavor C, Lee J, Lee-St. John A, Liberti L, Mucherino A, Sviridenko M, Discretization orders for distance geometry problems, to appear in Optimization Letters, 2012.
15. Lavor C, Liberti L, Mucherino A, The interval Branch-And-Prune Algorithm for the discretizable molecular distance geometry problem with inexact distances, to appear in J Global Opt, 2012.
16. 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.
17. Lavor C, Mucherino A, Liberti L, Maculan N, On the computation of protein backbones by using articial backbones of hydrogens, J Global Optim 50:329-344, 2011.
18. Mucherino A, Lavor C, Malliavin T, Liberti L, Nilges, M, Maculan N, In̊uence of pruning devices on the solution of molecular distance geometry problems, in Pardalos PM, Rebennack S, (ed), Proc 10th Int Symp on Experimental Algorithms (SEA11), volume 6630 of Lecture Notes in Computer Science, Crete, Greece, Springer, 2011, pp. 206-217.
19. Liberti L, Masson B, Lavor C, Mucherino A, Branch-And-prune trees with bounded width, Proc 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW11), pp. 189-193, Rome, Italy, 2011.
20. Liberti L, Masson B, Lee J, Lavor C, Mucherino A, On the number of solutions of the discretizable molecular distance geometry problem, Proc 5th Annual Int Conf Combinatorial Optimization and Applications (COCOA11), volume 6831 of Lecture Notes in Computer Science, Springer, pp. 322-342, 2011.
21. Mucherino A, Lavor C, Liberti L, Talbi E-G A parallel version of the Branch & Prune Algorithm for the molecular distance geometry problem, IEEE Conf Proc ACS/IEEE Int Conf Computer Systems and Applications (AICCSA10), pp. 1-6, Hammamet, Tunisia, 2010.
22. Lavor C, On generating instances for the molecular distance geometry problem in Liberti L, Maculan N (eds) Global Optimization: From Theory to Implementation, Springer, New York, pp. 405-414.
23. Phillips AT, Rosen JB, Walke VH, Molecular structure determination by convex underestimation of local energy minima, in Pardalos PM, Shalloway D, Xue G (eds), Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, volume 23, American Mathematical Society, pp. 181-198, 1996.
24. Mucherino A, Lavor C, Liberti L, A symmetry-driven BP algorithm for the discretizable molecular distance geometry problem, IEEE Conf Proc Computational Structural Bioinformatics Workshop (CSBW11), Int Conf Bioinformatics & Biomedicine (BIBM11), Atlanta, GA, USA, pp. 390-395, 2011.
25. Berman HM, Westbrook J, Feng Z, Gilliland G, Bhat TN, Weissig H, Shindyalov IN, Bourne PE, The protein data bank, Nucleic Acid Res 28: 235-242, 2000.