Molecular distance geometry optimization using geometric build-up and evolutionary techniques on GPU

2012 IEEE Symposium on Computational Intelligence and Computational Biology, CIBCB 2012

Volumn , Issue , 2012, Pages 321-328

  Fabry Asztalos, Levente ^a   Lorentz, István ^b   Andonie, Rǎzvan ^a,b  

^a CENTRAL WASHINGTON UNIVERSITY   (United States)

^b TRANSILVANIA UNIVERSITY OF BRASOV   (Romania)

Author keywords

Graph algorithms; Graphics processors; Molecular Distance Geometry; Parallel algorithms; Simulated annealing

Indexed keywords

3D STRUCTURE; COMPUTATIONAL OVERHEADS; DEPTH FIRST; DISTANCE MATRICES; EVOLUTIONARY TECHNIQUES; EXECUTION TIME; GRAPH ALGORITHMS; GRAPH STRUCTURES; GRAPH TRAVERSALS; GRAPHIC PROCESSING UNITS; GRAPHICS PROCESSOR; MOLECULAR DISTANCES; ROOT-MEAN-SQUARE ERRORS;

ARTIFICIAL INTELLIGENCE; BIOINFORMATICS; PARALLEL ALGORITHMS; SIMULATED ANNEALING;

GEOMETRY;

EID: 84864049952     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIBCB.2012.6217247     Document Type: Conference Paper

References (42)

