Artículos de revistas
Betamdgp: Protein Structure Determination Algorithm Based On The Beta-complex
Registro en:
Lecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). Springer Verlag, v. 8360, n. , p. 130 - 155, 2014.
3029743
10.1007/978-3-642-54212-1-7
2-s2.0-84904755213
Autor
Seo J.
Kim J.-K.
Ryu J.
Lavor C.
Mucherino A.
Kim D.-S.
Institución
Resumen
The molecular distance geometry problem (MDGP) is a fundamental problem in determining molecular structures from the NMR data. We present a heuristic algorithm, the BetaMDGP, which outperforms existing algorithms for solving the MDGP. The BetaMDGP algorithm is based on the beta-complex, which is a geometric construct extracted from the quasi-triangulation derived from the Voronoi diagram of atoms. Starting with an initial tetrahedron defined by the centers of four closely located atoms, the BetaMDGP determines a molecular structure by adding one shell of atoms around the currently determined substructure using the beta-complex. The proposed algorithm has been entirely implemented and tested with atomic arrangements stored in an NMR format created from PDB files. Experimental results are also provided to show the powerful capability of the proposed algorithm. © 2014 Springer-Verlag Berlin Heidelberg. 8360
130 155 Donald, B.R., (2011) Algorithms in Structural Molecular Biology, , The MIT Press Cavanagh, J., Fairbrother, W.J., Palmer III, A.G., Rance, M., Skelton, N.J., (2006) Protein NMR Spectroscopy: Principles and Practice, , Academic Press Jan, D., (2006) Principals of Protein X-ray Crystallography, , Springer Blumenthal, L.M., (1953) Theory and Applications of Distance Geometry, , Oxford Clarendon Press Crippen, G., Havel, T., (1988) Distance Geometry and Molecular Conformation, , John Wiley & Sons, New York Liberti, L., Lavor, C., Maculan, N., Mucherino, A., Euclidean distance geometry and applications (2014) SIAM Review, 56. , article in press Havel, T.F., (1995) Distance Geometry, 4. , John Wiley & Sons Saxe, J., Embeddability of weighted graphs in k-space is strongly np-hard. in (1979) Proceedings of 17th Allerton Conference in Communications Control and Computing, pp. 480-489 Moŕe, J.J., Wu, Z., Global continuation for distance geometry problems (1997) SIAM Journal of Optimization, 7, pp. 814-836 Moŕe, J.J., Wu, Z., Distance geometry optimization for protein strucutures (1999) Journal of Global Optimization, 15 (3), pp. 219-234 An, L.T.H., Solving large scale molecular distance geometry problems by a smoothing technique via the gaussian transform and D.C. Programming (2003) Journal of Global Optimization, 27, pp. 375-397 An, L.T.H., Tao, P.D., Large-scale molecular optimization from distance matrices by a D.C. Optimization approach (2003) SIAM Journal of Optimization, 14 (1), pp. 77-114 Liberti, L., Lavor, C., Mucherino, A., Maculan, N., Molecular distance geometry methods: From continuous to discrete (2010) International Transactions in Operational Research, 18, pp. 33-51 Wüthrich, K., (1995) NMR in Structural Biology, , World Scientific, New York Havel, T., An evaluation of computational strategies for use in the determination of protein structure from distance constraints obtained by nuclear magnetic resonance (1991) Progress in Biophysics and Molecular Biology, 56 (1), pp. 43-78 Hendrickson, B., (1991) The Molecular Problem: Determining Conformation from Pairwise Distances, , PhD thesis, Cornell University Hendrickson, B., The molecule problem: Exploiting structure in global optimization (1995) SIAM Journal of Optimization, 5, pp. 835-857 Dong, Q., Wu, Z., A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data (2003) Journal of Global Optimization, 26 (3), pp. 321-333 Wu, D., Wu, Z., An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data (2007) Journal of Global Optimization, 37 (4), pp. 661-673 Sit, A., Wu, Z., Yuan, Y., A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation (2009) Bulletin of Mathematical Biology, 71 (8), pp. 1914-1933 Sit, A., Wu, Z., Solving a generalized distance geometry problem for protein structure determination (2011) Bulletin of Mathematical Biology, pp. 1-28 Brünger, A.T., Adams, P.D., Clore, G.M., Delano, W.L., Gros, P., Grosse-Kunstleve, R., Jiang, J.S., Warren, G.L., Crystallography & nmr system: A new software suite for macromolecular structure determination (1998) Acta Crystallographica Section D-Biological Crystallography, D54, pp. 905-921 Schwieters, C.D., Kuszewski, J.J., Tjandra, N., Clore, G.M., The xplor-nih nmr molecular structure determination package (2003) Journal of Magnetic Resonance, 160, pp. 65-73 Lavor, C., Liberti, L., Maculan, N., Mucherino, A., The discretizable molecular distance geometry problem (2012) Computational Optimization and Applications, 52, pp. 115-146 Liberti, L., Lavor, C., Maculan, N., A branch-and-prune algorithm for the molecular distance geometry problem (2008) International Transactions in Operational Research, 15, pp. 1-17 Kim, D.S., Cho, Y., Sugihara, K., Ryu, J., Kim, D., Three-dimensional beta-shapes and beta-complexes via quasi-triangulation (2010) Computer-Aided Design, 42 (10), pp. 911-929 Kim, D.S., Kim, J.K., Cho, Y., Kim, C.M., Querying simplexes in quasi-triangulation (2012) Computer-Aided Design, 44 (2), pp. 85-98 Kim, D.S., Seo, J., Kim, D., Ryu, J., Cho, C.H., Three-dimensional beta shapes (2006) Computer-Aided Design, 38 (11), pp. 1179-1191 Cho, Y., Kim, J.K., Ryu, J., Won, C.I., Kim, C.M., Kim, D., Kim, D.S., BetaMol: A molecular modeling, analysis and visualization software based on the beta-complex and the quasi-triangulation (2012) Journal of Advanced Mechanical Design, Systems, and Manufacturing, 6 (3), pp. 389-403 Cho, Y., Kim, D., Kim, D.S., Topology representation for the voronoi diagram of 3d spheres (2005) International Journal of CAD/CAM, 5 (1), pp. 59-68. , http://www.ijcc.org Kim, D.S., Cho, Y., Kim, D., Euclidean voronoi diagram of 3d balls and its computation via tracing edges (2005) Computer-Aided Design, 37 (13), pp. 1412-1424 Okabe, A., Boots, B., Sugihara, K., Chiu, S.N., (1999) Spatial Tessellations: Concepts and Applications of Voronoi Diagrams 2nd Edn, , John Wiley & Sons, Chichester Munkres, J.R., (1984) Elements of Algebraic Topology, , Perseus Press Boissonnat, J.D., Yvinec, M., (1998) Algorithmic Geometry, , Cambridge University Press, Cambridge Kim, D.S., Kim, D., Cho, Y., Sugihara, K., Quasi-triangulation and interworld data structure in three dimensions (2006) Computer-Aided Design, 38 (7), pp. 808-819 Kim, D.S., Cho, Y., Sugihara, K., Quasi-worlds and quasi-operators on quasi-triangulations (2010) Computer-Aided Design, 42 (10), pp. 874-888 Kim, D.S., Cho, Y., Ryu, J., Kim, J.K., Kim, D., Anomalies in quasi-triangulations and beta-complexes of spherical atoms in molecules (2013) Computer-Aided Design, 45 (1), pp. 35-52 Kim, J.K., Kim, D.S., Betasuperposer: Superposition of protein surfaces using beta-shapes (2012) Journal of Biomolecular Structure & Dynamics, 30 (6), pp. 684-700 Dunbrack Jr., R.L., Rotamer libraries in the 21st century (2002) Current Opinion in Structural Biology, 12 (4), pp. 431-440 Dunbrack Jr., R.L., Karplus, M., Backbone-dependent rotamer library for proteins (1993) Journal of Molecular Biology, 230 (2), pp. 543-574 Dunbrack Jr., R.L., Karplus, M., Conformational analysis of the backbone-dependent rotamer preferences of protein sidechains (1994) Journal of Molecular Biology, 1 (5), pp. 334-340 Kono, H., Rotamer libraries for molecular modeling and design of proteins (2009) Protein Engineering and Design, , Park, S.J., Cochran, J.R. (eds.) Chazelle, B., Kingsford, C., Singh, M., (2004) The Inapproximability of Side-chain Positioning, , Technical report, Princeton University Fung, H., Rao, S., Floudas, C., Prokopyev, O., Pardalos, P., Rendl, F., Computational comparison studies of quadratic assignment like formulations for the in silico sequence selection problem in de novo protein design (2005) Journal of Combinatorial Optimization, 10 (1), pp. 41-60 Pierce, N.A., Winfree, E., Protein design is np-hard (2002) Protein Engineering, 15 (10), pp. 779-782 Althaus, E., Kohlbacher, O., Lenhof, H.P., Müller, P., A combinatorial approach to protein docking with flexible side-chains. in (2000) RECOMB 2000 Proceedings of the Fourth Annual International Conference on Computational Molecular Biology, pp. 15-24 Althaus, E., Kohlbacher, O., Lenhof, H.P., Müller, P., A combinatorial approach to protein docking with flexible side chains (2002) Journal of Computational Biology, 9 (4), pp. 597-612 Lee, C., Subbiah, S., Prediction of protein side-chain conformation by packing optimization (1991) Journal of Molecular Biology, 217 (2), pp. 373-388 Tuffery, P., Etchebest, C., Hazout, S., Lavery, R., A new approach to the rapid determination of protein side chain conformations (1991) Journal of Biomolecular Structure & Dynamics, 8 (6), pp. 1267-1289 Leach, A.R., (2001) Molecular Modelling: Principles and Applications, , Prentice Hall Ryu, J., Kim, D.S., Protein structure optimization by side-chain positioning via beta-complex (2012) Journal of Global Optimization, , doi: 10.1007/s10898-012-9886-3