The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January/February (2012 vol.9)
pp: 240-248
Shuai Cheng Li , David R. Sheriton Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON, Canada
Dongbo Bu , Inst. of Comput. Technol., Beijing, China
Ming Li , David R. Sheriton Sch. of Comput. Sci., Univ. of Waterloo, Waterloo, ON, Canada
ABSTRACT
We present in this study a new approach to code protein side-chain conformations into hexagon substructures. Classical side-chain packing methods consist of two steps: first, side-chain conformations, known as rotamers, are extracted from known protein structures as candidates for each residue; second, a searching method along with an energy function is used to resolve conflicts among residues and to optimize the combinations of side chain conformations for all residues. These methods benefit from the fact that the number of possible side-chain conformations is limited, and the rotamer candidates are readily extracted; however, these methods also suffer from the inaccuracy of energy functions. Inspired by threading and Ab Initio approaches to protein structure prediction, we propose to use hexagon substructures to implicitly capture subtle issues of energy functions. Our initial results indicate that even without guidance from an energy function, hexagon structures alone can capture side-chain conformations at an accuracy of 83.8 percent, higher than 82.6 percent by the state-of-art side-chain packing methods.
INDEX TERMS
Amino acids, Accuracy, Proteins, Libraries, Matrices, Bioinformatics, Databases,hexagon substructures., Protein structure, side-chain packing, rotamer
CITATION
Shuai Cheng Li, Dongbo Bu, Ming Li, "Residues with Similar Hexagon Neighborhoods Share Similar Side-Chain Conformations", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, no. 1, pp. 240-248, January/February 2012, doi:10.1109/TCBB.2011.74
REFERENCES
[1] K.C.D. Bahadur, T. Akutsu, E. Tomita, and T. Seki, “Protein Side-Chain Packing Problem: A Maximum Edge-Weight Clique Algorithmic Approach,” APBC '04: Proc. Second Conf. Asia-Pacific Bioinformatics, pp. 191-200, 2004.
[2] R. Bonneau, J. Tsai, I. Ruczinski, D. Chivian, C. Rohl, C.E.M. Strauss, and D. Baker, “Rosetta in CASP4: Progress in Ab Initio Protein Structure Prediction,” Proteins: Structure, Function, and Bioinformatics, vol. 45, no. S5, pp. 119-126, 2001.
[3] P. Bradley, P.S. Kim, and B. Berger, “Trilogy: Discovery of Sequence Structure Patterns across Diverse Proteins,” Proc. Nat'l Academy of Sciences USA, vol. 99, no. 13, pp. 8500-8505, 2002.
[4] A.A. Canutescu, A.A. Shelenkov, and R.L. Dunbrack, “A Graph-Theory Algorithm for Rapid Protein Side-Chain Prediction,” Protein Science, vol. 12, no. 9, pp. 2001-2014, 2003.
[5] B. Chazelle, C. Kingsford, and M. Singh, “A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies,” Informs J. Computing, vol. 16, no. 4, pp. 380-392, 2004.
[6] Y. Chen, S. Ora, and W. Yair, “Minimizing and Learning Energy Functions for Side-Chain Prediction,” J. Computational Biology, vol. 15, no. 7, pp. 899-911, 2008.
[7] M. De Maeyer, J. Desmet, and I. Lasters, “The Dead-End Elimination Theorem: Mathematical Aspects, Implementation, Optimizations, Evaluation, and Performance,” Methods in Molecular Biology, vol. 143, pp. 265-304, 2000.
[8] J. Desmet, M.D. Maeyer, B. Hazes, and I. Lasters, “The Dead-End Elimination Theorem and Its Use in Protein Side-Chain Positioning,” Nature, vol. 356, no. 6369, pp. 539-542, Apr. 1992.
[9] J. Desmet, M. De Maeyer, and I. Lasters, “Theoretical and Algorithmical Optimization of the Dead-End Elimination Theorem,” Proc. Pacific Symp. in Biocomputing, pp. 122-133, 1997.
[10] R.L. Dunbrack, “Rotamer Libraries in the 21st Century,” Current Opinion in Structural Biology, vol. 4, pp. 431-440, Aug. 2002.
[11] R.L. Dunbrack and F.E. Cohen, “Bayesian Statistical Analysis of Protein Side-Chain Rotamer Preferences,” Protein Science, vol. 6, no. 8, pp. 1661-1681, Aug. 1997.
[12] R.L. Dunbrack and M. Karplus, “Backbone-Dependent Rotamer Library for Proteins Application to Side-Chain Prediction,” J. Molecular Biology, vol. 230, no. 2, pp. 543-574, 1993.
[13] R.L. Dunbrack and M. Karplus, “Conformational Analysis of the Backbone-Dependent Rotamer Preferences of Protein Sidechains,” Nature Structural Biology, vol. 1, no. 5, pp. 334-340, May 1994.
[14] O. Eriksson, Y. Zhou, and A. Elofsson, “Side Chain-Positioning as an Integer Programming Problem,” WABI '01: Proc. First Int'l Workshop Algorithms in Bioinformatics, pp. 128-141, 2001.
[15] R.F. Goldstein, “Efficient Rotamer Elimination Applied to Protein Side-Chains and Related Spin Glasses,” Biophysical J., vol. 66, no. 5, pp. 1335-1340, 1994.
[16] D.B. Gordon and S.L. Mayo, “Branch-and-Terminate: A Combinatorial Optimization Algorithm for Protein Design,” Structure, vol. 7, no. 9, pp. 1089-1098, 1999.
[17] S. Henikoff and J.G. Henikoff, “Amino Acid Substitution Matrices from Protein Blocks,” Proc. Nat'l Academy of Sciences USA, vol. 89, no. 22, pp. 10915-10919, Nov. 1992.
[18] L. Holm and C. Sander, “Database Algorithm for Generating Protein Backbone and Side-Chain Co-Ordinates from a c[Alpha] Trace: Application to Model Building and Detection of Co-Ordinate Errors,” J. Molecular Biology, vol. 218, no. 1, pp. 183-194, 1991.
[19] T.R. Hvidsten, A. Laegreid, A. Kryshtafovych, G. Andersson, K. Fidelis, and J. Komorowski, “A Comprehensive Analysis of the Structure-Function Relationship in Proteins Based on Local Structure Similarity,” PLoS ONE, vol. 4, no. 7, p. 9, 2009.
[20] J. Hwang and W. Liao, “Side-Chain Prediction by Neural Networks and Simulated Annealing Optimization,” Protein Eng., vol. 8, no. 4, pp. 363-370, 1995.
[21] M.A. Carrondo, C.M. Soares, J. Mendes, and A.M. Baptista, “Improved Modeling of Side-Chains in Proteins with Rotamer-Based Methods: A Flexible Rotamer Model,” Proteins: Structure, Function, and Genetics, vol. 37, no. 4, pp. 530-543, 1999.
[22] J. Janin, S. Wodak, M. Levitt, and B. Maigret, “The Conformation of Amino Acid Side-Chains in Proteins,” J. Molecular Biology, vol. 125, no. 3, pp. 357-386, 1978.
[23] D.A. Keller, M. Shibata, E. Marcus, R.L. Ornstein, and R. Rein, “Finding the Global Minimum: A Fuzzy End Elimination Implementation,” Protein Eng., vol. 8, no. 9, pp. 893-904, 1995.
[24] C.L. Kingsford, B. Chazelle, and M. Singh, “Solving and Analyzing Side-Chain Positioning Problems Using Linear and Integer Programming,” Bioinformatics, vol. 21, no. 7, pp. 1028-1039, 2005.
[25] D.E. Knuth and A. Raghunathan, “The Problem of Compatible Representatives,” SIAM J. Discrete Math., vol. 5, no. 3, pp. 422-427, 1992.
[26] I. Lasters, M. De Maeyer, and J. Desmet, “Enhanced Dead-End Elimination in the Search for the Global Minimum Energy Conformation of a Collection of Protein Side Chains,” Protein Eng., vol. 8, no. 8, pp. 815-822, 1995.
[27] I. Lasters and J. Desmet, “The Fuzzy-End Elimination Theorem: Correctly Implementing the Side Chain Placement Algorithm Based on the Dead-End Elimination Theorem,” Protein Eng., vol. 6, no. 7, pp. 717-722, 1993.
[28] C. Lee and S. Subbiah, “Prediction of Protein Side-Chain Conformation by Packing Optimization,” J. Molecular Biology, vol. 217, no. 2, pp. 373-388, 1991.
[29] S. Liang and N.V. Grishin, “Side Chain Modeling with an Optimized Scoring Function,” Protein Science, vol. 11, no. 2, pp. 322-331, Feb. 2002.
[30] D. Lichtenstein, “Planar Formulae and Their Uses,” SIAM J. Computing, vol. 11, no. 2, pp. 329-343, 1982.
[31] L.L. Looger and H.W. Hellinga, “Generalized Dead-End Elimination Algorithms Make Large-Scale Protein Side-Chain Structure Prediction Tractable: Implications for Protein Design and Structural Genomics,” J. Molecular Biology, vol. 307, no. 1, pp. 429-445, Mar. 2001.
[32] S.C. Lovell, J.M. Word, J.S. Richardson, and D.C. Richardson, “The Penultimate Rotamer Library,” Proteins, vol. 40, no. 3, pp. 389-408, Aug. 2000.
[33] M.D. Maeyer, J. Desmet, and I. Lasters, “All in One: A Highly Detailed Rotamer Library Improves Both Accuracy and Speed in the Modelling of Sidechains by Dead-End Elimination,” Folding and Design, vol. 2, no. 1, pp. 53-66, 1997.
[34] M.J. McGregor, S.A. Islam, and M.J.E. Sternberg, “Analysis of the Relationship between Side-Chain Conformation and Secondary Structure in Globular Proteins,” J. Molecular Biology, vol. 198, no. 2, pp. 295-310, 1987.
[35] W. Mulzer and G. Rote, “Minimum-Weight Triangulation is NP-Hard,” J. ACM, vol. 55, no. 2, pp. 1-29, 2008.
[36] N.A. Pierce, J.A. Spriet, J. Desmet, and S.L. Mayo, “Conformational Splitting: A More Powerful Criterion for Dead-End Elimination,” J. Computational Chemistry, vol. 21, no. 11, pp. 999-1009, 2000.
[37] N.A. Pierce and E. Winfree, “Protein Design is NP-Hard,” Protein Eng., vol. 15, no. 10, pp. 779-782, 2002.
[38] J.W. Ponder and F.M. Richards, “Tertiary Templates for Proteins: Use of Packing Criteria in the Enumeration of Allowed Sequences for Different Structural Classes,” J. Molecular Biology, vol. 193, no. 4, pp. 775-791, 1987.
[39] A. Roitberg and R. Elber, “Modeling Side Chains in Peptides and Proteins: Application of the Locally Enhanced Sampling and the Simulated Annealing Methods to Find Minimum Energy Conformations,” The J. Chemical Physics, vol. 95, no. 12, pp. 9277-9287, 1991.
[40] A.G. Street and S.L. Mayo, “Intrinsic Beta-Sheet Propensities Result from Van Der Waals Interactions between Side Chains and the Local Backbone,” Proc. Nat'l Academy of Sciences USA, vol. 96, no. 16, pp. 9074-9076, Aug. 1999.
[41] T. Akutsu, “NP-Hardness Results for Protein Side-Chain Packing,” Genome Informatics Series, vol. 8, pp. 180-186, 1997.
[42] P. Tuffery, C. Etchebest, S. Hazout, and R. Lavery, “A New Approach to the Rapid Determination of Protein Side Chain Conformations,” J. Biomolecular Structure and Dynamics, vol. 8, no. 6, pp. 1267-1289, 1991.
[43] M. Vásquez, “An Evaluvation of Discrete and Continuum Search Techniques for Conformational Analysis of Side Chains in Proteins,” Biopolymers, vol. 36, no. 1, pp. 53-70, 1995.
[44] C.A. Voigt, D.B. Gordon, and S.L. Mayo, “Trading Accuracy for Speed: A Quantitative Comparison of Search Algorithms in Protein Sequence Design,” J. Molecular Biololgy, vol. 299, no. 3, pp. 789-803, June 2000.
[45] J.M. Word, S.C. Lovell, T.H. LaBean, H.C. Taylor, M.E. Zalis, B.K. Presley, J.S. Richardson, and D.C. Richardson, “Visualizing and Quantifying Molecular Goodness-of-Fit: Small-Probe Contact Dots with Explicit Hydrogen Atoms,” J. Molecular Biology, vol. 285, no. 4, pp. 1711-1733, 1999.
[46] J.M. Word, S.C. Lovell, J.S. Richardson, and D.C. Richardson, “Asparagine and Glutamine: Using Hydrogen Atom Contacts in the Choice of Side-Chain Amide Orientation,” J. Molecular Biology, vol. 285, no. 4, pp. 1735-1747, Jan. 1999.
[47] Z. Xiang and B. Honig, “Extending the Accuracy Limits of Prediction for Side-Chain Conformations,” J. Molecular Biology, vol. 311, no. 2, pp. 421-430, 2001.
[48] J. Xu and B. Berger, “Fast and Accurate Algorithms for Protein Side-Chain Packing,” J. ACM, vol. 53, no. 4, pp. 533-557, 2006.
34 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool