A symmetry-driven BP algorithm for the discretizable molecular distance geometry problem

2011 IEEE International Conference on Bioinformatics and Biomedicine Workshops, BIBMW 2011

Volumn , Issue , 2011, Pages 390-395

  Mucherino, A ^a   Lavor, C ^b   Liberti, L ^c  

^a UNIVERSITÉ DE RENNES 1   (France)

^b UNIVERSITY OF CAMPINAS   (Brazil)

^c ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BP ALGORITHM; COMPUTATIONAL EXPERIMENT; DETERMINISTIC ALGORITHMS; MOLECULAR DISTANCE GEOMETRY PROBLEM; NMR TECHNIQUES; STRUCTURAL BIOLOGY;

BINARY TREES;

BACKPROPAGATION ALGORITHMS;

EID: 84856002031     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/BIBMW.2011.6112403     Document Type: Conference Paper

References (22)

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:235-242, 2000. (Pubitemid 30047768)
2. C. Lavor. On generating instances for the molecular distance geometry problem. In L. Liberti and N. Maculan, editors, Global Optimization: from Theory to Implementation, pages 405-414. Springer, New York.
3. C. Lavor, L. Liberti, and N. Maculan. Molecular distance geometry problem. In C. Floudas and P. Pardalos, editors, Encyclopedia of Optimization, pages 2305-2311. Springer, New York, second edition, 2009.
4. C. Lavor, L. Liberti, N. Maculan, and A. Mucherino. The discretizable molecular distance geometry problem. Computational Optimization and Applications, Online First Articles, 2011.
5. C. Lavor, L. Liberti, and A. Mucherino. On the solution of molecular distance geometry problems with interval data. In International Workshop on Computational Proteomics, International Conference on Bioinformatics & Biomedicine (BIBM10), pages 77-82, Hong Kong, 2010. IEEE conference proceedings.
6. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. An artificial backbone of hydrogens for finding the conformation of protein molecules. In Proceedings of the Computational Structural Bioinformatics Workshop, pages 152-155, Washington D.C., USA, 2009. IEEE BIBM.
7. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. Computing artificial backbones of hydrogen atoms in order to discover protein backbones. In Proceedings of the International Multiconference on Computer Science and Information Technology, pages 751-756, Mragowo, Poland, 2009. IEEE.
8. C. Lavor, A. Mucherino, L. Liberti, and N. Maculan. Discrete approaches for solving molecular distance geometry problems using nmr data. International Journal of Computational Biosciences, 1:88-94, 2011.
9. 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:329-344, 2011.
10. L. Liberti, C. Lavor, and N. Maculan. A branch-and-prune algorithm for the molecular distance geometry problem. International Transactions in Operational Research, 15:1-17, 2008.
11. L. Liberti, C. Lavor, A. Mucherino, and N. Maculan. Molecular distance geometry methods: from continuous to discrete. International Transactions in Operational Research, 18:33-51, 2011.
12. L. Liberti, B. Masson, C. Lavor, and A. Mucherino. Branch-and-prune trees with bounded width. In Proceedings of the 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW11), pages 189-193, Rome, Italy, 2011.
13. L. Liberti, B. Masson, J. Lee, C. Lavor, and A. Mucherino. On the number of solutions of the discretizable molecular distance geometry problem. In Proceedings of the 5th Annual International Conference on Combinatorial Optimization and Applications (COCOA11), volume 6831 of Lecture Notes in Computer Science, pages 322-342. Springer, 2011.
14. J.J. Moré and Z. Wu. Distance geometry optimization for protein structures. Journal of Global Optimization, 15:219-234, 1999. (Pubitemid 129620084)
15. A. Mucherino and C. Lavor. The branch and prune algorithm for the molecular distance geometry problem with inexact distances. In Proceedings of the International Conference on Computational Biology, volume 58, pages 349-353. World Academy of Science, Engineering and Technology, 2009.
16. 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:289-302, 2009.
17. A. Mucherino, C. Lavor, and N. Maculan. The molecular distance geometry problem applied to protein conformations. In S. Cafieri, A. Mucherino, G. Nannicini, F. Tarissan, and L. Liberti, editors, Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pages 337-340, Paris, 2009. École Polytechnique.
18. A. Mucherino, C. Lavor, T. Malliavi, L. Liberti, M. Nilges, and N. Maculan. Influence of pruning devices on the solution of molecular distance geometry problems. In P.M. Pardalos and S. Rebennack, editors, Proceedings of the 10th International Symposium on Experimental Algorithms (SEA11), volume 6630 of Lecture Notes in Computer Science, pages 206-217, Crete, Greece, 2011. Springer.
19. A. Mucherino, L. Liberti, and C. Lavor. MD-jeep: an implementation of a branch & prune algorithm for distance geometry problems. In K. Fukuda et al., editor, Proceedings of the Third International Congress on Mathematical Software (ICMS10), volume 6327 of Lectures Notes in Computer Science, pages 186-197, Kobe, Japan, 2010. Springer.
20. A. Mucherino, L. Liberti, C. Lavor, and N. Maculan. Comparisons between an exact and a metaheuristic algorithm for the molecular distance geometry problem. In F. Rothlauf, editor, Proceedings of the Genetic and Evolutionary Computation Conference, pages 333-340, Montreal, 2009. ACM.
21. A.T. Phillips, J.B. Rosen, and V.H. Walke. Molecular structure determination by convex underestimation of local energy minima. In P.M. Pardalos, D. Shalloway, and G. Xue, editors, Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding, volume 23, pages 181-198. American Mathematical Society, 1996.
22. J.B. Saxe. Embeddability of weighted graphs in k-space is strongly NP-hard. Proceedings of 17th Allerton Conference in Communications, Control and Computing, pages 480-489, 1979.