The discretizable molecular distance geometry problem seems easier on proteins

Distance Geometry: Theory, Methods, and Applications

Volumn 9781461451280, Issue , 2013, Pages 47-60

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

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c CAMPUS DE BEAULIEU   (France)

Author keywords

Branch and Prune; Distance geometry; Fixed parameter tractable; Protein conformation; Symmetry

Indexed keywords

GEOMETRY; INTEGER PROGRAMMING; NUCLEAR MAGNETIC RESONANCE;

BRANCH AND PRUNES; BRANCH-AND-PRUNE ALGORITHMS; DISTANCE GEOMETRY; EMBEDDINGS; FIXED-PARAMETER TRACTABLE; INTER-ATOMIC DISTANCES; MOLECULAR CONFORMATION; MOLECULAR DISTANCE GEOMETRY PROBLEM; PROTEIN CONFORMATION; SYMMETRY;

PROTEINS;

EID: 84884931980     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4614-5128-0_3     Document Type: Chapter

References (21)

1. Berman, H. Westbrook, J., Feng, Z., Gilliland, G., Bhat, T., Weissig, H., Shindyalov, I., Bourne, P.: The protein data bank. Nucleic Acid Res. 28, 235-242 (2000)
2. Connelly, R.: Generic global rigidity. Discrete Comput. Geom. 33, 549-563 (2005)
3. Crippen, G., Havel, T.: Distance Geometry and Molecular Conformation. Wiley, New York (1988)
4. Dong, Q., Wu, Z.: A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data. J. Global Optim. 26, 321-333 (2003)
5. Eren, T., Goldenberg, D., Whiteley, W., Yang, Y., Morse, A., Anderson, B., Belhumeur, P.: Rigidity, computation, and randomization in network localization. In: IEEE Infocom Proceedings, 2673-2684 (2004)
6. Graver, J.E., Servatius, B., Servatius, H.: Combinatorial Rigidity. Graduate Studies in Math., AMS (1993)
7. Lavor, C. Lee, J., John, A.L.S., Liberti, L., Mucherino, A., Sviridenko, M.: Discretization orders for distance geometry problems. Optim. Lett. 6, 783-796 (2012)
8. 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)
9. Lavor, C., Liberti, L. Maculan, N. Mucherino, A.: The discretizable molecular distance geometry problem. Comput. Optim. Appl. 52, 115-146 (2012)
10. Lavor, C., Liberti, L., Mucherino, A.: On the solution of molecular distance geometry problems with interval data. In: IEEE Conference Proceedings, International Workshop on Computational Proteomics (IWCP10), International Conference on Bioinformatics and Biomedicine (BIBM10), Hong Kong, 77-82 (2010)
11. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: On the computation of protein backbones by using artificial backbones of hydrogens. J. Global Optim. 50, 329-344 (2011)
12. Liberti, L., Lavor, C.: On a relationship between graph realizability and distance matrix completion. In: Kostoglou, V., Arabatzis, G., Karamitopoulos, L. (eds.) Proceedings of BALCOR, vol. I, pp. 2-9. Hellenic OR Society, Thessaloniki (2011)
13. 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)
14. Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular distance geometry methods: from continuous to discrete. Int. Trans. Oper. Res. 18, 33-51 (2010)
15. Liberti, L., Masson, B., Lavor, C., Lee, J., Mucherino, A.: On the number of solutions of the discretizable molecular distance geometry problem, Tech. Rep. 1010.1834v1[cs.DM], arXiv (2010)
16. Liberti, L., Masson, B., Lee, J., Lavor, C., Mucherino, A.: On the number of solutions of the discretizable molecular distance geometry problem, Lecture Notes in Computer Science. In: Wang, W., Zhu, X., Du, D-Z. (eds.) Proceedings of the 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA11), Zhangjiajie, China, vol.6831, pp. 322-342 (2011)
17. Moré, J., Wu, Z.: Global continuation for distance geometry problems. SIAM J. Optim. 7(3), 814-846 (1997)
18. Mucherino, A., Lavor, C., Liberti, L.: The discretizable distance geometry problem, to appear in Optimization Letters (DOI:10.1007/s11590-011-0358-3).
19. Mucherino, A., Liberti, L., Lavor, C.: MD-jeep: an implementation of a branch and prune algorithm for distance geometry problems, Lectures Notes in Computer Science. In: Fukuda, K., et al. (eds.) Proceedings of the Third International Congress on Mathematical Software (ICMS10), Kobe, Japan, vol. 6327, pp. 186-197 (2010)
20. th Allerton Conference in Communications, Control and Computing, pp. 480-489 (1979)
21. Schlick, T.: Molecular Modelling and Simulation: An Interdisciplinary Guide. Springer, New York (2002)