PubMed Health⌕ Search

PubMed · 7892172

Protein simulations using techniques suitable for very large systems: the cell multipole method for nonbond interactions and the Newton-Euler inverse mass operator method for internal coordinate dynamics.

Abstract

Two new methods developed for molecular dynamics simulations of very large proteins are applied to a series of proteins ranging up to the protein capsid of tomato bushy stunt virus (TBSV). For molecular dynamics of very large proteins and polymers, it is useful to carry out the dynamics using internal coordinates (say, torsions only) rather than Cartesian coordinates. This allows larger time steps, eliminates problems with the classical description of high energy modes, and focuses on the important degrees of freedom. The resulting equation of motion has the form. [formula: see text] where for T is the vector of generalized forces, M(theta) is the moments of inertia tensor, theta is the vector of torsions, and C is a vector containing Coriolis forces and nonbond forces. The problem is that to calculate the acceleration vector theta from M, C, and T requires inverting M(theta), an order N3 calculation. Since the number of degrees of freedom might be 300,000 for a million atom system, solving these equations every time step is impractical, restricting internal coordinate methods to small systems. The new method, Newton-Euler Inverse Mass Operator (NEIMO) dynamics, constructs the torsional accelerations vector theta = M-1 (T-C) directly by an order N process, allowing internal-coordinate dynamics to be solved for super larger (million atom) systems. The first use of the NEIMO method for molecular dynamics of proteins is presented here. A second serious difficulty for large proteins is calculation of the nonbond forces. We report here the first application to proteins of the new Cell Multipole Method (CMM) to evaluate the Coulomb and van der Waals interactions. The costs of CMM scales linearly with the number of particles while retaining an accuracy significantly better than standard nonbond methods (involving cutoffs). Results for NEIMO and CMM are given for simulations of a wide range of peptide and protein systems, including the protein capsid of TBSV with 488,000 atoms. The computational times for NEIMO and CMM are demonstrated to scale linearly with size. With NEIMO the dynamics time steps can be as large as 20 fs (for small peptides), much larger than possible with standard Cartesian coordinate dynamics. For TBSV we considered both the normal form and the high pH form, in which the Ca2+ ions are removed. These calculations lead to a contraction of the protein for both forms (probably because of ignoring the RNA core not observed in the X-ray).

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A M Mathiowetz, A Jain, N Karasawa, W A Goddard. 1994. Protein simulations using techniques suitable for very large systems: the cell multipole method for nonbond interactions and the Newton-Euler inverse mass operator method for internal coordinate dynamics.. https://doi.org/10.1002/prot.340200304

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↗