Cargando…
On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins
Computer simulation of proteins in aqueous solution at the atomic level of resolution is still limited in time span and system size due to limited computing power available and thus employs a variety of time‐saving techniques that trade some accuracy against computational effort. Examples of such ti...
Autores principales: | , , |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
John Wiley & Sons, Inc.
2021
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8252490/ https://www.ncbi.nlm.nih.gov/pubmed/33951201 http://dx.doi.org/10.1002/jcc.26541 |
_version_ | 1783717311911297024 |
---|---|
author | Pechlaner, Maria Oostenbrink, Chris van Gunsteren, Wilfred F. |
author_facet | Pechlaner, Maria Oostenbrink, Chris van Gunsteren, Wilfred F. |
author_sort | Pechlaner, Maria |
collection | PubMed |
description | Computer simulation of proteins in aqueous solution at the atomic level of resolution is still limited in time span and system size due to limited computing power available and thus employs a variety of time‐saving techniques that trade some accuracy against computational effort. Examples of such time‐saving techniques are the application of constraints to particular degrees of freedom or the use of a multiple‐time‐step (MTS) algorithm distinguishing between particular forces when integrating Newton's equations of motion. The application of two types of MTS algorithms to bond‐stretching forces versus the remaining forces in molecular dynamics (MD) simulations of a protein in aqueous solution or of liquid water is investigated and the results in terms of total energy conservation and the influence on various other properties are compared to those of MD simulations of the same systems using bond‐length, and for water bond‐angle, constraints. At comparable computational effort, the use of bond‐length constraints in proteins leads to better energy conservation and less distorted properties than the two MTS algorithms investigated. |
format | Online Article Text |
id | pubmed-8252490 |
institution | National Center for Biotechnology Information |
language | English |
publishDate | 2021 |
publisher | John Wiley & Sons, Inc. |
record_format | MEDLINE/PubMed |
spelling | pubmed-82524902021-07-07 On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins Pechlaner, Maria Oostenbrink, Chris van Gunsteren, Wilfred F. J Comput Chem Full Papers Computer simulation of proteins in aqueous solution at the atomic level of resolution is still limited in time span and system size due to limited computing power available and thus employs a variety of time‐saving techniques that trade some accuracy against computational effort. Examples of such time‐saving techniques are the application of constraints to particular degrees of freedom or the use of a multiple‐time‐step (MTS) algorithm distinguishing between particular forces when integrating Newton's equations of motion. The application of two types of MTS algorithms to bond‐stretching forces versus the remaining forces in molecular dynamics (MD) simulations of a protein in aqueous solution or of liquid water is investigated and the results in terms of total energy conservation and the influence on various other properties are compared to those of MD simulations of the same systems using bond‐length, and for water bond‐angle, constraints. At comparable computational effort, the use of bond‐length constraints in proteins leads to better energy conservation and less distorted properties than the two MTS algorithms investigated. John Wiley & Sons, Inc. 2021-05-05 2021-07-05 /pmc/articles/PMC8252490/ /pubmed/33951201 http://dx.doi.org/10.1002/jcc.26541 Text en © 2021 The Authors. Journal of Computational Chemistry published by Wiley Periodicals LLC. https://creativecommons.org/licenses/by-nc/4.0/This is an open access article under the terms of the http://creativecommons.org/licenses/by-nc/4.0/ (https://creativecommons.org/licenses/by-nc/4.0/) License, which permits use, distribution and reproduction in any medium, provided the original work is properly cited and is not used for commercial purposes. |
spellingShingle | Full Papers Pechlaner, Maria Oostenbrink, Chris van Gunsteren, Wilfred F. On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
title | On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
title_full | On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
title_fullStr | On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
title_full_unstemmed | On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
title_short | On the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
title_sort | on the use of multiple‐time‐step algorithms to save computing effort in molecular dynamics simulations of proteins |
topic | Full Papers |
url | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8252490/ https://www.ncbi.nlm.nih.gov/pubmed/33951201 http://dx.doi.org/10.1002/jcc.26541 |
work_keys_str_mv | AT pechlanermaria ontheuseofmultipletimestepalgorithmstosavecomputingeffortinmoleculardynamicssimulationsofproteins AT oostenbrinkchris ontheuseofmultipletimestepalgorithmstosavecomputingeffortinmoleculardynamicssimulationsofproteins AT vangunsterenwilfredf ontheuseofmultipletimestepalgorithmstosavecomputingeffortinmoleculardynamicssimulationsofproteins |