๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Constraint dynamics algorithm for simulation of semiflexible macromolecules

โœ Scribed by Wu, Xiong-Wu; Sung, Shen-Shu


Publisher
John Wiley and Sons
Year
1998
Tongue
English
Weight
340 KB
Volume
19
Category
Article
ISSN
0192-8651

No coin nor oath required. For personal study only.

โœฆ Synopsis


Semiflexible models are often used to study macromolecules containing stable structural elements. Based on rigid body dynamics, we developed a rigid fragment constraint dynamics algorithm for the simulation of semiflexible macromolecules. Stable structural elements are treated as rigid fragments. Rigid fragment constraints, defined as combinations of distance constraints and position constraints, are introduced to limit internal molecular motion to the required mode. The constraint forces are solved separately for each rigid fragment constraint and iteratively until all constraint conditions are satisfied within a given tolerance at each time step, as is done for the bond length constraint in the SHAKE algorithm. The orientation of a rigid fragment is represented by the quaternion parameters, and both translation and rotation are solved by the leap-frog formulation. We tested the algorithm with molecular dynamics simulations of a series of peptides and a small protein. The computation cost for the constraints is roughly proportional to the size of the molecule. In the microcanonical ensemble simulation of polyvalines, the total energy was conserved satisfactorily with time steps as large as 20 fs. A helix folding simulation of a synthetic peptide was carried out to show the efficiency of the algorithm in a conformational search.


๐Ÿ“œ SIMILAR VOLUMES


Vector and parallel algorithms for the m
โœ John E. Mertz; Douglas J. Tobias; Charles L. Brooks III; U. C. Singh ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 797 KB

## Abstract A detailed description of vector/parallel algorithms for the molecular dynamics (MD) simulation of macromolecular systems on multiple processor, sharedโ€memory computers is presented. The algorithms encompass three computationally intensive portions of typical MD programs: (__1__) the ev

A dynamic programming algorithm for mult
โœ Mary W. Cooper; Keyvan Farhangian ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB

## This report concerns a discrete mathematical programming problem in which the variables are binary or integer, the objective function separable or factorable, and the constraints are in either of two classes: linear or multiple-choice constraints. The problem is solved using a dynamic programmi

A new algorithm for dynamic simulation
โœ R. Berber; C.B. Brosilow* ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 315 KB
Parallel Algorithm for Cell Dynamics Sim
โœ Xiaohu Guo; Marco Pinna; Andrei V. Zvelindovsky ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 324 KB

## Abstract Cell dynamics simulation (CDS) is a very promising approach to model dynamic processes in block copolymer systems at the mesoscale level. It is difficult to implement a real time and experimentalโ€scale simulation with traditional serial algorithms because of the expensive computation. A

Langevin dynamics simulations of macromo
โœ Bernd Jung; Hans-Peter Lenhof; Peter Mรผller; Christine Rรผb ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 746 KB

## Abstract A parallel algorithm is developed that allows efficient Langevinโ€dynamics simulations of macromolecular coils, which is the usual structure of synthetic polymers in solution and in bulk. Contrary to usual soโ€called spatial decomposition algorithms, we map the oneโ€dimensional topology of