The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - Nov.-Dec. (2012 vol.9)
pp: 1847-1849
D. Györffy , Res. Centre for Natural Sci., Inst. of Enzymology, Budapest, Hungary
P. Zavodszky , Res. Centre for Natural Sci., Inst. of Enzymology, Budapest, Hungary
A. Szilágyi , Res. Centre for Natural Sci., Inst. of Enzymology, Budapest, Hungary
ABSTRACT
"Pull moves” is a popular move set for lattice polymer model simulations. We show that the proof given for its reversibility earlier is flawed, and some moves are irreversible, which leads to biases in the parameters estimated from the simulations. We show how to make the move set fully reversible.
INDEX TERMS
Mathematical model, Lattices, Computational biology, Bioinformatics, Polymers,HP model, Pull moves, lattice model
CITATION
D. Györffy, P. Zavodszky, A. Szilágyi, ""Pull Moves" for Rectangular Lattice Polymer Models Are Not Fully Reversible", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.9, no. 6, pp. 1847-1849, Nov.-Dec. 2012, doi:10.1109/TCBB.2012.129
REFERENCES
[1] P.H. Verdier and W.H. Stockmayer, “Monte Carlo calculations on the Dynamics of Polymers in Dilute Solution,” J. Chemical Physics, vol. 36, pp. 227-235, 1962.
[2] O.J. Heilmann and J. Rotne, “Exact and Monte Carlo Computations on a Lattice Model for Change of Conformation of a Polymer,” J. Statistical Physics, vol. 27, pp. 19-35, 1982.
[3] K.F. Lau and K.A. Dill, “A Lattice Statistical Mechanics Model of the Conformational and Sequence Spaces of Proteins,” Macromolecules, vol. 22, pp. 3986-3997, 1989.
[4] K.A. Dill, S. Bromberg, K. Yue, K.M. Fiebig, D.P. Yee, P.D. Thomas, and H.S. Chan, “Principles of Protein Folding-a Perspective from Simple Exact Models,” Protein Science, vol. 4, pp. 561-602, 1995.
[5] W.K. Hastings, “Monte Carlo Sampling Methods Using Markov Chains and Their Applications,” Biometrika, vol. 57, no. 1, pp. 97-109, 1970.
[6] S.C. Kou, J. Oh, and W.H. Wong, “A Study of Density of States and Ground States in Hydrophobic-Hydrophilic Protein Folding Models by Equi-Energy Sampling,” J. Chemical Physics, vol. 124, article 244903, 2006.
[7] F. Wang and D.P. Landau, “Efficient, Multiple-Range Random Walk Algorithm to Calculate the Density of States,” Physical Rev. Letters, vol. 86, pp. 2050-2053, 2001.
[8] T. Wüst and D.P. Landau, “The HP Model of Protein Folding: A Challenging Testing Ground for Wang-Landau Sampling,” Computer Physics Comm., vol. 180, pp. 475-479, 2008.
[9] M. Lal, “‘Monte Carlo’ Computer Simulation of Chain Molecules I,” Molecular Physics, vol. 17, no. 1, pp. 57-64, 1969.
[10] N. Madras and A.D. Sokal, “The Pivot Algorithm: A Highly Efficient Monte Carlo Method for the Self-Avoiding Walk,” J. Statistical Physics, vol. 50, pp. 109-186, 1988.
[11] T. Wüst, Y.W. Li, and D.P. Landau, “Unraveling the Beautiful Complexity of Simple Lattice Model Polymers and Proteins Using Wang-Landau Sampling,” J. Statistical Physics, vol. 144, pp. 638-651, 2011.
[12] N. Madras and A.D. Sokal, “Nonergodicity of Local, Length-Conserving Monte Carlo Algorithms for the Self-Avoiding Walk,” J. Statistical Physics, vol. 47, pp. 573-595, 1987.
[13] J.M. Deutsch, “Long Range Moves for High Density Polymer Simulations,” J. Chemical Physics, vol. 106, pp. 8849-8854, 1997.
[14] T. Wüst and D.P. Landau, “Versatile Approach to Access the Low Temperature Thermodynamics of Lattice Polymers and Proteins,” Physical Rev. Letters, vol. 102, no. 17, p. 178101, 2009.
[15] N. Lesh, M. Mitzenmacher, and S. Whitesides, “A Complete and Effective Move Set for Simplified Protein Folding,” Proc. Seventh Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB '03), pp. 188-195, http://doi.acm.org/10.1145640075.640099, 2003.
[16] C. Thachuk, A. Shmygelska, and H.H. Hoos, “A Replica Exchange Monte Carlo Algorithm for Protein Folding in the HP Model,” BMC Bioinformatics, vol. 8, p. 342, 2007.
[17] A.D. Swetnam and M.P. Allen, “Improved Simulations of Lattice Peptide Adsorption,” Physical Chemistry Chemical Physics, vol. 11, pp. 2046-2055, 2009.
[18] J. Błazewicz, P. Lukasiak, and M. Miłostan, “Application of Tabu Search Strategy for Finding Low Energy Structure of Protein,” Artificial Intelligence Medicine, vol. 35, pp. 135-145, 2005.
[19] H.-J. Böckenhauer, A. Dayem Ullah, L. Kapsokalivas, and K. Steinhöfel, “A Local Move Set for Protein Folding in Triangular Lattice Models,” Proc. Int'l Workshop Algorithms in Bioinformatics, K. Crandall and J. Lagergren, eds., pp. 369-381, 2008.
[20] M. Jiang and B. Zhu, “Protein Folding on the Hexagonal Lattice in the HP Model,” J. Bioinformatics Computational Biology, vol. 3, pp. 19-34, 2005.
[21] R. Unger and J. Moult, “Genetic Algorithms for Protein Folding Simulations,” J. Molecular Biology, vol. 231, pp. 75-81, 1993.
[22] A.D. Swetnam and M.P. Allen, “Improving the Wang-Landau Algorithm for Polymers and Proteins,” J. Computational Chemistry, vol. 32, pp. 816-821, 2011.
[23] M. Mann, D. Maticzka, R. Saunders, and R. Backofen, “Classifying Protein Like Sequences in Arbitrary Lattice Protein Models Using Latpack,” HFSP J., vol. 2, pp. 396-404, 2008.
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool