Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

A novel algorithm for non-bonded-list updating in molecular simulations.

Tatiana Maximova1, Chen Keasar

  • 1Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, Israel.

Journal of Computational Biology : a Journal of Computational Molecular Cell Biology
|June 27, 2006
PubMed
Summary

Efficient non-bonded list processing speeds up molecular simulations. A new grid-based algorithm significantly reduces simulation time for large systems with slow particle movement.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

The peptidyl-prolyl cis-trans isomerase, Pin1, is a regulator of the protein kinase C θ (PKCθ) catalytic activity in activated T cells.

Protein science : a publication of the Protein Society·2025
Same author

Protein Design Using Physics Informed Neural Networks.

Biomolecules·2023
Same author

The Peptidyl-Prolyl <i>cis-trans</i> isomerase, Pin1, associates with Protein Kinase C θ <i>via</i> a critical Phospho-Thr-Pro motif in the V3 regulatory domain.

Frontiers in immunology·2023
Same author

Mimetic Neural Networks: A Unified Framework for Protein Design and Folding.

Frontiers in bioinformatics·2022
Same author

Estimation of model accuracy by a unique set of features and tree-based regressor.

Scientific reports·2022
Same author

Unraveling the hidden role of a uORF-encoded peptide as a kinase inhibitor of PKCs.

Proceedings of the National Academy of Sciences of the United States of America·2021

Area of Science:

  • Computational Chemistry
  • Molecular Dynamics
  • Biophysics

Background:

  • Molecular simulations require calculating interactions between non-bonded pairs.
  • Generating and updating these non-bonded lists is computationally intensive for large systems.
  • Optimizing non-bonded list processing is crucial for accelerating molecular energy calculations.

Purpose of the Study:

  • To develop an efficient algorithm for non-bonded list processing in molecular simulations.
  • To reduce the computational time required for energy calculations in large molecular systems.
  • To enhance the performance of molecular dynamics simulations.

Main Methods:

  • A heuristic extension to existing grid-based algorithms for non-bonded pair detection.
  • Implementation within the DistanceMatrix class of the MESHI molecular modeling package.

Related Experiment Videos

  • Performance evaluation based on simulation time reduction for systems with slow particle movement.

    • Main Results:

    • The proposed algorithm offers significant reductions in simulation time.
    • Performance gains are most pronounced when average particle movements are slow.
    • The algorithm is integrated into the freely available MESHI software.

    Conclusions:

    • The heuristic grid-based extension provides a substantial optimization for non-bonded list processing.
    • This method effectively accelerates molecular simulations, particularly for systems exhibiting slow dynamics.
    • The MESHI package now incorporates this performance enhancement for broader accessibility.