Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Implicit Differentiation: Problem Solving

Implicit Differentiation: Problem Solving

Curves defined implicitly, where variables cannot be separated algebraically, require specialized techniques for analysis. The conchoid of Nicomedes exemplifies such a case. Its equation links x and y in a way that prevents isolation of one variable, making implicit differentiation essential to determine the slope and behavior at any point on the curve.The implicit form of the conchoid can be expressed as:To differentiate this equation, y is treated as a function of x, and the chain rule is...

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

Improving Translational Accuracy

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...

Improving Translational Accuracy

Improving Translational Accuracy

Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...

Heuristics

Heuristics

Heuristics are problem-solving strategies that use mental shortcuts to simplify decision-making. Unlike algorithms, which must be followed precisely to achieve a correct result, heuristics offer a general problem-solving framework. They save time and energy but can sometimes lead to less rational decisions.
People often rely on heuristics when faced with an overload of information, limited time, low importance of the decision, limited information, or when a heuristic readily comes to mind. For...

Statically Indeterminate Problem Solving

Statically Indeterminate Problem Solving

Statically indeterminate problems are those where statics alone can not determine the internal forces or reactions. Consider a structure comprising two cylindrical rods made of steel and brass. These rods are joined at point B and restrained by rigid supports at points A and C. Now, the reactions at points A and C and the deflection at point B are to be determined. This rod structure is classified as statically indeterminate as the structure has more supports than are necessary for maintaining...

You might also read

Related Articles

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

Sort by

Same author

NanoSimFormer: an end-to-end transformer-based nanopore signal simulator with basecaller guidance.

Bioinformatics (Oxford, England)·2026

Same author

Image-Enhanced Multi-Modal Contrastive Transformer for Subcellular Spatial Transcriptomics.

IEEE journal of biomedical and health informatics·2025

Same author

DeepPhosPPI: a deep learning framework with attention-CNN and transformer for predicting phosphorylation effects on protein-protein interactions.

Briefings in bioinformatics·2025

Same author

Identification of RC3H1 as antiviral host factor binding to the non-structural protein 1 of Influenza A virus via a 3-stage computational pipeline and cell-based analysis.

Virology journal·2025

Same author

Systematic benchmarking of deep-learning methods for tertiary RNA structure prediction.

PLoS computational biology·2025

Same author

STCGAN: a novel cycle-consistent generative adversarial network for spatial transcriptomics cellular deconvolution.

Briefings in bioinformatics·2024

Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024

See all related articles

Search research articles

Related Experiment Video

Updated: May 21, 2026

New Features in Visual Dynamics 3.0

New Features in Visual Dynamics 3.0

Published on: August 9, 2024

QuickVina: accelerating AutoDock Vina using gradient-based heuristics for global optimization.

Stephanus Daniel Handoko¹, Xuchang Ouyang, Chinh Tran To Su

¹Centre for Computational Intelligence, School of Computer Engineering, Nanyang Technological University, Singapore. sdhandoko@ntu.edu.sg

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|May 30, 2012

Summary

This summary is machine-generated.

This study introduces QVina, an improved version of AutoDock Vina, which significantly speeds up molecular docking simulations. QVina accelerates binding predictions by optimizing the local search algorithm, enabling faster screening of drug candidates.

More Related Videos

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis

Published on: June 20, 2025

Related Experiment Videos

Last Updated: May 21, 2026

New Features in Visual Dynamics 3.0

New Features in Visual Dynamics 3.0

Published on: August 9, 2024

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis

Incorporating Target Protein Structure Flexibility and Dynamics in Computational Drug Discovery Using Ensemble-Based Docking Analysis

Published on: June 20, 2025

Area of Science:

Computational chemistry
Drug discovery
Molecular modeling

Background:

Predicting macromolecule-small molecule binding is essential for rational drug design.
AutoDock Vina (2009) is a widely used docking software known for speed and accuracy.
It uses an empirical scoring function and iterated local search for optimization.

Purpose of the Study:

To enhance the local search algorithm of AutoDock Vina.
To improve the speed of molecular docking predictions.
To enable faster screening of potential drug ligands.

Main Methods:

Developed QVina, an improved version of AutoDock Vina.
Implemented a heuristic approach to prevent certain intermediate points from local search.
Tested QVina on 231 protein-ligand complexes.

Main Results:

QVina achieved a maximum acceleration of approximately 25 times and an average speed-up of 8.34 times compared to AutoDock Vina.
Optimal binding scores were largely maintained.
The improved efficiency allows for screening more ligands in the same timeframe.

Conclusions:

QVina offers a significant speed improvement for molecular docking.
The heuristic modification enhances computational efficiency in drug discovery.
This advancement facilitates quicker screening of diverse ligand libraries against target receptors.