PubMed Health⌕ Search

PubMed · 16392529

Adaptive time stepping in biomolecular dynamics.

Abstract

We present an adaptive time stepping scheme based on the extrapolative method of Barth and Schlick [LN, J. Chem. Phys. 109, 1633 (1998)] to numerically integrate the Langevin equation with a molecular-dynamics potential. This approach allows us to use (on average) a time step for the strong nonbonded force integration corresponding to half the period of the fastest bond oscillation, without compromising the slow degrees of freedom in the problem. We show with simple examples how the dynamic step size stabilizes integration operators, and discuss some of the limitations of such stability. The method introduced uses a slightly more accurate inner integrator than LN to accommodate the larger steps. The adaptive time step approach reproduces temporal features of the bovine pancreatic trypsin inhibitor (BPTI) test system (similar to the one used in the original introduction of LN) compared to short-time integrators, but with energies that are shifted with respect to both LN, and traditional stochastic versions of Verlet. Although the introduction of longer steps has the effect of systematically heating the bonded components of the potential, the temporal fluctuations of the slow degrees of freedom are reproduced accurately. The purpose of this paper is to display a mechanism by which the resonance traditionally associated with using time steps corresponding to half the period of oscillations in molecular dynamics can be avoided. This has theoretical utility in terms of designing numerical integration schemes--the key point is that by factoring a propagator so that time steps are not constant one can recover stability with an overall (average) time step at a resonance frequency. There are, of course, limitations to this approach associated with the complicated, nonlinear nature of the molecular-dynamics (MD) potential (i.e., it is not as straightforward as the linear test problem we use to motivate the method). While the basic notion remains in the full Newtonian problem, it is easier to see the effects when damping is considered to be physical--that is, we do not view our method as a perturbation of Newtonian dynamics, we associate the damping with the environment, for example, a water bath (with gamma approximately 90 ps(-1)) [Zagrovic and Pande, J. Comp. Chem. 24, 1432 (2003)]. All stochastic approaches to MD are stabilized by large physical damping, but here, we are really using it only to show that the resonance frequency can be obtained. Another simplifying assumption used in this paper is "heavy" hydrogen (we take the hydrogen mass to be 10 amu)--the view here is that we are interested primarily in the slowest degrees of freedom, and this approach has effects similar to bond freezing and united atom treatments of hydrogen. So from the point of view of biomolecular applications, the method described here is best suited to studies in which water is not explicit (so that damping in the problem can really be viewed as environmental interaction), and the interest is in slow dynamics where the effects of hydrogen are neglectable. There are a number of parameters in the LN method and the one derived here, and we cannot in a short paper address all adjustments, so our primary goal as a first pass is to show that stability can be recovered for a set of numerically forced (and hence artificial) bond oscillations, and compare stability to fixed-step methods.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

J Franklin, S Doniach. 2005-09-22. Adaptive time stepping in biomolecular dynamics.. https://doi.org/10.1063/1.1997137

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