MD-jeep: An implementation of a Branch and Prune algorithm for distance geometry problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6327 LNCS, Issue , 2010, Pages 186-197

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

^a INRIA   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

^c UNIVERSITY OF CAMPINAS   (Brazil)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONFORMATIONS; DIGITAL ARITHMETIC; OPEN SOURCE SOFTWARE; PROBLEM ORIENTED LANGUAGES;

BRANCH-AND-PRUNE ALGORITHMS; COMBINATORIAL OPTIMIZATION PROBLEMS; EXPERIMENTAL TECHNIQUES; FLOATING POINT OPERATIONS; GNU GENERAL PUBLIC LICENSE; MEMORY REQUIREMENTS; MOLECULAR CONFORMATION; SOFTWARE IMPLEMENTATION;

C (PROGRAMMING LANGUAGE);

EID: 78149236724     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15582-6_34     Document Type: Conference Paper

References (20)

1. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., Bourne, P.E.: The Protein Data Bank. Nucleic Acids Research 28, 235-242 (2000)
2. Coope, I.D.: Reliable Computation of the Points of Intersection of n Spheres in n-space. ANZIAM Journal 42, 461-477 (2000)
3. 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 Journal on Scientific Computing 30, 1251-1277 (2008)
4. Crippen, G.M., Havel, T.F.: Distance Geometry and Molecular Conformation. John Wiley & Sons, New York (1988)
5. 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)
6. Hodsdon, M.E., Ponder, J.W., Cistola, D.P.: The NMR Solution Structure of Intestinal Fatty Acid-binding Protein Complexed with Palmitate: Application of a Novel Distance Geometry Algorithm. Journal of Molecular Biology 264, 585-602 (1996)
7. Lavor, C., Liberti, L., Maculan, N.: Discretizable Molecular Distance Geometry Problem, Tech. Rep. q-bio.BM/0608012, arXiv (2006)
8. Lavor, C., Liberti, L., Maculan, N.: Molecular Distance Geometry Problem. In: Floudas, C., Pardalos, P. (eds.) Encyclopedia of Optimization, 2nd edn., pp. 2305-2311. Springer, New York (2009)
9. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: Discrete Approaches for Solving Molecular Distance Geometry Problems using NMR Data. International Journal of Computational Biosciences (to appear 2010)
10. 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 Multiconference on Computer Science and Information Technology (IMCSIT 2009), Workshop on Computational Optimization (WCO 2009), Mragowo, Poland, pp. 751-756 (2009)
11. Lavor, C., Mucherino, A., Liberti, L., Maculan, N.: An Artificial Backbone of Hydrogens for Finding the Conformation of Protein Molecules. In: Proceedings of the Computational Structural Bioinformatics Workshop (CSBW 2009), Washington DC, USA, pp. 152-155 (2009)
12. Liberti, L., Lavor, C., Maculan, N.: A Branch-and-Prune Algorithm for the Molecular Distance Geometry Problem. International Transactions in Operational Research 15(1), 1-17 (2008)
13. Liberti, L., Lavor, C., Mucherino, A., Maculan, N.: Molecular Distance Geometry Methods: from Continuous to Discrete. International Transactions in Operational Research (to appear 2010)
14. Moré, J.J., Wu, Z.: Distance Geometry Optimization for Protein Structures. Journal of Global Optimization 15, 219-223 (1999)
15. Mucherino, A., Lavor, C.: The Branch and Prune Algorithm for the Molecular Distance Geometry Problem with Inexact Distances. In: Proceedings of World Academy of Science, Engineering and Technology (WASET), International Conference on Bioinformatics and Biomedicine (ICBB 2009), Venice, Italy, pp. 349-353 (2009)
16. Mucherino, A., Lavor, C., Liberti, L.: The Discretizable Distance Geometry Problem. Optimization Letters (in revision)
17. 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 (GECCO 2009), Montréal, Canada, pp. 333-340 (2009)
18. 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)
19. Schwieters, C.D., Kuszewski, J.J., Clore, G.M.: Using Xplor-NIH for NMR Molecular Structure Determination. Progress in Nuclear Magnetic Resonance Spectroscopy 48, 47-62 (2006)
20. Wu, D.,Wu, Z.: An Updated Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data. Journal of Global Optimization 37, 661-673 (2007)