The solution of the distance geometry problem in protein modeling via geometric buildup

Biophysical Reviews and Letters

Volumn 3, Issue 1-2, 2008, Pages 43-75

  Wu, Di ^a   Wu, Zhijun ^b   Yuan, Yaxiang ^c  

^a WESTERN KENTUCKY UNIVERSITY   (United States)

^b IOWA STATE UNIVERSITY   (United States)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

Biomolecular modeling; Distance geometry; Protein structure determination

Indexed keywords

ALGORITHM; ATOM; BIOSTATISTICS; COMPUTER SYSTEM; CONFERENCE PAPER; GEOMETRY; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MOLECULAR MODEL; PRIORITY JOURNAL; PROTEIN DETERMINATION; PROTEIN STRUCTURE; STATISTICAL ANALYSIS; SYSTEMS THEORY; THEORETICAL STUDY;

EID: 51349168115     PISSN: 17930480     EISSN: None     Source Type: Journal    
DOI: 10.1142/s1793048008000617     Document Type: Conference Paper

References (52)

1. T. E. Creighton, Proteins: Structures and Molecular Properties, 2nd Edition, Freeman and Company, 1993.
2. H. M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T. N. Bhat, H. Weissig, L. N. Shindyalov, and P. E. Bourne, The Protein Data Bank, Nuc. Acid. Res., 28, 2000, 235-242.
3. J. Drenth, Principles of Protein X-ray Crystallography, Springer-Verlag, 1994.
4. H. Gunther, NMR Spectroscopy: Basic Principles, Concepts, and Applications in Chemistry, John Wiley & Sons, 1995.
5. T. Schlick, Molecular Modeling and Simulation: An Interdisciplinary Guide, Springer, 2003.
6. P. E. Bourne and H. Weissig, Structural Bioinformatics. John Wiley & Sons, Inc., 2003.
7. J. Moult, K. Fidelis, B. Rost, T. Hubbard, and A. Tramontano, Critical assessment of methods for protein structure prediction (CASP), Proteins: Structure, Function, Bioinformatics, 61, 2005, 3-7.
8. V. S. Pande, I Baker, J. Chapman, S. P. Elmer, S. Khaliq, S. M. Larson, Y. M. Rhee, M. R. Shirts, C. D. Snow, E. J. Sorin, and B. Zagrovic, Atomistic protein folding simulations on submillisecond time scale using worldwide distributed computing, Biopolymers, 68, 2003, 91-109.
9. L. M. Blumenthal, Theory and Applications of Distance Geometry, Oxford Clarendon Press, 1953.
10. J. B. Saxe, Embeddability of weighted graphs in k-space is strongly NP-hard, in Proc. 17th Allerton Conference in Communications, Control and Computing, 1979, 480-489.
11. W. S. Torgerson, Theory and Method of Scaling, John Wiley & Sons, 1958.
12. P. Biswas, T. Liang, T. Wang, and Y. Ye, Semidefinite programming based algorithms for sensor network localization. ACM J on Transactions on Sensor Networks, 2, 2006, 188-220.
13. H. Klock and J. M. Buhmann, Multidimensional scaling with deterministic annealing, in Lecture Notes in Computer Science 1223: Energy Minimization Methods in Computer Vision and Patter Recognition, M Pilillo and E. R. Hancock, eds., Springer-Verlag, 1997, 246-260.
14. J. T. Hou, G. E. Sims, C. Zhang, and S. H. Kim, A global representation of the protein fold space, Proc. Natl. Acad. Sci. USA, 100, 2003, 2386-2390.
15. K. Wuthrich, NMR of Proteins and Nucleic Acids, John Wiley & Sons, 1986.
16. G. M. Clore and A. M. Gronenborn, New methods of structure refinement for macro-molecular structure determination by NMR, Proc. Natl. Acad. Sci. USA, 95, 1998, 5891-5898.
17. F. Cui, R. Jernigan, and Z. Wu, Refinement of NMR-determined protein structures with database derived distance constraints, J Bioinformatics and Computational Biology, 3, 2005, 1315-1329.
18. D. Wu, F. Cui, R. Jernigan, and Z. Wu, PIDD: A database for protein inter-atomic distance distributions, Nucleic Acids Research, 35, 2007, D202-D207.
19. D. Wu, R. Jernigan, and Z. Wu, Refinement of NMR-determined protein structures with database derived mean-force potentials, Proteins: Structure, Function, Bioinformatics, 68, 232-242, 2007.
20. G. M. Crippen and T. F. Havel, Distance Geometry and Molecular Conformation, John Wiley & Sons, 1988.
21. T. F. Havel, Distance geometry, in Encyclopedia of Nuclear Magnetic Resonance, D. M. Grant and R. K. Harris, eds., John Wiley & Sons, 1995, 1701-1710.
22. T. Havel, An evaluation of computational strategies for use in the determination of protein structure from distance constraints obtained by nuclear magnetic resonance, Prog. Biophys. Molec. Biol., 56, 1991, 43-78.
23. A. T. Brnger and M. Niles, Computational challenges for macromolecular modeling, in Reviews in Computational Chemistry, 5, K. B. Lipkowitz and D. B. Boyd, eds., VCH Publishers, 1993, 299-335.
24. Kuszewski, M. Niles, and A. T. Brnger, Sampling and efficiency of metric matrix distance geometry: A novel partial metrization algorithm, J. Biomolecular NMR, 2, 1992, 33-56.
25. A. T. Brnger, P. D. Adams, G. M. Clore, W. L. DeLano, P. Gros, R. W. Grosse-Kunstleve, S. Jiang, J. Kuszewski, N. Nilges, N. S. Pannu, R. J. Read, L. M. Rice, T. Simonson, and G. L. Warren, Crystallography and NMR System: A new software suite for macromolecular structure determination, Acta Cryst., D54, 1998, 905-921.
26. T. F. Havel and M. E. Snow, A new method for building protein conformations from sequence alignments with homologues of known structure, J. Mol. Biol., 217, 1991, 1-7.
27. S. Srinivasan, C. J. March, and S. Sudarsanam, An automated method for modeling proteins on known templates using distance geometry, Protein Science, 2, 1993, 277-289.
28. E. S. Huang, R. Samudrala, and J. W., Ponder, Distance geometry generates native-like folds for small helical proteins using the consensus distance's of predicted protein structures, Protein Science, 7, 1998.
29. G. A. Williams, J. M. Dugan, and R. B. Altman, Constrained global optimization for estimating molecular structure from atomic distances, J. Comput. Biol., 8, 2001, 523-547.
30. B. Hendrickson, Conditions for unique graph realizations, SIAM J. Comput., 21, 1992, 65-84.
31. B. Hendrickson, The molecule problem: Exploiting structure in global optimization, SIAM J. Optim., 5, 1995, 835-857.
32. W. Glunt, T. L. Hayden, S. Hong, and J. Wells, An alternating projection algorithm for computing the nearest Euclidean distance matrix, SIAM J. Mat. Anal. Appl., 11, 1990, 589-600.
33. W. Glunt and T. L. Hayden and M. Raydan, Molecular conformations from distance matrices, J. Comput. Chem., 14, 1993, 114-120.
34. J. Mor and Z. Wu, Global continuation for distance geometry problems, SIAM J. Optim., 7, 1997, 814-836.
35. J. Mor and Z. Wu, Distance geometry optimization for protein structures, J. Global Optim. 15, 1999, 219-234.
36. Z. Zou, R. H. Byrd, and R. B. Schnabel, A stochastic/perturbation global optimization algorithm for distance geometry problems", J. Global Optim., 11, 1997, 91-105.
37. A. Kearsly, R. Tapia, and M. Trosset, Solution of the metric STRESS and SSTRESS problems in multidimensional scaling by Newton's method, Computational Statistics 13, 1998, 369-396.
38. M. Trosset, Applications of multidimensional scaling to molecular conformation, Computing Sciences and Statistics 29, 1998, 148-152.
39. A. Le Thi Hoai and T. Pham Dinh, Large scale molecular optimization from distance matrices, by a d.c. optimization approach, SIAM J. Optim., 4, 2003, 77-116
40. P. Biswas, T. Liang, K. Toh, and Y. Ye, A SDP based approach to anchor-free 3D graph realization, Department of Management Science and Engineering, Electrical Engineering, Stanford University, Stanford, California, 2007.
41. A. Grosso, M. Locatelli, and F. Schoen, Solving molecular distance geometry problems by global optimization algorithms, J. Comput. Opt. and Appl., 2007, to appear.
42. Q. Dong and Z. Wu, A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances, J. Global Optim., 22, 2002, 365-375.
43. Q. Dong and Z. Wu, A geometric buildup algorithm for solving the molecular distance geometry problem with sparse distance data, J. Global Optim., 26, 2003, 321-333.
44. D. Wu and Z. Wu, An updated geometric buildup algorithm for solving the molecular distance geometry problem with sparse distance data, J. Global Optim., 37, 2007, 661-673.
45. D. Wu, Z. Wu, and Y. Yuan, Rigid vs. unique determination of protein structures, Optimization Letters, (published online, DOI: 10.1007/ s11590-007-0060-7), 2007.
46. A. Sit, Z. Wu, and Y. Yuan, A stable geometric buildup algorithm for the solution of the distance geometry problem using east-squares approximation, 2007, submitted.
47. G. H. Golub and C. F. van Loan, Matrix Computations, Johns Hopkins University Press, 1989.
48. M. Sippl and H. Scheraga, Solution of the embedding problem and decomposition of symmetric matrices, Proc. Natl. Acad. Sci. USA, 82, 1985, 2197-2201.
49. M. Sippl and H. Scheraga, Cayley-Menger coordinates, Proc. Natl. Acad. Sci. USA 83, 1986, 2283-2287.
50. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman & Co., 1979.
51. J. Mor and Z. Wu, e-Optimal solutions to distance geometry problems via global Continuation, in Global Minimization of Non-Convex Energy Functions: Molecular Conformation and Protein Folding, P. M. Pardalos, D. Shalloway, and G. Xue, eds., American Mathematical Society, 1996, 151-168.
52. H. X. Huang and Z. A. Liang, and P. Pardalos, Some properties for the Euclidean distance matrix and positive semi-definite matrix completion problems, J. Global Optim., 25, 2003, 3-21.