1. W. Torgerson, "Multidimensional scaling: I. Theory and method," Psychometrika, vol. 17, no. 4, pp. 401-419, Dec. 1952.
2. I. Borg and P. Groenen, Modern Multidimensional Scaling: Theory and Applications. Springer, 2005.
3. G. Seber, Multivariate observations, ser. in probability and statistics. Wiley-Interscience, 2004.
4. T. Kamada and S. Kawai, "An algorithm for drawing general undirected graphs," Inf. Process. Lett., vol. 31, pp. 7-15, April 1989.
5. U. Brandes and C. Pich, "Eigensolver methods for progressive multidimensional scaling of large data," in Graph Drawing, ser. Lecture Notes in Computer Science, M. Kaufmann and D. Wagner, Eds. Springer Berlin / Heidelberg, 2007, vol. 4372, pp. 42-53.
6. R. Davidson and D. Harel, "Drawing graphs nicely using simulated annealing," ACM Trans. Graph., vol. 15, pp. 301-331, October 1996.
7. T. F. Havel, "Distance geometry: Theory, algorithms and chemical applications," in Encyclopedia of Computational Chemistry. John Wiley and Sons, 1998, pp. 723-742.
8. W. Glunt, T. L. Hayden, and M. Raydan, "Molecular conformations from distance matrices," J. Comput. Chem., vol. 14, pp. 114-120, January 1993.
9. C. Lavor, L. Liberti, and N. Maculan, "Molecular distance geometry problem," in Encyclopedia of Optimization, C. A. Floudas and P. M. Pardalos, Eds. Springer US, 2009, pp. 2304-2311.
10. L. M. Blumenthal, Theory and applications of distance geometry. Bronx, NY: Chelsea, 1970.
11. A. Group, MDSJ: Java Library for Multidimensional Scaling, 2009. [Online]. Available: http://www.inf.uni-konstanz.de/algo/software/mdsj/
12. T. Havel, I. Kuntz, and G. Crippen, "The theory and practice of distance geometry," Bulletin of Mathematical Biology, vol. 45, pp. 665-720, 1983.
13. M. Pharr and R. Fernando, GPU Gems 2: Programming techniques for high-performance graphics and general-purpose computation. Addison-Wesley Professional, 2005. [Online]. Available: http://http.developer.nvidia.com/ GPUGems2/gpugems2 chapter43.html
14. J. de Leeuw, "Applications of convex analysis to multidimensional scaling," in Recent Developments in Statistics, J. Barra, F. Brodeau, G. Romier, and B. V. Cutsem, Eds. Amsterdam: North Holland Publishing Company, 1977, pp. 133-146.
15. E. R. Gansner, Y. Koren, and S. North, "Graph drawing by stress majorization," in Graph Drawing. Springer, 2004, pp. 239-250.
16. J. J. Moré and Z. Wu, "Distance geometry optimization for protein structures," J. of Global Optimization, vol. 15, pp. 219-234, October 1999.
17. A. Grosso, M. Locatelli, and F. Schoen, "Solving molecular distance geometry problems by global optimization algorithms," Computational Optimization and Applications, vol. 43, pp. 23-37, 2009.
18. M. Nilges, A. M. Gronenborn, A. T. Brunger, and M. G. Clore, "Determination of three-dimensional structures of proteins by simulated annealing with interproton distance restraints. Application to crambin, potato carboxypeptidase inhibitor and barley serine proteinase inhibitor 2," Protein Eng., vol. 2, no. 1, pp. 27-38, Apr. 1988.
19. A. H. C. Kampen, L. M. C. Buydens, C. B. Lucasius, and M. J. J. Blommers, "Optimisation of metric matrix embedding by genetic algorithms," Journal of Biomolecular NMR, vol. 7, pp. 214-224, 1996.
20. R. Leardi, Nature-inspired methods in chemometrics: genetic algorithms and artificial neural networks, ser. Data handling in science and technology. Elsevier, 2003.
21. Q. Dong and Z.Wu, "A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances," Journal of Global Optimization, vol. 22, pp. 365-375, 2002.
22. - "A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data," J. of Global Optimization, vol. 26, pp. 321-333, July 2003.
23. D. Wu and Z. Wu, "An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data," J. of Global Optimization, vol. 37, pp. 661-673, April 2007.
24. R. Davis, C. Ernst, and D. Wu, "Protein structure determination via an efficient geometric build-up algorithm," BMC Structural Biology, vol. 10, no. Suppl 1, p. S7, 2010.
25. A. Sit, Z. Wu, and Y. Yuan, "A geometric buildup algorithm for the solution of the distance geometry problem using Least-Squares approximation," Bulletin of Mathematical Biology, 2007.
26. C. Lavor, L. Liberti, N. Maculan, and A. Mucherino, "Recent advances on the discretizable molecular distance geometry problem," European Journal of Operational Research, 2011.
27. A. Mucherino, C. Lavor, L. Liberti, and E.-G. Talbi, "A parallel version of the branch and prune algorithm for the molecular distance geometry problem," in Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications, ser. AICCSA '10. Washington, DC, USA: IEEE Computer Society, 2010, pp. 1-6.
28. L. Liberti, C. Lavor, B. Masson, and A. Mucherino, "Polynomial cases of the discretizable molecular distance geometry problem," CoRR, vol. abs/1103.1264, 2011, informal publication.
29. G. M. Crippen, "Linearized embedding: a new metric matrix algorithm for calculating molecular conformations subject to geometric constraints," J. Comput. Chem., vol. 10, pp. 896-902, October 1989.
30. B. A. Hendrickson, "The Molecular Problem: Determining Conformation from Pairwise Distances," Cornell University, Ithaca, NY, USA, Tech. Rep., 1990.
31. W. Rieping, M. Habeck, and M. Nilges, "Inferential Structure Determination," Science, vol. 309, no. 5732, pp. 303-306, Jul. 2005.
32. JGraphT - a free Java graph library, 2009. [Online]. Available: http://jgrapht.sourceforge.net
33. "Commons-Math: The Apache Commons Mathematics Library." [Online]. Available: http://commons.apache.org/math/
34. W. Kabsch, "A solution for the best rotation to relate two sets of vectors." Acta Crystallographica, vol. 32, pp. 922-923, 1976.
35. C. Bron and J. Kerbosch, "Algorithm 457: finding all cliques of an undirected graph," Commun. ACM, vol. 16, pp. 575-577, September 1973.
36. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 220, pp. 671-680, 1983.
37. J. Barnes and P. Hut, "A hierarchical O(N log N) force-calculation algorithm," Nature, vol. 324, no. 6096, pp. 446-449, Dec. 1986.
38. Khronos OpenCL Working Group, The OpenCL Specification, version 1.1, 2010. [Online]. Available: http://www.khronos.org/registry/cl/specs/opencl-1.1. pdf
39. "JOCL - Java binding for the OpenCL API." [Online]. Available: http://jogamp.org/jocl/www/
40. 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 Acids Research, vol. 28, pp. 235-242, 2000. [Online]. Available: http://www.rcsb.org/pdb/
41. K. Wüthrich, "Protein structure determination in solution by NMR spectroscopy." Journal of Biological Chemistry, vol. 265, no. 36, pp. 22 059-22 062, 1990.
42. R. D. Luce and A. D. Perry, "A method of matrix analysis of group structure," Psychometrika, 1949.